Decision Trees: More Theoretical Justification For Practical Algorithms

Decision Trees: More Theoretical Justification For Practical Algorithms

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Amos Fiat , Dmitry Pechyony

BibTeX

@MISC{Fiat_decisiontrees:,
    author = {Amos Fiat and Dmitry Pechyony},
    title = {Decision Trees: More Theoretical Justification For Practical Algorithms},
    year = {}
}

Bookmark

OpenURL

Abstract

We study impurity-based decision tree algorithms such as CART, C4.5, etc., so as to better understand their theoretical underpinnings. We consider

Citations

4071	C4.5: Programs for machine learning - Quinlan - 1993
3143	Classification and Regression Trees - Breiman, Friedman, et al. - 1984
1515	A Theory of the Learnable - Valiant - 1984
1512	Smola A: Learning with Kernels - Schölkopf - 2002
519	A threshold of ln n for approximating set cover - Feige - 1998
507	An Introduction to Computational Learning Theory - Kearns, Vazirani - 1994
347	Learning decision lists - Rivest - 1987
279	Cryptographic limitations on learning boolean formulae and finite automata - Kearns, Valiant - 1994
274	Inferring decision trees using the minimum description length principle. Information and Computation 80.227–248 - QUINLAN, RIVEST - 1989
248	Efficient noise-tolerant learning from statistical queries - Kearns - 1998
228	SPRINT: A Scalable Parallel Classifier for Data Mining - JC, Agrawal, et al. - 1996
207	Quantifying inductive bias: AI learning algorithms and Valiant’s learning framework - Haussler - 1988
197	Learning from noisy examples - Angluin, Laird - 1988
182	Computational limitations on learning from examples - Pitt, Valiant - 1988
173	SLIQ: A fast scalable classifier for data mining - Mehta, Agrawal, et al. - 1996
158	Learning in the presence of malicious errors - Kearns, Li - 1993
155	On the Learnability of Boolean Formula - Kearns, Li, et al. - 1987
155	Learning Decision Trees using the Fourier Spectrum - Kushilevitz, Mansour - 1993
153	A branch and bound algorithm for feature subset selection - NARENDRA, FUKUNAGA - 1977
153	Improved Use of Continuous Attributes in C4.5 - Quinlan - 1996
147	Constructing optimal binary decision trees is NP-complete - l, Rivest - 1976
121	Automatic construction of decision trees from data: A multi-disciplinary survey - Murthy - 1998
110	Probability inequalities for sums of bounded random variables - Hoeding - 1963
105	Weakly learning dnf and characterizing statistical query learning using fourier analysis - Blum, Furst, et al. - 1994
98	Learning read-once formulas with queries - Angluin, Hellerstein, et al. - 1993
97	Tree induction for probability-based ranking - Provost, Domingos
89	Equivalence of models for polynomial learnability - HAUSSLER, KEARNS, et al. - 1991
87	Collective coin flipping - Ben-Or, Linial - 1990
81	On the boosting ability of top-down decision tree learning algorithms - Kearns, Mansour - 1996
80	A system for induction of oblique decision trees - Murty, Kasif, et al. - 1994
79	personal communication - Smith, Mills
72	Semeraro “A Comparative Analysis of Methods for Pruning Decision Trees - Esposito, Malerba, et al.
58	Learning decision trees from random examples - Ehrenfeucht, Haussler - 1989
56	A measure of asymptotic eciency for test of a hypothesis based on the sum of observations - Cherno - 1952
43	Exact learning boolean functions via the monotone theory - Bshouty - 1995
42	On the Fourier Spectrum of Monotone Functions - Bshouty, Tamon - 1996
39	personal communication - Cohen - 1942
33	Learning noisy perceptrons by a perceptron in polynomial time - Cohen - 1997
25	On using extended statistical queries to avoid membership queries - Bshouty, Feldman
23	Boosting in the presence of noise - Kalai, Servedio - 2005
23	Learning juntas - Mossel, O’Donnell, et al. - 2003
21	CLOUDS: A decision tree classifier for large datasets - Alsabti, Ranka, et al. - 1998
20	Rank-r decision trees are a subclass of r-decision lists - Blum - 1992
18	Simple learning algorithms for decision trees and multivariate polynomials - Bshouty, Mansour - 1995
17	Expert systems – rule induction with statistical data - Mingers - 1987
15	Experience in the use of an inductive system in knowledge engineering - Hart - 1985
13	Mathematical techniques for the analysis of Boolean functions - Bernasconi - 1998
13	Learning monotone k-� DNF formulas on product distributions - HANCOCK, MANSOUR - 1991
10	The complexity of minimizing disjunctive normal form formulas - Czort - 1999
9	Secret: A scalable linear regression tree algorithm - Dobra, Gehrke - 2002