A subexponential exact learning algorithm for DNF using equivalence queries

Information Processing Letters

Volumn 59, Issue 1, 1996, Pages 37-39

  Bshouty, Nader H ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Algorithms; Learning algorithms

Indexed keywords

EID: 0002719140     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00077-4     Document Type: Article

References (7)

1. D. Angluin, Queries and concept learning, Machine Learning 2 (1988) 319-342.
2. A. Blum, Rank-r decision trees are a subclass of r-decision lists, Inform. Process. Lett. 43 (1992) 183-185.
3. N.H. Bshouty, R. Cleve, S. Kannan and C. Tamon, Oracles and queries that are sufficient for exact learning, in: Proc. 7th Ann. ACM Workshop on Comput. Learning Theory (1994) 130-139.
4. D. Helmbold, R. Sloan and M.K. Warmuth, Learning nested differences of intersection-closed concept classes, Machine learning 5 (1990) 165-196.
5. N. Littlestone, Learning quickly when irrelevant attributes abound: A new linear threshold algorithm. Machine Learning 2 (1988) 285-318.
6. R.L. Rivest, Learning decision lists, Machine Learning 2 (1987) 229-246.
7. L. Valiant, A theory of the learnable, Comm. ACM 27 (1984) 1134-1142.