{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008634276,0.0006742765,0.0006113399,0.0005108598,0.0004723578,0.001233498,0.0005790545,0.0003348225,0.00005952589],"category_scores_gemma":[0.00008152918,0.0005292099,0.0002358076,0.0001881679,0.000157495,0.002116022,0.001006866,0.0003368689,0.00007979767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001584671,"about_ca_system_score_gemma":0.00005200489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001102695,"about_ca_topic_score_gemma":0.0002366675,"domain_scores_codex":[0.9969558,0.000008167827,0.001234689,0.0005403443,0.0005138125,0.0007471795],"domain_scores_gemma":[0.9979435,0.00003046042,0.0006424154,0.0007212703,0.0006038228,0.00005854885],"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.006155934,0.004198404,0.02955834,0.2951856,0.007606558,0.00001423572,0.03059526,0.06124266,0.0001031172,0.1103766,0.1265013,0.328462],"study_design_scores_gemma":[0.004678369,0.0001237074,0.0004100491,0.001178735,0.0003049371,0.00000369552,0.001497819,0.6711638,0.00001228741,0.00521269,0.3140959,0.001318033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05115004,0.00007986676,0.9174947,0.002509037,0.004024909,0.009518296,0.0006976523,0.0005783837,0.01394713],"genre_scores_gemma":[0.9301388,0.0002108865,0.03840254,0.005472462,0.003287212,0.007062088,0.009408044,0.0004645545,0.00555344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8790922,"threshold_uncertainty_score":0.9998033,"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."}}