{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998864,0.0001812055,0.0002623382,0.00009416018,0.0001172049,0.0001327538,0.002343578,0.00007146547,0.00005082191],"category_scores_gemma":[0.001669609,0.0001310057,0.0001061013,0.000828559,0.0002132033,0.0001721267,0.0005221085,0.000283431,0.00007713691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001757362,"about_ca_system_score_gemma":0.00009463113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002439833,"about_ca_topic_score_gemma":0.000002458497,"domain_scores_codex":[0.9980707,0.00002177028,0.0005995682,0.0004866089,0.0005968879,0.0002244324],"domain_scores_gemma":[0.9982841,0.0002065254,0.0005112819,0.0003384804,0.0005454806,0.0001141246],"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.0000901627,0.00009854845,0.0005069331,0.00003559902,0.000007580137,1.971852e-7,0.001905505,0.004025886,0.06377737,0.7786028,0.00008358368,0.1508659],"study_design_scores_gemma":[0.00003078972,0.0002815312,0.001147199,0.0001498418,0.000007970924,0.0000010395,0.000288054,0.7192427,0.2680939,0.01048067,0.0001269443,0.0001493645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4825363,0.00003023862,0.5024101,0.008624053,0.0002434042,0.00034867,0.0000104421,0.0001292964,0.005667469],"genre_scores_gemma":[0.9856229,0.00001693459,0.01412535,0.0001587557,0.00003705106,0.000008026858,6.812677e-7,0.000007330511,0.00002301442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7681221,"threshold_uncertainty_score":0.5342258,"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."}}