{"id":"W2952461389","doi":"10.1016/j.ins.2018.01.013","title":"RECOME: A new density-based clustering algorithm using relative KNN kernel density","year":2018,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Beijing Municipal Natural Science Foundation; National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Pattern recognition (psychology); Jump; Single-linkage clustering; Merge (version control); Nearest-neighbor chain algorithm; Kernel density estimation; Algorithm; Graph; Kernel (algebra); Discontinuity (linguistics); k-nearest neighbors algorithm; Data mining; Artificial intelligence; Mathematics; Correlation clustering; CURE data clustering algorithm; Canopy clustering algorithm; Theoretical computer science; Combinatorics; Statistics; Physics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001216548,0.0001749955,0.000178913,0.0004645857,0.0009404984,0.0008019665,0.001229044,0.00007858034,0.00002067436],"category_scores_gemma":[0.0003053697,0.0001596744,0.00005702528,0.001777117,0.000476779,0.008486692,0.0006549364,0.0002058577,0.0003189331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002176973,"about_ca_system_score_gemma":0.0006214693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003748323,"about_ca_topic_score_gemma":0.00004577764,"domain_scores_codex":[0.9976272,0.00008413636,0.00043199,0.0003431853,0.000985797,0.0005277165],"domain_scores_gemma":[0.9984131,0.0001753821,0.0002621241,0.0004462803,0.0004834885,0.0002195691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001928607,0.00002585894,0.0006004699,0.00002681724,0.00001807004,0.000009958166,0.007014753,0.01670499,0.0004829939,0.003542519,0.0003518059,0.9712025],"study_design_scores_gemma":[0.0003044291,0.0001366624,0.0009605016,0.00004430742,0.000002156897,0.00004707626,0.0001431749,0.9905484,0.002971367,0.003377693,0.001251042,0.0002131832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01135174,0.000007526458,0.9850947,0.0006202098,0.0006271563,0.0002014382,0.000002010236,0.0002250314,0.001870222],"genre_scores_gemma":[0.126109,0.000002182972,0.8729237,0.0006773551,0.000147021,0.000003986434,0.000001823465,0.000005023437,0.0001298881],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9738434,"threshold_uncertainty_score":0.7733381,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06083948764184269,"score_gpt":0.3449632069298229,"score_spread":0.2841237192879802,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}