{"id":"W2884886133","doi":"10.5555/3310435.3310618","title":"Exact algorithms and lower bounds for stable instances of euclidean k-means","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Hamming distance; Euclidean distance; Euclidean geometry; Cluster analysis; Time complexity; Dimension (graph theory); Heuristics; Algorithm; Discrete mathematics; Mathematical optimization","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.00451908,0.002587417,0.00216012,0.001479762,0.001581557,0.004392629,0.004416455,0.002484841,0.01055182],"category_scores_gemma":[0.03118191,0.001005473,0.002640874,0.003041602,0.002173149,0.007998642,0.003633648,0.005873404,0.001768745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003729957,"about_ca_system_score_gemma":0.00282421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003607915,"about_ca_topic_score_gemma":0.005639303,"domain_scores_codex":[0.9954158,0.001262731,0.0002621771,0.001233201,0.001132903,0.000693253],"domain_scores_gemma":[0.9757214,0.01811617,0.001514907,0.002660558,0.001223525,0.0007634172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001144708,0.0005835776,0.004169896,0.001101982,0.000309149,0.0002629238,0.0004822187,0.6897437,0.005307888,0.1863847,0.01384461,0.09666464],"study_design_scores_gemma":[0.00008456141,0.0001095794,0.0003805545,0.00004522604,0.00004901909,0.00009406305,0.00008813884,0.8350272,0.001339604,0.1612061,0.001556005,0.00001997604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1181742,0.004371364,0.8429996,0.005857117,0.0003053597,0.0004740125,0.00191799,0.002421417,0.02347891],"genre_scores_gemma":[0.5459276,0.001666399,0.4390355,0.001006696,0.0004225161,0.0006113613,0.003271491,0.001033297,0.007025133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01055182,"threshold_uncertainty_score":0.0352993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03704816256138506,"score_gpt":0.179647408905519,"score_spread":0.142599246344134,"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."}}