{"id":"W2495677458","doi":"10.4230/lipics.icalp.2016.69","title":"Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bounded function; Linear programming relaxation; Sigma; Outlier; Mathematics; Upper and lower bounds; Relaxation (psychology); Cluster analysis; Algorithm; Discrete mathematics; Linear programming; Physics; Mathematical analysis; 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.007313291,0.004262058,0.004701941,0.002827642,0.002118966,0.004564434,0.006193941,0.004609143,0.004921614],"category_scores_gemma":[0.03234944,0.001738302,0.003450759,0.007019785,0.002678503,0.007748715,0.004742307,0.007776896,0.00194167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006224144,"about_ca_system_score_gemma":0.003901611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01180648,"about_ca_topic_score_gemma":0.01063986,"domain_scores_codex":[0.9922518,0.002781534,0.0004778492,0.001510628,0.001809435,0.001168772],"domain_scores_gemma":[0.9808753,0.01290627,0.001558089,0.00221706,0.00177466,0.000668649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002919131,0.0001693995,0.0008056052,0.0004163246,0.000167911,0.00006898067,0.0002133251,0.9052807,0.0005926255,0.04142688,0.007003006,0.04356336],"study_design_scores_gemma":[0.00003221838,0.00003143407,0.00008882014,0.00003245176,0.00001830502,0.00003366529,0.00004462939,0.9614031,0.0002662487,0.03685238,0.001185986,0.00001080246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008035978,0.002040241,0.9839759,0.001060075,0.0001364448,0.0001135036,0.0002638731,0.0008023508,0.003571546],"genre_scores_gemma":[0.2673347,0.002704504,0.719062,0.001054248,0.0005428895,0.0006893944,0.002227528,0.0008506328,0.005534115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01180648,"threshold_uncertainty_score":0.04515952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03067713943686306,"score_gpt":0.2454111956609366,"score_spread":0.2147340562240735,"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."}}