{"id":"W2026798797","doi":"10.1007/s10994-005-0464-5","title":"Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning","year":2005,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Learnability; Constraint (computer-aided design); Heuristic; Class (philosophy); Mathematics; Discrete mathematics; Boolean function; Combinatorics; Artificial intelligence; Computer science; Mathematical optimization","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.03817863,0.002141899,0.004571722,0.002672097,0.001798453,0.004081459,0.004869496,0.00532122,0.006695971],"category_scores_gemma":[0.1450115,0.00140516,0.001419317,0.004216359,0.007187663,0.008157399,0.005432601,0.004651066,0.001530191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003200873,"about_ca_system_score_gemma":0.003367384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001535694,"about_ca_topic_score_gemma":0.001173069,"domain_scores_codex":[0.9723759,0.01988965,0.0009172008,0.00192878,0.00406115,0.0008273544],"domain_scores_gemma":[0.8234519,0.155407,0.004288143,0.008716915,0.00665539,0.00148057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001958923,0.0001103967,0.0007270714,0.0002435716,0.00007905539,0.00008743585,0.0002971594,0.3001067,0.0002810867,0.6309769,0.004559494,0.06233516],"study_design_scores_gemma":[0.00003093118,0.00004232074,0.00008771713,0.00004949934,0.00001436552,0.00003951158,0.00003133837,0.4333454,0.000369781,0.5648978,0.001071403,0.0000199206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005884055,0.0003436737,0.9890752,0.0006092716,0.00006753189,0.00005265898,0.00004833975,0.0001568807,0.003762446],"genre_scores_gemma":[0.3824368,0.001052064,0.6034563,0.0004185159,0.0004189487,0.0006713562,0.000291369,0.0006477209,0.01060692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03817863,"threshold_uncertainty_score":0.2019104,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01560519044351934,"score_gpt":0.2579894207762006,"score_spread":0.2423842303326813,"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."}}