{"id":"W2998503844","doi":"10.1609/aaai.v34i04.5717","title":"Efficient Inference of Optimal Decision Trees","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Heuristics; Inference; Computer science; Decision tree; Incremental decision tree; Tree (set theory); Path (computing); K-ary tree; Class (philosophy); Machine learning; Alternating decision tree; Artificial intelligence; Search tree; Node (physics); Algorithm; Mathematics; Decision tree learning; Mathematical optimization; Tree structure; Search algorithm; Combinatorics; Binary tree","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.002958121,0.00107312,0.001626863,0.002000731,0.0009720386,0.001938466,0.002502658,0.001566142,0.003802942],"category_scores_gemma":[0.03054431,0.001059993,0.002063166,0.001750637,0.001051317,0.003960944,0.002098051,0.002746026,0.0007807754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001913628,"about_ca_system_score_gemma":0.003296074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004923295,"about_ca_topic_score_gemma":0.01068404,"domain_scores_codex":[0.9970356,0.001101676,0.0002182193,0.0006869343,0.0006531056,0.0003044113],"domain_scores_gemma":[0.9795986,0.01763911,0.0005226638,0.000992231,0.0009868019,0.0002605269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000853366,0.0003588003,0.009580669,0.0009546689,0.0002234519,0.0006172317,0.0005495291,0.4096642,0.00706387,0.06091569,0.01239937,0.4968192],"study_design_scores_gemma":[0.00006631041,0.00004322215,0.0004764873,0.00004575298,0.00004871039,0.00007036701,0.00008082434,0.9141985,0.002044995,0.08158492,0.001326266,0.00001361268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04975244,0.0007043776,0.942158,0.001020059,0.00005711463,0.0002249709,0.001355393,0.002508926,0.002218702],"genre_scores_gemma":[0.3157326,0.0003818115,0.6769563,0.0004199744,0.00007842942,0.0003000908,0.004812324,0.0003137865,0.001004704],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004923295,"threshold_uncertainty_score":0.01564419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08163294719885679,"score_gpt":0.3170655124341935,"score_spread":0.2354325652353367,"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."}}