Intelligent Matching Method for College Dormitory Roommates: Chameleon Algorithm Based on Optimized Partitioning Article Swipe
A chameleon algorithm based on optimized partitioning was studied to solve the intelligent matching problem of college dormitory roommates. Using quantitative research methods, data on personal preferences and lifestyle habits of college students were collected, and the K-center object chameleon algorithm was used for data analysis and roommate matching. Test the algorithm performance on the BBC dataset, compare clustering quality indicators such as entropy, purity, and RI value, and verify the effectiveness of the algorithm. This algorithm can accurately assign students to their respective dormitories, avoiding overlapping situations and achieving excellent matching results. In terms of matching accuracy and running time, the K-center object chameleon algorithm shows superior performance compared to other algorithms. In terms of clustering quality evaluation, comparisons were made from three dimensions: entropy value, purity, and RI value. The experimental results show that the closer the entropy value is to 0, the closer the purity and RI value are to 1, and the better the matching effect. This result further validates the effectiveness of the algorithm in the intelligent matching problem of college dormitory roommates. The matching accuracy of this algorithm on the BBC dataset reached 98.82%, showing better clustering quality than other algorithms in terms of entropy, purity, and RI values. The entropy value approached 0, while the purity and RI values approached 1, verifying the efficiency of matching quality. The chameleon algorithm based on optimized partitioning proposed in the study has shown excellent performance in intelligent matching of college dormitory roommates, with the characteristics of high-precision matching and fast running time. It has important practical significance for improving the quality of life and learning efficiency of college dormitory students, and provides new research methods and ideas for related fields.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.12694/scpe.v25i4.2859
- https://www.scpe.org/index.php/scpe/article/download/2859/1115
- OA Status
- diamond
- References
- 16
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4399717303
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4399717303Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.12694/scpe.v25i4.2859Digital Object Identifier
- Title
-
Intelligent Matching Method for College Dormitory Roommates: Chameleon Algorithm Based on Optimized PartitioningWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-06-16Full publication date if available
- Authors
-
Cuiping WangList of authors in order
- Landing page
-
https://doi.org/10.12694/scpe.v25i4.2859Publisher landing page
- PDF URL
-
https://www.scpe.org/index.php/scpe/article/download/2859/1115Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://www.scpe.org/index.php/scpe/article/download/2859/1115Direct OA link when available
- Concepts
-
Matching (statistics), Cluster analysis, Blossom algorithm, Computer science, Entropy (arrow of time), Algorithm, Data mining, Artificial intelligence, Mathematics, Statistics, Physics, Quantum mechanicsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
16Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4399717303 |
|---|---|
| doi | https://doi.org/10.12694/scpe.v25i4.2859 |
| ids.doi | https://doi.org/10.12694/scpe.v25i4.2859 |
| ids.openalex | https://openalex.org/W4399717303 |
| fwci | 0.0 |
| type | article |
| title | Intelligent Matching Method for College Dormitory Roommates: Chameleon Algorithm Based on Optimized Partitioning |
| biblio.issue | 4 |
| biblio.volume | 25 |
| biblio.last_page | 2902 |
| biblio.first_page | 2889 |
| topics[0].id | https://openalex.org/T14413 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.6549999713897705 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Advanced Technologies in Various Fields |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C165064840 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7619200944900513 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1321061 |
| concepts[0].display_name | Matching (statistics) |
| concepts[1].id | https://openalex.org/C73555534 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6689465641975403 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q622825 |
| concepts[1].display_name | Cluster analysis |
| concepts[2].id | https://openalex.org/C61455927 |
| concepts[2].level | 3 |
| concepts[2].score | 0.6342754364013672 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q1030529 |
| concepts[2].display_name | Blossom algorithm |
| concepts[3].id | https://openalex.org/C41008148 |
| concepts[3].level | 0 |
| concepts[3].score | 0.6062501072883606 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[3].display_name | Computer science |
| concepts[4].id | https://openalex.org/C106301342 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5912353992462158 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q4117933 |
| concepts[4].display_name | Entropy (arrow of time) |
| concepts[5].id | https://openalex.org/C11413529 |
| concepts[5].level | 1 |
| concepts[5].score | 0.5619391798973083 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[5].display_name | Algorithm |
| concepts[6].id | https://openalex.org/C124101348 |
| concepts[6].level | 1 |
| concepts[6].score | 0.34404629468917847 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q172491 |
| concepts[6].display_name | Data mining |
| concepts[7].id | https://openalex.org/C154945302 |
| concepts[7].level | 1 |
| concepts[7].score | 0.30909642577171326 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[7].display_name | Artificial intelligence |
| concepts[8].id | https://openalex.org/C33923547 |
| concepts[8].level | 0 |
| concepts[8].score | 0.22181177139282227 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[8].display_name | Mathematics |
| concepts[9].id | https://openalex.org/C105795698 |
| concepts[9].level | 1 |
| concepts[9].score | 0.1412668228149414 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q12483 |
| concepts[9].display_name | Statistics |
| concepts[10].id | https://openalex.org/C121332964 |
| concepts[10].level | 0 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q413 |
| concepts[10].display_name | Physics |
| concepts[11].id | https://openalex.org/C62520636 |
| concepts[11].level | 1 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q944 |
| concepts[11].display_name | Quantum mechanics |
| keywords[0].id | https://openalex.org/keywords/matching |
| keywords[0].score | 0.7619200944900513 |
| keywords[0].display_name | Matching (statistics) |
| keywords[1].id | https://openalex.org/keywords/cluster-analysis |
| keywords[1].score | 0.6689465641975403 |
| keywords[1].display_name | Cluster analysis |
| keywords[2].id | https://openalex.org/keywords/blossom-algorithm |
| keywords[2].score | 0.6342754364013672 |
| keywords[2].display_name | Blossom algorithm |
| keywords[3].id | https://openalex.org/keywords/computer-science |
| keywords[3].score | 0.6062501072883606 |
| keywords[3].display_name | Computer science |
| keywords[4].id | https://openalex.org/keywords/entropy |
| keywords[4].score | 0.5912353992462158 |
| keywords[4].display_name | Entropy (arrow of time) |
| keywords[5].id | https://openalex.org/keywords/algorithm |
| keywords[5].score | 0.5619391798973083 |
| keywords[5].display_name | Algorithm |
| keywords[6].id | https://openalex.org/keywords/data-mining |
| keywords[6].score | 0.34404629468917847 |
| keywords[6].display_name | Data mining |
| keywords[7].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[7].score | 0.30909642577171326 |
| keywords[7].display_name | Artificial intelligence |
| keywords[8].id | https://openalex.org/keywords/mathematics |
| keywords[8].score | 0.22181177139282227 |
| keywords[8].display_name | Mathematics |
| keywords[9].id | https://openalex.org/keywords/statistics |
| keywords[9].score | 0.1412668228149414 |
| keywords[9].display_name | Statistics |
| language | en |
| locations[0].id | doi:10.12694/scpe.v25i4.2859 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S2764391171 |
| locations[0].source.issn | 1895-1767 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 1895-1767 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Scalable Computing Practice and Experience |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].license | |
| locations[0].pdf_url | https://www.scpe.org/index.php/scpe/article/download/2859/1115 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Scalable Computing: Practice and Experience |
| locations[0].landing_page_url | https://doi.org/10.12694/scpe.v25i4.2859 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5100695152 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-4249-709X |
| authorships[0].author.display_name | Cuiping Wang |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I1305126327 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Artificial Intelligence and Big Data, Zibo Vocational Institute, Zibo, 255000, China |
| authorships[0].institutions[0].id | https://openalex.org/I1305126327 |
| authorships[0].institutions[0].ror | https://ror.org/04mzr3655 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I1305126327 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Zibo Vocational Institute |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Cuiping Wang |
| authorships[0].is_corresponding | True |
| authorships[0].raw_affiliation_strings | School of Artificial Intelligence and Big Data, Zibo Vocational Institute, Zibo, 255000, China |
| has_content.pdf | True |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.scpe.org/index.php/scpe/article/download/2859/1115 |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Intelligent Matching Method for College Dormitory Roommates: Chameleon Algorithm Based on Optimized Partitioning |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T14413 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.6549999713897705 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Advanced Technologies in Various Fields |
| related_works | https://openalex.org/W2362975861, https://openalex.org/W2103432623, https://openalex.org/W2290243676, https://openalex.org/W1592682627, https://openalex.org/W2385361142, https://openalex.org/W4295762832, https://openalex.org/W2366714142, https://openalex.org/W2277362400, https://openalex.org/W2023784850, https://openalex.org/W1533413800 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.12694/scpe.v25i4.2859 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S2764391171 |
| best_oa_location.source.issn | 1895-1767 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 1895-1767 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Scalable Computing Practice and Experience |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://www.scpe.org/index.php/scpe/article/download/2859/1115 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Scalable Computing: Practice and Experience |
| best_oa_location.landing_page_url | https://doi.org/10.12694/scpe.v25i4.2859 |
| primary_location.id | doi:10.12694/scpe.v25i4.2859 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S2764391171 |
| primary_location.source.issn | 1895-1767 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 1895-1767 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Scalable Computing Practice and Experience |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.license | |
| primary_location.pdf_url | https://www.scpe.org/index.php/scpe/article/download/2859/1115 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Scalable Computing: Practice and Experience |
| primary_location.landing_page_url | https://doi.org/10.12694/scpe.v25i4.2859 |
| publication_date | 2024-06-16 |
| publication_year | 2024 |
| referenced_works | https://openalex.org/W3091403532, https://openalex.org/W3178678860, https://openalex.org/W3176200319, https://openalex.org/W4226327328, https://openalex.org/W4226292565, https://openalex.org/W4385195573, https://openalex.org/W3080458156, https://openalex.org/W2975022102, https://openalex.org/W3173209060, https://openalex.org/W3154385457, https://openalex.org/W4221079894, https://openalex.org/W3210305489, https://openalex.org/W2997455401, https://openalex.org/W4297784470, https://openalex.org/W2951300823, https://openalex.org/W3161911778 |
| referenced_works_count | 16 |
| abstract_inverted_index.A | 0 |
| abstract_inverted_index.0, | 143, 209 |
| abstract_inverted_index.1, | 153, 217 |
| abstract_inverted_index.In | 93, 113 |
| abstract_inverted_index.It | 256 |
| abstract_inverted_index.RI | 66, 129, 149, 203, 214 |
| abstract_inverted_index.as | 62 |
| abstract_inverted_index.in | 169, 197, 232, 239 |
| abstract_inverted_index.is | 141 |
| abstract_inverted_index.of | 15, 30, 72, 95, 115, 166, 174, 181, 199, 221, 242, 249, 265, 270 |
| abstract_inverted_index.on | 4, 24, 53, 184, 228 |
| abstract_inverted_index.to | 9, 81, 110, 142, 152 |
| abstract_inverted_index.BBC | 55, 186 |
| abstract_inverted_index.The | 131, 178, 205, 224 |
| abstract_inverted_index.and | 27, 35, 46, 65, 68, 88, 98, 128, 148, 154, 202, 213, 252, 267, 274, 279 |
| abstract_inverted_index.are | 151 |
| abstract_inverted_index.can | 77 |
| abstract_inverted_index.for | 43, 261, 281 |
| abstract_inverted_index.has | 235, 257 |
| abstract_inverted_index.new | 276 |
| abstract_inverted_index.the | 11, 36, 50, 54, 70, 73, 101, 136, 138, 144, 146, 155, 157, 164, 167, 170, 185, 211, 219, 233, 247, 263 |
| abstract_inverted_index.was | 7, 41 |
| abstract_inverted_index.Test | 49 |
| abstract_inverted_index.This | 75, 160 |
| abstract_inverted_index.data | 23, 44 |
| abstract_inverted_index.fast | 253 |
| abstract_inverted_index.from | 122 |
| abstract_inverted_index.life | 266 |
| abstract_inverted_index.made | 121 |
| abstract_inverted_index.show | 134 |
| abstract_inverted_index.such | 61 |
| abstract_inverted_index.than | 194 |
| abstract_inverted_index.that | 135 |
| abstract_inverted_index.this | 182 |
| abstract_inverted_index.used | 42 |
| abstract_inverted_index.were | 33, 120 |
| abstract_inverted_index.with | 246 |
| abstract_inverted_index.Using | 19 |
| abstract_inverted_index.based | 3, 227 |
| abstract_inverted_index.ideas | 280 |
| abstract_inverted_index.other | 111, 195 |
| abstract_inverted_index.shown | 236 |
| abstract_inverted_index.shows | 106 |
| abstract_inverted_index.solve | 10 |
| abstract_inverted_index.study | 234 |
| abstract_inverted_index.terms | 94, 114, 198 |
| abstract_inverted_index.their | 82 |
| abstract_inverted_index.three | 123 |
| abstract_inverted_index.time, | 100 |
| abstract_inverted_index.time. | 255 |
| abstract_inverted_index.value | 140, 150, 207 |
| abstract_inverted_index.while | 210 |
| abstract_inverted_index.assign | 79 |
| abstract_inverted_index.better | 156, 191 |
| abstract_inverted_index.closer | 137, 145 |
| abstract_inverted_index.habits | 29 |
| abstract_inverted_index.object | 38, 103 |
| abstract_inverted_index.purity | 147, 212 |
| abstract_inverted_index.result | 161 |
| abstract_inverted_index.value, | 67, 126 |
| abstract_inverted_index.value. | 130 |
| abstract_inverted_index.values | 215 |
| abstract_inverted_index.verify | 69 |
| abstract_inverted_index.98.82%, | 189 |
| abstract_inverted_index.college | 16, 31, 175, 243, 271 |
| abstract_inverted_index.compare | 57 |
| abstract_inverted_index.dataset | 187 |
| abstract_inverted_index.effect. | 159 |
| abstract_inverted_index.entropy | 125, 139, 206 |
| abstract_inverted_index.fields. | 283 |
| abstract_inverted_index.further | 162 |
| abstract_inverted_index.methods | 278 |
| abstract_inverted_index.problem | 14, 173 |
| abstract_inverted_index.purity, | 64, 127, 201 |
| abstract_inverted_index.quality | 59, 117, 193, 264 |
| abstract_inverted_index.reached | 188 |
| abstract_inverted_index.related | 282 |
| abstract_inverted_index.results | 133 |
| abstract_inverted_index.running | 99, 254 |
| abstract_inverted_index.showing | 190 |
| abstract_inverted_index.studied | 8 |
| abstract_inverted_index.values. | 204 |
| abstract_inverted_index.K-center | 37, 102 |
| abstract_inverted_index.accuracy | 97, 180 |
| abstract_inverted_index.analysis | 45 |
| abstract_inverted_index.avoiding | 85 |
| abstract_inverted_index.compared | 109 |
| abstract_inverted_index.dataset, | 56 |
| abstract_inverted_index.entropy, | 63, 200 |
| abstract_inverted_index.learning | 268 |
| abstract_inverted_index.matching | 13, 91, 96, 158, 172, 179, 222, 241, 251 |
| abstract_inverted_index.methods, | 22 |
| abstract_inverted_index.personal | 25 |
| abstract_inverted_index.proposed | 231 |
| abstract_inverted_index.provides | 275 |
| abstract_inverted_index.quality. | 223 |
| abstract_inverted_index.research | 21, 277 |
| abstract_inverted_index.results. | 92 |
| abstract_inverted_index.roommate | 47 |
| abstract_inverted_index.students | 32, 80 |
| abstract_inverted_index.superior | 107 |
| abstract_inverted_index.achieving | 89 |
| abstract_inverted_index.algorithm | 2, 40, 51, 76, 105, 168, 183, 226 |
| abstract_inverted_index.chameleon | 1, 39, 104, 225 |
| abstract_inverted_index.dormitory | 17, 176, 244, 272 |
| abstract_inverted_index.excellent | 90, 237 |
| abstract_inverted_index.important | 258 |
| abstract_inverted_index.improving | 262 |
| abstract_inverted_index.lifestyle | 28 |
| abstract_inverted_index.matching. | 48 |
| abstract_inverted_index.optimized | 5, 229 |
| abstract_inverted_index.practical | 259 |
| abstract_inverted_index.students, | 273 |
| abstract_inverted_index.validates | 163 |
| abstract_inverted_index.verifying | 218 |
| abstract_inverted_index.accurately | 78 |
| abstract_inverted_index.algorithm. | 74 |
| abstract_inverted_index.algorithms | 196 |
| abstract_inverted_index.approached | 208, 216 |
| abstract_inverted_index.clustering | 58, 116, 192 |
| abstract_inverted_index.collected, | 34 |
| abstract_inverted_index.efficiency | 220, 269 |
| abstract_inverted_index.indicators | 60 |
| abstract_inverted_index.respective | 83 |
| abstract_inverted_index.roommates, | 245 |
| abstract_inverted_index.roommates. | 18, 177 |
| abstract_inverted_index.situations | 87 |
| abstract_inverted_index.algorithms. | 112 |
| abstract_inverted_index.comparisons | 119 |
| abstract_inverted_index.dimensions: | 124 |
| abstract_inverted_index.evaluation, | 118 |
| abstract_inverted_index.intelligent | 12, 171, 240 |
| abstract_inverted_index.overlapping | 86 |
| abstract_inverted_index.performance | 52, 108, 238 |
| abstract_inverted_index.preferences | 26 |
| abstract_inverted_index.dormitories, | 84 |
| abstract_inverted_index.experimental | 132 |
| abstract_inverted_index.partitioning | 6, 230 |
| abstract_inverted_index.quantitative | 20 |
| abstract_inverted_index.significance | 260 |
| abstract_inverted_index.effectiveness | 71, 165 |
| abstract_inverted_index.high-precision | 250 |
| abstract_inverted_index.characteristics | 248 |
| cited_by_percentile_year | |
| corresponding_author_ids | https://openalex.org/A5100695152 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 1 |
| corresponding_institution_ids | https://openalex.org/I1305126327 |
| citation_normalized_percentile.value | 0.08630695 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |