{"id":"W2600806505","doi":"","title":"Evaluating a Branch-and-Bound RLT-Based Algorithm for Minimum Sum-of-Squares Clustering","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Convex hull; Combinatorics; Cluster analysis; Centroid; Triangle inequality; Least-squares function approximation; Set (abstract data type); Data point; Algorithm; Regular polygon; Statistics; Computer science; Geometry","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.0006654379,0.0002562115,0.0003450871,0.0003456478,0.0003879427,0.0001270493,0.000546659,0.0001851029,0.000008114986],"category_scores_gemma":[0.0001625182,0.0002542632,0.0001606875,0.0003623958,0.0001015206,0.0005006836,0.0002290181,0.0001792448,0.00000400419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009296049,"about_ca_system_score_gemma":0.0002412693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001271719,"about_ca_topic_score_gemma":0.0002281356,"domain_scores_codex":[0.998004,0.0001106305,0.0004807031,0.0004970224,0.0003856719,0.0005219299],"domain_scores_gemma":[0.9984065,0.0003584525,0.0002526509,0.0005903241,0.0002023491,0.0001897328],"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.00008905751,0.0002402726,0.002378149,0.0001552546,0.00004105566,0.00002520063,0.0008821131,0.001978203,0.06414255,0.001005586,0.001337494,0.9277251],"study_design_scores_gemma":[0.0009538708,0.0003256109,0.00247538,0.0001325203,0.00001441999,0.00006615694,0.00003115646,0.9229848,0.07095204,0.001497093,0.0002801234,0.0002867925],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1390903,0.0007763663,0.8579513,0.0009720234,0.0001306397,0.0006591328,0.00002802242,0.00034275,0.00004940767],"genre_scores_gemma":[0.3617175,0.00006465881,0.636744,0.0008258682,0.00006343777,0.0004338113,0.00001401988,0.00002729245,0.0001094128],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9274383,"threshold_uncertainty_score":0.9999909,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03339265974949093,"score_gpt":0.2845295203447807,"score_spread":0.2511368605952897,"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."}}