{"id":"W2608342387","doi":"10.1090/crmp/045/02","title":"0-1 semidefinite programming for graph-cut clustering: Modelling and approximation","year":2008,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Semidefinite programming; Cluster analysis; Semidefinite embedding; Computer science; Mathematical optimization; Combinatorics; Mathematics; Artificial intelligence; Quadratically constrained quadratic program","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.002042223,0.001262017,0.0008914533,0.0005322445,0.0003749295,0.001462847,0.001533494,0.001562485,0.00259277],"category_scores_gemma":[0.004826027,0.000558486,0.0007935279,0.001302371,0.001484158,0.001885744,0.001320092,0.003331917,0.0007359472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275967,"about_ca_system_score_gemma":0.001024791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002084882,"about_ca_topic_score_gemma":0.002435921,"domain_scores_codex":[0.9990878,0.0004628539,0.00003044977,0.0001416458,0.000218569,0.00005864836],"domain_scores_gemma":[0.9976414,0.001756493,0.0001672147,0.0001404325,0.0002330399,0.00006130501],"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.00003221405,0.00006018502,0.000229778,0.0001622922,0.00002254787,0.00006543093,0.0001030682,0.6859373,0.001145185,0.27669,0.004635418,0.03091654],"study_design_scores_gemma":[0.000002664717,0.000008820288,0.00001990932,0.000006979425,0.000001591099,0.00001451642,0.00001110496,0.9377074,0.0001863413,0.06131428,0.0007225252,0.000004016475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001962859,0.0001368605,0.9958034,0.0002040751,0.00001685589,0.00001500897,0.00003517146,0.00005656615,0.001769178],"genre_scores_gemma":[0.2105974,0.0012166,0.777437,0.0003889287,0.0001391135,0.0003391206,0.0005058485,0.0002378421,0.009138139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00259277,"threshold_uncertainty_score":0.01080042,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03124053358594353,"score_gpt":0.2179380810176818,"score_spread":0.1866975474317382,"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."}}