{"id":"W2086959852","doi":"10.1007/s10994-009-5103-0","title":"NP-hardness of Euclidean sum-of-squares clustering","year":2009,"lang":"en","type":"article","venue":"Machine Learning","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":863,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Cluster analysis; Mathematics; Euclidean distance; Explained sum of squares; Euclidean geometry; Combinatorics; Pattern recognition (psychology); Artificial intelligence; Computer science; Statistics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01257153537582592,"score_gpt":0.2570000966085654,"score_spread":0.2444285612327395,"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."}}