{"id":"W3098804530","doi":"","title":"Decision trees as partitioning machines to characterize their generalization properties","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Moncton; Université Laval","funders":"","keywords":"Generalization; Dimension (graph theory); Pruning; Decision tree; Bounded function; Mathematics; Binary decision diagram; Function (biology); VC dimension; Combinatorics; Binary tree; Integer (computer science); Upper and lower bounds; Discrete mathematics; Tree (set theory); Binary number; Weight-balanced tree; Simple (philosophy); Algorithm; Computer science; Binary search tree; Artificial intelligence; Arithmetic","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002168942,0.0001549773,0.0001562062,0.0001221157,0.0003418516,0.001719135,0.0004573071,0.0000515679,0.000005303863],"category_scores_gemma":[0.0002729084,0.0001157749,0.00002963911,0.0005381326,0.00001289098,0.005172016,0.0001076339,0.0001098916,0.0002156609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002852196,"about_ca_system_score_gemma":0.00005321189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006754309,"about_ca_topic_score_gemma":0.000002588532,"domain_scores_codex":[0.9986851,0.00007846302,0.0005126633,0.000214351,0.0003323088,0.000177135],"domain_scores_gemma":[0.9990922,0.00002030227,0.0002964211,0.0002282621,0.0002230456,0.0001398042],"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.00006743578,0.00002247416,0.001728473,0.0004005588,0.00000880928,0.000001079844,0.01793779,0.05897681,0.01579873,0.005692473,0.001986627,0.8973787],"study_design_scores_gemma":[0.0001480595,0.00007451476,0.00374906,0.0001186849,0.000002303424,0.0000166378,0.0001524431,0.9587111,0.0007084713,0.00002394827,0.03613315,0.0001615714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1541955,0.0001440507,0.8365442,0.007012147,0.0004435439,0.0003702299,0.000008678548,0.0006844203,0.0005972573],"genre_scores_gemma":[0.9945403,0.000006149566,0.002193991,0.002829853,0.0001702021,0.00006544662,0.0001312987,0.000008082849,0.00005466713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8997344,"threshold_uncertainty_score":0.9993172,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04510490845180466,"score_gpt":0.2560082625256425,"score_spread":0.2109033540738378,"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."}}