{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006386556,0.0004859373,0.0004385605,0.0006634208,0.0002466392,0.0009927596,0.002542776,0.0001798408,0.00001565815],"category_scores_gemma":[0.00002845256,0.0004550478,0.00009990099,0.000295788,0.000260932,0.0005189678,0.002517433,0.000365403,0.00001436469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000155158,"about_ca_system_score_gemma":0.000259454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005094153,"about_ca_topic_score_gemma":0.000109887,"domain_scores_codex":[0.9966031,0.00001153746,0.000416465,0.001582484,0.0007084379,0.0006779604],"domain_scores_gemma":[0.9982614,0.0002272809,0.0001992292,0.0009815919,0.00009719721,0.0002333241],"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.000001949231,0.00001022051,0.0000010369,0.00001955277,0.000007551521,0.00001738566,0.0001810988,0.009804449,0.000007813091,0.002515119,0.00006211079,0.9873717],"study_design_scores_gemma":[0.0004835192,0.0001435877,0.00002058597,0.000166048,0.00001006883,0.00002930067,8.951086e-8,0.9722916,0.0001399361,0.01282417,0.01335852,0.0005325092],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000002211133,0.0004083125,0.9951372,0.000808775,0.001930863,0.0006645876,0.00002257543,0.0001466457,0.0008788111],"genre_scores_gemma":[0.0005931628,0.00004153615,0.9959029,0.0008023038,0.001420941,0.00001090848,0.00001294262,0.00003029198,0.001184991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9868392,"threshold_uncertainty_score":0.9997901,"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."}}