{"id":"W3040858639","doi":"10.24963/ijcai.2020/662","title":"Learning Optimal Decision Trees using Constraint Programming (Extended Abstract)","year":2020,"lang":"en","type":"article","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"","keywords":"Computer science; Constraint programming; Constraint (computer-aided design); Key (lock); Decision tree; Artificial intelligence; Machine learning; Greedy algorithm; Constraint satisfaction; Limit (mathematics); Incremental decision tree; Mathematical optimization; Decision tree learning; Mathematics; Algorithm; Stochastic programming","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.00232735,0.001215742,0.001606727,0.001015872,0.0006085163,0.002088575,0.001292439,0.001104963,0.0102576],"category_scores_gemma":[0.01185572,0.0006952679,0.001456906,0.003976366,0.001030274,0.002165334,0.001461073,0.00274483,0.001465849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001266732,"about_ca_system_score_gemma":0.002083459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007627072,"about_ca_topic_score_gemma":0.007467648,"domain_scores_codex":[0.9979139,0.0009201926,0.0001172268,0.0004323945,0.0004320509,0.0001842804],"domain_scores_gemma":[0.9926504,0.005932569,0.0003361761,0.0003379679,0.0005895171,0.0001533489],"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.0001188209,0.0001812416,0.0007740849,0.0003331421,0.00009526085,0.0001882325,0.00007163671,0.7467562,0.0007495915,0.0884456,0.01294656,0.1493396],"study_design_scores_gemma":[0.00001750091,0.00001749318,0.00007449822,0.00002521318,0.000008368566,0.00002573367,0.00001046593,0.9396485,0.0003892829,0.0581423,0.00163268,0.000007912946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00440042,0.0003855047,0.9914665,0.0003720863,0.00005693729,0.00007267952,0.0003649307,0.0002049935,0.002675854],"genre_scores_gemma":[0.1390348,0.001019427,0.8525823,0.000373668,0.0001880898,0.0005597365,0.001718484,0.0002734947,0.00425005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0102576,"threshold_uncertainty_score":0.03431511,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04065732384596839,"score_gpt":0.2948347846810381,"score_spread":0.2541774608350698,"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."}}