Learning With Many Irrelevant Features

Proceedings of the 9th National Conference on Artificial Intelligence, AAAI 1991

Volumn 2, Issue , 1991, Pages 547-552

  Almuallim, Hussein ^a   Dietterich, Thomas G ^a  

^a OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; POLYNOMIAL APPROXIMATION;

GENERALIZATION PERFORMANCE; INDUCTIVE BIAS; LEARNING PROBLEM; PAC LEARNING; POLYNOMIAL-TIME ALGORITHMS; QUASI-POLYNOMIAL TIME; RELEVANT FEATURES; SAMPLE COMPLEXITY; TRAINING DATA; TRAINING EXAMPLE;

LEARNING ALGORITHMS;

EID: 85099479344     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Buntine, W. L. 1990. Myths and Legends in Learning Classification Rules. In Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90), 736-742. Boston, MA: Morgan Kaufmann.
2. Blumer, A.; Ehrenfeucht, A.; Haussler, D.; and Warmuth, M. 1987a. Learnability and the Vapnik-Chervonenkis Dimension, Technical Report UCSCCRL-87-20, Department of Computer and Information Sciences, University of California, Santa Cruz, Nov. 1987. Also in Journal of ACM, 36(4):929-965.
3. Blumer, A.; Ehrenfeucht, A.; Haussler, D.; and Warmuth, M. 1987b. Occam's Razor. Information Processing Letters, 24:377-380.
4. Dietterich, T. G. 1989. Limitations on Inductive Learning. In Proceedings of the Sixth International Workshop on Machine Learning, 124-128. Ithaca, NY: Morgan Kaufmann.
5. Ehrenfeucht, A.; Haussler, D.; Kearns, M.; and Valiant, L.G. 1988. A General Lower Bound on the Number of Examples Needed for Learning. In Proceedings of the First Workshop on Computational Learning Theory, 139-154. Boston, MA: Morgan Kaufmann.
6. Harrison, M. 1965. Introduction to Switching and Automata Theory. McGraw Hill, Inc.
7. Littlestone, N. 1988. Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm. Machine Learning, 2:285-318.
8. Mitchell, T. M. 1982. Generalization as Search. Artificial Intelligence, 18:203-226.
9. Pagallo, G.; and Haussler, D. 1990. Boolean Feature Discovery in Empirical Learning. Machine Learning, 5(1):71-100.
10. Quinlan, J. R. 1986. Induction of Decision Trees, Machine Learning, 1(1):81-106.
11. Slepian, D. 1953. On the Number of Symmetry Types of Boolean Functions of n Variables. Can. J. Math., 5(2):185-193.
12. Verbeurgt, K. 1990. Learning DNF Under the Uniform Distribution in Quasi-polynomial Time. In Proceedings of the Third Workshop on Computational Learning Theory, 314-326. Rochester, NY: Morgan Kaufmann.
13. Wolpert, D. 1990. A Mathematical Theory of Generalization: Parts I and II. Complex Systems, 4 (2):151-249.