{"id":"W79208629","doi":"10.14778/2732269.2732275","title":"Computing k-regret minimizing sets","year":2014,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Regret; Dimension (graph theory); Relaxation (psychology); Set (abstract data type); Greedy algorithm; Linear programming relaxation; Dynamic programming; Linear programming; Duality (order theory); Mathematics; Combinatorics; Computer science; Mathematical optimization; Algorithm; Statistics","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.000567185,0.0001295607,0.0001534689,0.00006960965,0.0001416975,0.000187635,0.001803736,0.00002261317,0.000003954442],"category_scores_gemma":[0.00006562323,0.0000892137,0.00007868458,0.000307109,0.00004220296,0.0004623731,0.001452148,0.00008981234,0.0000157704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002579626,"about_ca_system_score_gemma":0.000006999463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001299506,"about_ca_topic_score_gemma":3.717668e-7,"domain_scores_codex":[0.9988177,0.000007320982,0.0002341246,0.0002979005,0.0003757269,0.0002672703],"domain_scores_gemma":[0.999373,0.00003741206,0.0002247172,0.0002386904,0.00007791664,0.00004827343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000790178,0.0001915562,0.006639552,0.0002658318,0.0001016084,7.885699e-7,0.001958468,0.00006957029,0.009921095,0.5897314,0.03025604,0.3608562],"study_design_scores_gemma":[0.002958069,0.0004134999,0.01795143,0.0008355926,0.0001115038,0.00003574712,0.0006513271,0.595217,0.2062933,0.04891862,0.1253619,0.00125195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4537873,0.000346309,0.2265487,0.02493377,0.005233695,0.002512747,0.00001439897,0.001305664,0.2853174],"genre_scores_gemma":[0.937353,0.000006539087,0.06178274,0.0004185359,0.00008893707,0.000006144295,7.664574e-7,0.00000844547,0.0003349082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5951474,"threshold_uncertainty_score":0.3638029,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01108569908115562,"score_gpt":0.2172150349701332,"score_spread":0.2061293358889776,"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."}}