{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002125233,0.001316472,0.002584667,0.003130736,0.001805811,0.002062543,0.00508545,0.002270476,0.00391226],"category_scores_gemma":[0.007451648,0.001144015,0.001632878,0.003159042,0.001011503,0.003522913,0.003751785,0.002453981,0.003497426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00136386,"about_ca_system_score_gemma":0.002091153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00878654,"about_ca_topic_score_gemma":0.01080776,"domain_scores_codex":[0.9975365,0.0004896289,0.0001232486,0.0004897926,0.001218686,0.0001421348],"domain_scores_gemma":[0.9977344,0.0004996515,0.0001279131,0.0004885895,0.001041668,0.0001078239],"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.0003551366,0.0002431226,0.001465305,0.0002781906,0.0002404281,0.0001086009,0.0002428218,0.1121417,0.01017277,0.0201129,0.01393112,0.8407078],"study_design_scores_gemma":[0.00003546243,0.00004371945,0.0005465161,0.00001748637,0.00002727034,0.0001781291,0.00005172677,0.9789385,0.00531612,0.006792321,0.007997538,0.00005526114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002624894,0.0002332514,0.9949233,0.00007512803,0.00007461251,0.0000724016,0.00007931401,0.001407882,0.0005092454],"genre_scores_gemma":[0.04235242,0.0002206182,0.953111,0.0001248295,0.00005980209,0.0002035519,0.0005270432,0.0004007516,0.002999933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00878654,"threshold_uncertainty_score":0.01747078,"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."}}