Learning random log-depth decision trees under the uniform distribution

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2777, Issue , 2003, Pages 610-624

  Jackson, Jeffrey C ^a   Servedio, Rocco A ^b  

^a DUQUESNE UNIVERSITY   (United States)

^b Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; HEURISTIC METHODS; POLYNOMIALS; PROBABILITY; STATISTICAL METHODS; THEOREM PROVING; TREES (MATHEMATICS); DATA MINING;

BOOLEAN CIRCUITS; DECISION TREE (DT); POLYNOMIAL FRACTIONS; STATISTICAL QUERY MODELS; NATURAL MODELS; UNIFORM DISTRIBUTION;

LEARNING SYSTEMS; DECISION TREES;

EID: 9444255068     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45167-9_44     Document Type: Conference Paper

References (8)

1. A. Blum. Rank-r decision trees are a subclass of r-decision lists. Information Processing Letters, 42(4):183-185, 1992.
2. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich. Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 253-262, 1994.
3. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification of Regression Trees. Wadsworth, 1984.
4. N. Bshouty. Exact learning boolean functions via the monotone theory. Information and Computation, 123(1):146-153, 1995.
5. A. Ehrenfeucht and D. Haussler. Learning decision trees from random examples. Information and Computation, 82(3):231-246, 1989.
6. T. Hancock. Learning kμ, decision trees on the uniform distribution. In Proceedings of the Sixth Annual Conference on Computational Learning Theory, pages 352-360, 1993.
7. E. Kushilevitz and Y. Mansour. Learning decision trees using the Fourier spectrum. SIAM J. on Computing, 22(6):1331-1348, 1993.
8. J. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.