On the proper learning of axis parallel concepts

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

Volumn 2375, Issue , 2002, Pages 287-302

  Bshouty, Nader H ^a   Burroughs, Lynn ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BINARY TREES; DECISION TREES; EQUIVALENCE CLASSES; FORESTRY; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TREES (MATHEMATICS);

EQUIVALENCE QUERIES; FOLLOWING PROBLEM; MEMBERSHIP QUERY; MULTIVARIATE POLYNOMIAL; PAC LEARNING MODEL; PRODUCT DISTRIBUTIONS; PROPER LEARNING; TIME COMPLEXITY;

LEARNING ALGORITHMS;

EID: 55249127295     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45435-7_20     Document Type: Conference Paper

References (27)

1. [A88] D. Angluin. Queries and concept learning. Machine Learning, 319-342, 1988.
2. [ABSS97] S. Arora, L. Babai, J. Stern, Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. JCSS, 43, 317-331, 1997.
3. [BBBKV00] A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz, S. Varricchio. Learning functions represented as multiplicity automata. JACM 47(3): 506-530, 2000.
4. [BK98] A. Beimel and E. Kushilevitz. Learning boxes in high dimension. Algorithmica, 22(1/2):76-90, 1998.
5. [BBK97] S. Ben-David, N. H. Bshouty, E. Kushilevitz. A composition theorem for learning algorithms with applications to geometric concept classes. 29th STOC, 1997.
6. [BCV96] F. Bergadano, D. Catalano, S. Varricchio. Learning sat-k-DNF formulas from membership queries. In 28th STOC, pp 126-130, 1996.
7. [BD92] P. Berman, B. DasGupta. Approximating the rectilinear polygon cover problems. In Proceedings of the 4th Canadian Conference on Computational Geometry, pages 229-235, 1992.
8. [Bs95] N. H. Bshouty, Exact learning of boolean functions via the monotone theory. Information and Computation, 123, pp. 146-153, 1995.
9. [B95a] N. H. Bshouty. Simple learning algorithms using divide and conquer. In Proceedings of the Annual ACM Workshop on Computational Learning Theory, 1995.
10. [B98] N. H. Bshouty. A new composition theorem for learning algorithms. Proceedings of the 30th annual ACM Symposium on Theory of Computing (STOC), May 1998.
11. [BCG96] N. H. Bshouty, R. Cleve, R. Gavalda, S. Kannan, C. Tamon. Oracles and queries that are sufficient for exact learning. JCSS 52(3): pp. 421-433, 1996.
12. [BGGM99] N. H. Bshouty, P. W. Goldberg, S. A. Goldman, D. H. Mathias. Exact learning of discretized geometric concepts. SIAM J. of Comput. 28(2), 678-699, 1999.
13. [CH96] Z. Chen and W. Homer. The bounded injury priority method and the learnability of unions of rectangles. Annals of Pure and Applied Logic 77(2):143-168, 1996.
14. [CM94] Z. Chen, W. Maass. On-line learning of rectangles and unions of rectangles, Machine Learning, 17(1/2), pages 201-223, 1994.
15. [DK91] V. J. Dielissen, A. Kaldewaij. Rectangular partition is polynomial in two dimensions but NP-complete in three. In IPL, pages 1-6, 1991.
16. [Fr89] D. Franzblau. Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectangles. SIAM J. on Discrete Math 2, 307-321, 1989.
17. [HPRW96] L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, D. Wilkins. How many queries are needed to learn? JACM, 43(5), pages 840-862, 1996.
18. [HR02] L. Hellerstein and V. Raghavan. Exact learning of DNF formulas using DNF hypotheses. In 34rd Annual Symposium on Theory of Computing (STOC), 2002.
19. O(n1/3). In 33rd Annual Symposium on Theory of Computing (STOC), 2001, pp. 258-265.
20. [LLLMP79] W. Lipski, Jr., E. Lodi, F. Luccio, C. Mugnai and L. Pagli. On twodimensional data organization II. In Fund. Inform. 2, pages 245-260, 1979.
21. [MW98] W. Maass and M. K. Warmuth Efficient learning with virtual threshold gates Information and Computation, 141(1): 66-83, 1998.
22. [PR96] K. Pillaipakkamntt, V. Raghavan, On the limits of proper learnability of subclasses of DNF formulas, Machine Learning, 25(2/3), pages 237-263, 1996.
23. [PV88] L. Pitt and L. G. Valiant. Computational Limitations on Learning from Examples. Journal of the ACM, 35(4):965-984, October 1988.
24. [SS93] R. E. Schapire, L. M. Sellie. Learning sparse multivariate polynomial over a field with queries and counterexamples. In Proceedings of the Sixth Annual ACM Workshop on Computational Learning Theory. July, 1993.
25. 2 minimization problems. In Proceedings of the 40th Symposium on Foundations of Computer Science, 1999.
26. [Val84] L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, November 1984.
27. [ZB00] H. Zantema, H. Bodlaender. Finding small equivalent decision trees is hard. In International Journal of Foundations of Computer Science, 11(2): 343-354, 2000.