{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868029,0.00128991,0.001828659,0.001003627,0.0009627755,0.001139848,0.001658787,0.002277575,0.00359007],"category_scores_gemma":[0.004799456,0.0007501277,0.0007842279,0.001614594,0.001075129,0.001499344,0.00188754,0.002670632,0.001082361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009354598,"about_ca_system_score_gemma":0.001894278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002676927,"about_ca_topic_score_gemma":0.003637638,"domain_scores_codex":[0.9988569,0.0004646841,0.00005515106,0.0002192951,0.0003241952,0.00007979042],"domain_scores_gemma":[0.9981363,0.001153955,0.0001240339,0.0001208239,0.0003866527,0.00007821582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001629848,0.0001296683,0.0004335227,0.000157431,0.00006536243,0.00009258105,0.0001497877,0.7302438,0.002781233,0.0395352,0.008207798,0.2180406],"study_design_scores_gemma":[0.00001795315,0.00002842274,0.00003687526,0.000005753288,0.000003664861,0.00002553643,0.000009530781,0.9875373,0.0005015063,0.01096139,0.0008659873,0.000006027164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002107284,0.00008089842,0.9966348,0.000138123,0.00002042956,0.00004506606,0.00004246063,0.0001524843,0.000778551],"genre_scores_gemma":[0.0635167,0.0001313613,0.9336723,0.0001324799,0.00004272873,0.0002745641,0.000309823,0.0001056704,0.001814318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00359007,"threshold_uncertainty_score":0.01200998,"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."}}