{"id":"W2100485099","doi":"10.1007/s10898-010-9571-3","title":"Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering","year":2010,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Convex hull; Combinatorics; Centroid; Cluster analysis; Least-squares function approximation; Triangle inequality; Set (abstract data type); Explained sum of squares; Data point; Algorithm; Regular polygon; Statistics; Geometry; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0005128926,0.00008223308,0.0001593882,0.00006370153,0.00008414069,0.0001141202,0.0002090668,0.00007035468,0.000009504819],"category_scores_gemma":[0.0001632118,0.00007089291,0.00007684431,0.0001709083,0.00002575904,0.0005262004,0.00004201829,0.0000871774,5.405203e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002573515,"about_ca_system_score_gemma":0.0001178861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006580335,"about_ca_topic_score_gemma":0.000006328875,"domain_scores_codex":[0.9990734,0.00004000428,0.0003821788,0.0001164323,0.0002680147,0.0001199277],"domain_scores_gemma":[0.998783,0.0001038565,0.0004501221,0.000106385,0.0004873357,0.00006930964],"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.00008779019,0.0001068174,0.0004503176,0.00005914167,0.00002843912,0.000002876654,0.0001456967,0.2850116,0.01072164,0.0001910136,0.0003426605,0.702852],"study_design_scores_gemma":[0.001062948,0.0003008075,0.0002687588,0.0001012132,0.00001944791,0.00003379973,0.00001730549,0.9948809,0.002567136,0.0006088261,0.00006203132,0.00007685606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05785542,0.00008500455,0.9408269,0.0003944313,0.0006530585,0.0001181826,0.000007332971,0.00001237472,0.0000473163],"genre_scores_gemma":[0.1818557,0.00001120915,0.8179165,0.0001059457,0.00009647794,0.000002869546,0.000002824164,0.000004225236,0.000004245211],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7098693,"threshold_uncertainty_score":0.2890929,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02564626339742952,"score_gpt":0.3237365574687904,"score_spread":0.2980902940713608,"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."}}