Projective DNF formulae and their revision

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2777, Issue , 2003, Pages 625-639

  Sloan, Robert H ^a   Szörényi, Balázs ^b   Turán, Gyögy ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COGNITIVE SYSTEMS; COMPUTER SIMULATION; CONSTRAINT THEORY; POLYNOMIALS; THEOREM PROVING;

DISJUNCTIVE NORMAL FORMS (DNF); LEARNABILITY; PROJECTION DOMAINS; PROJECTION LEARNING;

LEARNING SYSTEMS;

EID: 2442699209     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45167-9_45     Document Type: Conference Paper

References (19)

1. Dana Angluin. Queries revisited. In Algorithmic Learning Theory, 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001, Proceedings, volume 2225 of Lecture Notes in Artificial Intelligence, pages 12-31. Springer, 2001.
2. Peter Auer and Manfred K. Warmuth. Tracking the best disjunction. Machine Learning, 32(2): 127-150, 1998. Earlier version in 36th FOCS, 1995.
3. Peter Auer and Manfred K. Warmuth. Tracking the best disjunction. Machine Learning, 32(2): 127-150, 1998. Earlier version in 36th FOCS, 1995.
4. Avrim Blum. On-line algorithms in machine learning. Available from http:// www-2.cs.cmu.edu/~avrim/Papers/pubs.html, 1996.
5. Judy Goldsmith, Robert H. Sloan, B. Szörényi, and György Turán. Theory revision with queries: Horn, read-once, and parity formulas. Technical Report TR03-039, Electronic Colloquium on Computational Complexity (ECCC), 2003. Available at http://www.eccc.uni-trier.de/eccc/. Also submitted for journal publication.
6. Judy Goldsmith, Robert H. Sloan, and György Turán. Theory revision with queries: DNF formulas. Machine Learning, 47(2/3):257-295, 2002.
7. Tibor Hegedüs. Generalized teaching dimensions and the query complexity of learning. In Proc. 8th Annu. Conf. on Comput. Learning Theory, pages 108-117. ACM Press, New York, NY, 1995.
8. Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan, and Dawn Wilkins. How many queries are needed to learn? J. ACM, 43(5):840-862, 1996.
9. David Helmbold, Robert Sloan, and Manfred K. Warmuth. Learning nested differences of intersection closed concept classes. Machine Learning, 5(2):165-196, 1990. Special Issue on Computational Learning Theory; first appeared in 2nd COLT conference (1989).
10. David Helmbold, Robert Sloan, and Manfred K. Warmuth. Learning nested differences of intersection closed concept classes. Machine Learning, 5(2):165-196, 1990. Special Issue on Computational Learning Theory; first appeared in 2nd COLT conference (1989).
11. Jyrki Kivinen and Manfred K. Warmuth. Additive versus exponentiated gradient updates for linear prediction. In Proc. 27th Annual ACM Symposium on Theory of Computing, pages 209-218. ACM Press, New York, NY, 1995.
12. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2(4):285-318, 1988.
13. N. Littlestone. A mistake-bound version of Rivest's decision-list algorithm. Personal communication to Avrim Blum, 1989.
14. Chris Mesterharm. Tracking linear-threshold concepts with Winnow. In 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 2002, Proceedings, volume 2375 of Lecture Notes in Artificial Intelligence, pages 138-152. Springer, 2002.
15. Ronald L. Rivest. Learning decision lists. Machine Learning, 2:229-246, 1987.
16. Leslie G. Valiant. Projection learning. Machine Learning, 37(2):115-130, 1999.
17. Leslie G. Valiant. A neuroidal architecture for cognitive computation. Journal of the ACM, 47(5):854-882, 2000.
18. S. Wrobel. Concept Formation and Knowledge Revision. Kluwer, 1994.
19. S. Wrobel. First order theory refinement. In L. De Raedt, editor, Advances in ILP, pages 14-33. IOS Press, Amsterdam, 1995.