{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000797035,0.0001633955,0.000217976,0.00009909434,0.00005992325,0.0000304543,0.0001156781,0.00007641217,0.00002619936],"category_scores_gemma":[0.00001394515,0.000162849,0.00008316247,0.00007049956,0.00003602668,0.00008724776,0.00001868722,0.00008928576,0.000002690045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002182009,"about_ca_system_score_gemma":0.00001911683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007243892,"about_ca_topic_score_gemma":0.000005689808,"domain_scores_codex":[0.999242,0.00001221812,0.0002153456,0.0001754317,0.0001364924,0.0002185057],"domain_scores_gemma":[0.9995909,0.00009092382,0.00002690343,0.0001572893,0.00007427725,0.00005971687],"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.0001002231,0.000130743,0.0001140629,0.0001078097,0.00008327524,0.00001430152,0.0004291686,0.0162263,0.0962624,0.001015208,0.004872157,0.8806443],"study_design_scores_gemma":[0.0006339229,0.0001835685,0.0009064618,0.0001494326,0.00002246265,0.00001827477,0.00001718842,0.8989787,0.09069297,0.0008201906,0.007281941,0.0002948413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.24382,0.001615157,0.7512418,0.0004702144,0.0003757554,0.0005068758,0.00008959183,0.0007154517,0.001165162],"genre_scores_gemma":[0.9295856,0.00002716659,0.06988689,0.0002287028,0.0001708297,0.00002040127,0.00002538657,0.0000238823,0.00003111532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8827524,"threshold_uncertainty_score":0.6640788,"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."}}