{"id":"W2113635748","doi":"","title":"Quickly Boosting Decision Trees - Pruning Underachieving Features Early","year":2013,"lang":"en","type":"article","venue":"CaltechAUTHORS (California Institute of Technology)","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Office of Naval Research; Multidisciplinary University Research Initiative; Gordon and Betty Moore Foundation; National Aeronautics and Space Administration","keywords":"Boosting (machine learning); Computer science; Exploit; Machine learning; Artificial intelligence; Decision tree; Gradient boosting; Pruning; Classifier (UML); Training set; Random forest","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005125841,0.0002983264,0.0003863828,0.0009209096,0.0004296978,0.0002101044,0.001841768,0.0004273509,0.00001761647],"category_scores_gemma":[0.001395498,0.0002638687,0.0001062267,0.001457202,0.0003111408,0.001048767,0.0007373262,0.0008046816,0.0002437897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007734878,"about_ca_system_score_gemma":0.00009722253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002740723,"about_ca_topic_score_gemma":0.0000366694,"domain_scores_codex":[0.9977245,0.00004602092,0.0006287515,0.0007053578,0.0003927191,0.0005026453],"domain_scores_gemma":[0.9978309,0.0001055659,0.0004295918,0.001286582,0.000206982,0.0001404017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000940289,0.00008245546,0.01098438,0.00005029484,0.00002965572,0.00001227268,0.0001321118,0.0005346632,0.01701686,0.1853688,0.001058394,0.7847208],"study_design_scores_gemma":[0.003059146,0.001349158,0.2026611,0.00262132,0.0001367157,0.0004728349,0.0006558906,0.2345501,0.0507776,0.2383214,0.2620247,0.003370041],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3241836,0.0003724204,0.6675875,0.004680851,0.0004551506,0.0003671128,0.00001088568,0.00122001,0.001122582],"genre_scores_gemma":[0.7485701,0.00002938512,0.2510996,0.00008023319,0.00004136566,0.00004763965,0.00001570951,0.00001870796,0.0000971751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7813507,"threshold_uncertainty_score":0.9999813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01134313802980673,"score_gpt":0.2474545042656787,"score_spread":0.236111366235872,"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."}}