{"id":"W2131929195","doi":"10.1590/s0101-74382009000300002","title":"A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering","year":2009,"lang":"en","type":"article","venue":"Pesquisa Operacional","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal","funders":"HEC Montréal; Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Explained sum of squares; Cluster analysis; Mathematics; Semidefinite programming; Centroid; Algorithm; Equivalence (formal languages); Set (abstract data type); Branch and cut; Combinatorics; Mathematical optimization; Computer science; Linear programming; Discrete mathematics; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.001718345,0.001309938,0.001845008,0.0009862337,0.0009383154,0.001022181,0.001692406,0.002144467,0.003558561],"category_scores_gemma":[0.004273574,0.0007181232,0.0007507599,0.001576631,0.001096403,0.001410971,0.001822823,0.002512613,0.001030286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008866924,"about_ca_system_score_gemma":0.00178471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002329697,"about_ca_topic_score_gemma":0.003189425,"domain_scores_codex":[0.9990014,0.0004010853,0.000050398,0.0001896104,0.0002876779,0.00006980247],"domain_scores_gemma":[0.9983206,0.00104579,0.0001139652,0.0001106505,0.0003389135,0.00006989361],"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.0001499976,0.0001243734,0.0003703602,0.0001459432,0.00005940268,0.0000863363,0.0001309952,0.742455,0.002694469,0.03586938,0.007338068,0.2105756],"study_design_scores_gemma":[0.00001605115,0.00002742666,0.00003208253,0.000005005972,0.000003197616,0.00002264859,0.000008299928,0.9883222,0.0004682374,0.01034772,0.0007414299,0.000005695922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001951596,0.00007311481,0.9968901,0.0001129523,0.00001719974,0.00004103877,0.00003654581,0.0001533142,0.0007241246],"genre_scores_gemma":[0.06375778,0.0001191292,0.9337406,0.0001220626,0.00003892639,0.0002698777,0.0002825811,0.000104058,0.00156495],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003558561,"threshold_uncertainty_score":0.01190454,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01601602757821673,"score_gpt":0.2562669848879408,"score_spread":0.2402509573097241,"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."}}