Large Datasets Lead to Overly Complex Models: An Explanation and a Solution (1998)

by Tim Oates , David Jensen
Citations:44 - 4 self

Documents Related by Co-Citation

4934 C4.5: Programs for Machine Learning – J R Quinlan - 1993
3354 Induction of Decision Trees – J. R. Quinlan - 1986
2868 P.: UCI Repository of Machine Learning Databases – C J Merz, Merphy - 1996
3909 Classification and Regression Trees – L Breiman, J H Friedman, R A Olshen, C J Stone - 1984
66 The Effects of Training Set Size on Decision Tree Complexity – Oates - 1997
166 An empirical comparison of pruning methods for decision tree induction – John Mingers - 1989
293 Inferring decision tree using the Minimum Description Length principle – J Ross Quinlan, Ronald L Riverst - 1989
157 An Exploratory Technique for Investigating Large Quantities of Categorical Data – G V Kass - 1980
73 Multiple Comparisons in Induction Algorithms – David Jensen, Paul R. Cohen - 1998
2492 Bagging Predictors – Leo Breiman, Leo Breiman - 1996
16 Adjusting for multiple comparisons in decision tree pruning – David Jensen, Matt Schmill - 1997
976 Fast Effective Rule Induction – William W. Cohen - 1995
85 A Survey of Methods for Scaling Up Inductive Algorithms – Foster Provost, Venkateswarlu Kolluri - 1999
120 Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets – Andrew Moore, Mary Soon Lee - 1997
17 Using a Permutation Test for Attribute Selection in Decision Trees – Eibe Frank, Ian H. Witten - 1998
1695 A Theory of the Learnable – L. G. Valiant - 1984
200 Improved Use of Continuous Attributes in C4.5 – J. R. Quinlan - 1996
143 Concept learning and the problem of small disjuncts – Robert C. Holte, Liane E. Acker, Bruce W. Porter - 1989
38 Simplifying Decision Trees: A Survey – Leonard A. Breslow, David W. Aha - 1996