{"id":"W2990678853","doi":"10.1007/s10601-020-09312-3","title":"Learning optimal decision trees using constraint programming","year":2020,"lang":"en","type":"article","venue":"Constraints","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"","keywords":"Constraint programming; Computer science; Decision tree; Constraint (computer-aided design); Machine learning; Artificial intelligence; Key (lock); Constraint satisfaction; Incremental decision tree; Greedy algorithm; Constraint learning; Decision tree learning; Mathematical optimization; Constraint logic programming; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000187561,0.0001380136,0.000157305,0.00004537108,0.0002330713,0.00031375,0.000632758,0.00005225169,0.0000537808],"category_scores_gemma":[0.0001872798,0.0001368043,0.00006085817,0.0003640351,0.0002546842,0.0003285641,0.0002768908,0.0002186203,0.00007981969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002192807,"about_ca_system_score_gemma":0.0001237006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005151834,"about_ca_topic_score_gemma":5.431283e-7,"domain_scores_codex":[0.9987657,0.00003137446,0.0002445513,0.0004564979,0.0002071942,0.0002946976],"domain_scores_gemma":[0.9992567,0.0001133062,0.00009242471,0.0002490869,0.00006236525,0.0002260659],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001454488,0.00001894458,0.0002144245,0.000003492257,0.00000977419,0.0000226125,0.0006515994,0.000687392,0.001443879,0.00657087,0.00007216202,0.9903034],"study_design_scores_gemma":[0.000471853,0.000133122,0.0003933969,0.00006549931,0.00001243541,0.0001261649,0.0007961579,0.9814392,0.0008009139,0.0002092097,0.01522913,0.0003229166],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05027902,0.00003159831,0.9478815,0.0005769632,0.00007864257,0.0001463644,0.000008411856,0.0002854133,0.0007121428],"genre_scores_gemma":[0.500522,0.000002220508,0.4992654,0.0001344664,0.00005262921,0.000005973881,0.000004958867,0.000006173139,0.000006175816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9899805,"threshold_uncertainty_score":0.5578716,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04206220394095465,"score_gpt":0.2883871106859103,"score_spread":0.2463249067449557,"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."}}