{"id":"W3211395167","doi":"10.1109/access.2021.3126854","title":"KNN-SC: Novel Spectral Clustering Algorithm Using k-Nearest Neighbors","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Institute for Information and Communications Technology Promotion; National Research Foundation of Korea","keywords":"Cluster analysis; Spectral clustering; CURE data clustering algorithm; Computer science; Correlation clustering; k-nearest neighbors algorithm; Pattern recognition (psychology); Nearest-neighbor chain algorithm; Canopy clustering algorithm; Graph; Algorithm; Noise (video); Artificial intelligence; Data mining; Theoretical computer science","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.001215443,0.001294107,0.001670026,0.003941369,0.001914615,0.001171408,0.002988964,0.001743655,0.001748903],"category_scores_gemma":[0.004392835,0.0005532122,0.001091389,0.005163876,0.001224215,0.002656909,0.001912538,0.001276876,0.001912057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001111571,"about_ca_system_score_gemma":0.002185952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01214292,"about_ca_topic_score_gemma":0.01413204,"domain_scores_codex":[0.9978141,0.0004158514,0.0001112429,0.0005606893,0.000963101,0.0001350469],"domain_scores_gemma":[0.9983321,0.0003625948,0.0001906641,0.0003123829,0.000714374,0.00008791011],"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.0003403889,0.0002443297,0.002664262,0.0003111208,0.0002222656,0.0001873057,0.000440023,0.2819865,0.01099343,0.01703588,0.02199067,0.6635839],"study_design_scores_gemma":[0.00002525939,0.00003589631,0.0003351996,0.0000140247,0.00001484274,0.0001609989,0.00007794847,0.9798642,0.003414117,0.0113367,0.004684584,0.00003620974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007027723,0.0003531765,0.989153,0.0001255553,0.00007471588,0.00007081639,0.0001380135,0.001724441,0.001332561],"genre_scores_gemma":[0.1329739,0.0003396122,0.8616398,0.000231992,0.00008288252,0.000212533,0.001198491,0.0003991268,0.002921611],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01214292,"threshold_uncertainty_score":0.02414447,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08371092394036551,"score_gpt":0.3714442137006123,"score_spread":0.2877332897602468,"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."}}