Learning unions of boxes with membership and equivalence queries

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn Part F129415, Issue , 1994, Pages 198-207

  Goldberg, Paul W ^a   Goldmant, Sally A ^b   Mathias, H David ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; POLYNOMIALS; TREES (MATHEMATICS);

COMPLEXITY MEASURES; DISCRETE VALUES; DNF FORMULAS; EQUIVALENCE QUERIES; EUCLIDEAN SPACES; HALF SPACES; LEARNABILITY; MEMBERSHIP QUERY;

GEOMETRY;

EID: 85030051641     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/180139.181102     Document Type: Conference Paper

References (17)

1. Dana Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988.
2. Peter Auer. On-line learning of rectangles in noisy environments. In Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, pages 253-261, July 1993.
3. Avrim Blum and Steven Rudich. Fast learning of k-term DNF formulas with queries. In Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, pages 382-389, May 1992.
4. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the Association for Computing Machineyj 36(4):929-965, October 1989.
5. Zhixiang Chen, Learning unions of two rectangles in the plane with equivalence queries. In Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, pages 243-252. ACM Press, July 1993.
6. Zhixiang Chen and Wolfgang Maws. On-line learning of rectangles. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pages 16-27. ACM Press, July 1992.
7. V. Chvatal. A greedy heuristic for the set covering problem, Mathematics of Operations Research, 4(3):233-235, 1979.
8. Mike Frazier, Sally Goldman, Nina Mishra, and Leonard Pitt. Learning from a consistently ignorant teacher. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, July 1994.
9. Steven Homer and Zhixiang Chen. Fast learning unions of rectangles with queries. Unpublished manuscript, July 1993.
10. Nick Littlestone. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
11. Philip M. Long and Manfred K. Warmuth. Composite geometric concepts and polynomial predictability. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 273-287. Morgan Kaufmann, August 1990.
12. Wolfgang Maass and Gyorgy Turan. On the complexity of learning from counterexamples. In With Annual Symposium on Foundations of Computer Science, pages 262-267, October 1989.
13. Wolfgang Maass and Gyorgy Turán. On the complexity of learning from counterexamples and membership queries. In .YIst Annual Symposium on Foundations of Computer Science, pages 203-210, October 1990.
14. Wolfgang Maass and Gyorgy Turiin. Algorithms and lower bounds for on-line learning of geometrical concepts. Technical Report IIG-Report 316, Technische Universitat Graz, TU Graz, Austria, October 1991.
15. Wolfgang Maass and Gyorgy Turán. Lower bound methods and separation results for on-line learning models. Machine Learning, 9:107-145, 1992.
16. Leonard Pitt and Leslie G. Valiant. Computational limitations on learning from examples. Journal of the Association for Computing Machiney, 35(4):965-984, 1988.
17. Leslie Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, November 1984.