Learning Boolean concepts in the presence of many irrelevant features
- 30 September 1994
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 69 (1-2), 279-305
- https://doi.org/10.1016/0004-3702(94)90084-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Boolean Feature Discovery in Empirical LearningMachine Learning, 1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmMachine Learning, 1988
- Occam's RazorInformation Processing Letters, 1987
- Induction of decision treesMachine Learning, 1986
- Optimum feature selection by zero-one integer programmingIEEE Transactions on Systems, Man, and Cybernetics, 1984
- Generalization as searchArtificial Intelligence, 1982
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- A Branch and Bound Algorithm for Feature Subset SelectionInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1977
- A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition PropertiesInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1971