{"id":"W1481798977","doi":"10.1007/11424857_20","title":"A New and Efficient K-Medoid Algorithm for Spatial Clustering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Medoid; k-medoids; Cluster analysis; Computer science; Algorithm; Canopy clustering algorithm; Computation; CURE data clustering algorithm; Correlation clustering; Data mining; Artificial intelligence","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.001920137,0.001650956,0.003064554,0.002587553,0.001735039,0.002011591,0.004684165,0.002775328,0.00528899],"category_scores_gemma":[0.006762179,0.001336345,0.002381449,0.005143824,0.001032352,0.003214034,0.003909842,0.0024393,0.005495312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001041285,"about_ca_system_score_gemma":0.00223774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008633177,"about_ca_topic_score_gemma":0.01036836,"domain_scores_codex":[0.9970468,0.0006355075,0.0002352797,0.0005800815,0.001359475,0.0001428052],"domain_scores_gemma":[0.9974037,0.0008493888,0.0001253673,0.0005224139,0.0009854286,0.0001137669],"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.0003617152,0.0001203137,0.0005265024,0.0003097944,0.0002202379,0.0001079549,0.0002855497,0.1565135,0.01143274,0.01176669,0.01467778,0.8036772],"study_design_scores_gemma":[0.00005001214,0.00005980135,0.0002564252,0.00003075111,0.0000470722,0.0003196551,0.0001004829,0.9616148,0.006183655,0.01694492,0.01431962,0.0000727064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007808413,0.000186136,0.9980226,0.00003822625,0.00006578375,0.00003458463,0.0000604689,0.0004897857,0.0003216928],"genre_scores_gemma":[0.009586876,0.0001935196,0.9882962,0.00005315293,0.00004346042,0.000106389,0.0003026961,0.0001585555,0.001259068],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008633177,"threshold_uncertainty_score":0.0176934,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01332726406476602,"score_gpt":0.2370497392728519,"score_spread":0.2237224752080859,"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."}}