Exact learning when irrelevant variables abound

Information Processing Letters

Volumn 70, Issue 5, 1999, Pages 233-239

  Guijarro, David ^a   Lavín, Victor ^a   Raghavan, Vijay ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; EQUIVALENCE CLASSES; LEARNING ALGORITHMS; LEARNING SYSTEMS; POLYNOMIALS; TREES (MATHEMATICS);

DECISION TREE MINIMIZATION;

DECISION THEORY;

EID: 0033591583     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00063-0     Document Type: Article

References (18)

1. D. Angluin, Queries and concept learning, Machine Learning 2 (1988) 319-342.
2. D. Angluin, Negative results for equivalence queries, Machine Learning 5 (1990) 121-150.
3. J.C. Bioch, T. Ibaraki, Complexity of identification and dualization of positive boolean functions, Inform. Comput. 123 (1995) 50-63.
4. A. Blum, L. Hellerstein, N. Littlestone, Learning in the presence of finitely or infinitely many attributes, J. Comput. System Sci. 50 (1995) 32-40.
5. N. Bshouty, Exact learning Boolean functions via the monotone theory, Inform. Comput. 123 (1) (1995) 146-153.
6. N. Bshouty, R. Cleve, S. Kannan, C. Tamon, Oracles and queries that are sufficient for exact learning, In: Proceedings of the 7th Annual ACM Conference on Computational Learning Theory, 1994, pp. 130-139.
7. N.H. Bshouty, L. Hellerstein, Attribute-efficient learning in query and mistake bound models, In: Proceedings of the 9th Conference on Computational Learning Theory, 1996, pp. 235-243.
8. P. Damaschke, Adaptive versus non-adaptive attribute-efficient learning, In: Proceedings of the 35th ACM Symposium on Theory of Computing, 1998, pp. 590-596.
9. P. Damaschke, Computational aspects of parallel attribute-efficient learning, In: Proceedings of the 9th International Workshop on Algorithmic Learning Theory, 1998.
10. A. Dhagat, L. Hellerstein, PAC learning with irrelevant attributes, In: Proceedings of the 35th IEEE Foundations of ComPuter Science, 1994, pp. 64-75.
11. R. Gavaldà, On the power of equivalence queries, In: ProceedIngs of the 2nd European Conference on Computational LearnIng Theory, 1993, pp. 193-203.
12. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.
13. S. Goldman, M. Kearns, On the complexity of teaching, In: Proceedings of the 4rd Workshop on Computational Learning Theory, 1991, pp. 303-314.
14. T. Hancock, Identifying μ-formula decision trees with queries, In: Proceedings of the 3rd Annual Workshop on Computational Learning Theory, 1990, pp. 23-37.
15. L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, D. Wilkins, How many queries are needed to learn? J. ACM 43 (5) (1996) 840-862.
16. E. Kushilevitz, Y. Mansour, Learning decision trees using the Fourier spectrum, SIAM J. Comput. 22 (6) (1993) 1331-1348.
17. N. Littlestone, Learning quickly when irrelevant variables abound, Machine Learning 2 (1988) 285-318.
18. J. Naor, M. Naor, Small-bias probability spaces: Efficient constructions and applications, In: Proceedings of the 22nd ACM Symposium on the Theory of Computing, 1990, pp. 312-323.