{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003975658,0.001736229,0.003138189,0.001918122,0.001086796,0.003267732,0.00266885,0.002075308,0.00419075],"category_scores_gemma":[0.02119312,0.001170676,0.001747237,0.0028301,0.001733247,0.003716355,0.00224447,0.002535502,0.001029224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002865898,"about_ca_system_score_gemma":0.001920762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002321555,"about_ca_topic_score_gemma":0.002960521,"domain_scores_codex":[0.996435,0.00140259,0.0002197453,0.0008505887,0.0006826647,0.00040939],"domain_scores_gemma":[0.9889873,0.007886954,0.0008022841,0.001241483,0.0006963024,0.0003856405],"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.0005436638,0.0002780778,0.002250904,0.0003601787,0.0001981243,0.0001278747,0.000323603,0.8541072,0.002071622,0.03922173,0.01169414,0.08882293],"study_design_scores_gemma":[0.00003762368,0.00008349551,0.0003285104,0.00002984834,0.00002281317,0.00004637667,0.00007783878,0.9395823,0.001427329,0.05702335,0.001321255,0.00001924856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1113688,0.00107367,0.8751655,0.001621691,0.0001083891,0.000306862,0.001657041,0.002060795,0.006637328],"genre_scores_gemma":[0.4537354,0.0005180885,0.53486,0.0007757673,0.0002216871,0.0006087493,0.004102672,0.0007210879,0.004456599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00419075,"threshold_uncertainty_score":0.02102554,"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."}}