Lower Bounds on Learning Decision Lists and Trees

Information and Computation

Volumn 126, Issue 2, 1996, Pages 114-122

  Hancock, Thomas ^a   Jiang, Tao ^b   Li, Ming ^c   Tromp, John ^c  

^a SIEMENS CORPORATE RESEARCH   (United States)

^b MCMASTER UNIVERSITY   (Canada)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000943745     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0040     Document Type: Article

References (23)

1. Aditi Dhagat, and Lisa Hellerstein (1994), PAC learning with irrelevant attributes, in "Proc. 35th IEEE Symp. Found. Comp. Sci.," pp. 64-74.
2. Anthony, M., and Biggs, N. (1992), "Computational Learning Theory," Cambridge Univ. Press, Cambridge, UK.
3. Board, R., and Pitt, L. (1990), On the necessity of Occam Algorithms, in "Proc. 22nd ACM Symp. Theory of Computing," pp. 54-63.
4. Arora, A., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. (1992), Proof verification and hardness of approximation problems, in "Proc. 33rd IEEE Symp. Found. Comp. Sci.," pp. 14-23.
5. Bellare, M., Goldwasser, S., Lund, C., and Russel, A. (1993), Efficient probabilistically checkable proofs and applications to approximation, in "Proc. 25th ACM Symp. on Theory of Computing," pp. 294-304.
6. Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M. (1989), Learnability and the Vapnik-Chervonenkis Dimension, J. Assoc. Comput. Mach. 35, 929-965.
7. Breiman, L., Friedman, J., Olshen, R., and Stone, C. (1984), "Classification and Regression Trees," Wadsworth, Belmont, CA.
8. Ehrenfeucht, A., and Haussler, D. ( 1988), Learning decision trees from random examples, in "Proc. 1st COLT."
9. Garey, M., and Johnson, D. (1979), "Computers and Intractability," Freeman, New York.
10. Haussler, D. (1988), Quantifying inductive bias: AI learning algorithms and Valiant's learning framework, Artif. Intell. 36, No. 2, 177-222.
11. Hyafil, L., and Rivest, R. (1976), Constructing optimal decision trees is NP-complete, Inform. Process. Lett. 5, No. 1, 15-17.
12. Kearns, M., Li, M., Pitt, L., and Valiant, L. (1987), On the learnability of Boolean functions, in "Proc. 19th ACM Symp. on Theory of Computing," pp. 285-295.
13. Kivinen, J., Mannila, H., and Ukkonen, E., Learning hierarchical rule sets, in "COLT' 92," pp. 37-44.
14. Lund, C., and Yannakakis, M., On the hardness of approximating minimization problems, in "Proc. 25th ACM Symp. on Theory of Computing," pp. 286-293.
15. Mingers, J. ( 1989), An empirical comparison of selection measures for decision-tree induction, Mach. Learning 3, 319-342.
16. Quinlan, J. R. (1986), Induction of decision trees, Mach. Learning 1, 81-106.
17. Quinlan, J. R., and Rivest, R. (1989), Inferring decision trees using the minimum description length principle, Inform. and Comput. 80, 227-248.
18. Papadimitriou, C. H., and Yannakakis, M. (1991), Optimization, approximation, and complexity classes, Extended abstract in "Proc. 20th ACM Symp. on Theory of Computing," pp. 229-234; full version in J. Comput. System Sci. 43, 425-440.
19. Papadimitriou, C. H., and Yannakakis, M. (1991), Optimization, approximation, and complexity classes, Extended abstract in "Proc. 20th ACM Symp. on Theory of Computing," pp. 229-234; full version in J. Comput. System Sci. 43, 425-440.
20. Pitt, L., and Valiant, L. (1988), Computational limitations on learning from examples, J. Assoc. Comput. Mach. 35, No. 4, 965-984.
21. Rivest, R. (1987), Learning decision lists, Mach. Learning 2, 229-246.
22. Valiant, L. (1984), A theory of the learnable, Comm. ACM 27, 1134-1142.
23. Auer, P., Holte, R. C., and Maass, W. (1995), Theory and applications of agnostic PAC-learning with small decision trees, in "Proc. of the 12th Internat. Machine Learning Conference, Tahoe City," pp. 21-29.