{"id":"W2047745978","doi":"10.1145/1514894.1514901","title":"On approximating optimum repairs for functional dependency violations","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":209,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Functional dependency; Tuple; Computer science; Set (abstract data type); Dependency theory (database theory); Constant (computer programming); Approximation algorithm; Dependency (UML); Algorithm; Database; Mathematics; Relational database; Discrete mathematics; Artificial intelligence","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.004359492,0.001667663,0.002500806,0.001796766,0.001028741,0.001671287,0.003034008,0.00194418,0.002683039],"category_scores_gemma":[0.03456107,0.001033947,0.00135045,0.003234187,0.001518143,0.004268224,0.002066548,0.002617009,0.0006026346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002060506,"about_ca_system_score_gemma":0.002308066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0068517,"about_ca_topic_score_gemma":0.006331456,"domain_scores_codex":[0.9969631,0.0009059246,0.0002173335,0.0006002442,0.0008918949,0.0004214662],"domain_scores_gemma":[0.9801451,0.01450943,0.001548411,0.002014122,0.001461735,0.0003212365],"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.0003406127,0.0001074438,0.002141537,0.0002199455,0.00006216054,0.0001062401,0.0002133593,0.9087408,0.001844162,0.009920135,0.002467145,0.0738364],"study_design_scores_gemma":[0.00002668316,0.00007940757,0.0002996688,0.00002174286,0.00002036988,0.0001168903,0.0000794806,0.9768847,0.001311815,0.02041105,0.0007372614,0.00001105197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0726124,0.001078323,0.923003,0.0005990876,0.00006411428,0.0001040378,0.0003611397,0.0008497118,0.001328274],"genre_scores_gemma":[0.4056799,0.0006584455,0.5898186,0.0002403573,0.00006874717,0.0001975353,0.001314371,0.0003616832,0.001660458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0068517,"threshold_uncertainty_score":0.02305549,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2489855454233683,"score_gpt":0.4310638159039699,"score_spread":0.1820782704806016,"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."}}