{"id":"W4283802782","doi":"10.1609/aaai.v36i9.21194","title":"Fast Sparse Decision Tree Optimization via Reference Ensembles","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"National Institute on Drug Abuse; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy; National Science Foundation","keywords":"Computer science; Decision tree; Tree (set theory); Machine learning; Black box; Incremental decision tree; Artificial intelligence; Optimization problem; Decision tree learning; Mathematical optimization; Algorithm; Mathematics","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.002728395,0.001277147,0.0024591,0.0009699002,0.0009144602,0.001942087,0.002250344,0.002138229,0.00674798],"category_scores_gemma":[0.01485922,0.0008713798,0.001406905,0.001411852,0.000972349,0.003402426,0.002987882,0.004032484,0.003575759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001183293,"about_ca_system_score_gemma":0.001697238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004068768,"about_ca_topic_score_gemma":0.007012655,"domain_scores_codex":[0.9979068,0.0008196919,0.00008701224,0.0004088433,0.0005715156,0.0002062141],"domain_scores_gemma":[0.9939122,0.003862198,0.0002586606,0.0008953641,0.0008069193,0.0002646797],"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.000209168,0.0001138996,0.0009866053,0.0001449003,0.00009101529,0.0001023598,0.0001345189,0.7251918,0.001859427,0.04538736,0.01918288,0.2065961],"study_design_scores_gemma":[0.00001299802,0.00001707678,0.00005341798,0.0000136638,0.000006213829,0.00001389092,0.000007876673,0.9737445,0.0003412399,0.02476182,0.001021409,0.00000595492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01117889,0.0007234213,0.9824537,0.0005643354,0.0001151482,0.00004736394,0.0001989443,0.00172206,0.002996024],"genre_scores_gemma":[0.4128446,0.000859585,0.5728598,0.0009867232,0.0003886849,0.0003360667,0.002679037,0.001093696,0.007951848],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00674798,"threshold_uncertainty_score":0.02257431,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07408020904507641,"score_gpt":0.2941409187407192,"score_spread":0.2200607096956428,"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."}}