{"id":"W2596694088","doi":"","title":"A Branch-and-Cut SDP-Based Algorithm for Minimum Sum-of-Squares Clustering","year":2008,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Explained sum of squares; Cluster analysis; Maximum cut; Semidefinite programming; Algorithm; Combinatorics; Centroid; Branch and cut; Set (abstract data type); Equivalence (formal languages); Discrete mathematics; Mathematical optimization; Linear programming; Computer science; Statistics; Graph","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.0001848463,0.0003384161,0.0004315314,0.0003263264,0.000319542,0.00005527352,0.000289446,0.0002983365,0.000005683574],"category_scores_gemma":[0.00009616687,0.0003494622,0.0001816774,0.0002771354,0.00003246888,0.0002033093,0.00008165156,0.000260732,0.00000130644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001544798,"about_ca_system_score_gemma":0.0001402027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000121926,"about_ca_topic_score_gemma":0.00003605095,"domain_scores_codex":[0.9982398,0.00007195399,0.0004976645,0.0003918734,0.0003350804,0.0004636375],"domain_scores_gemma":[0.9987877,0.0002330498,0.0001380152,0.0003788591,0.000253312,0.0002090913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001253259,0.002121818,0.00194545,0.002135132,0.001813654,0.0009714023,0.009524506,0.01673584,0.2417579,0.407918,0.01593811,0.2978849],"study_design_scores_gemma":[0.002043522,0.000190477,0.001772167,0.0003976607,0.00009724963,0.001132174,0.0001145096,0.2640006,0.08630821,0.0004768831,0.6425768,0.0008898093],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1759655,0.002052032,0.7976065,0.001943017,0.001250564,0.001225001,0.0001401463,0.002174157,0.01764311],"genre_scores_gemma":[0.9534519,0.0001612446,0.04574061,0.00007078749,0.0002751898,0.0001456759,0.00005483939,0.00006413464,0.00003563364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7774864,"threshold_uncertainty_score":0.9998958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02480595118024036,"score_gpt":0.23880099968106,"score_spread":0.2139950485008196,"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."}}