A general dimension for query learning

Journal of Computer and System Sciences

Volumn 73, Issue 6, 2007, Pages 924-940

  Balcázar, José L ^a   Castro, Jorge ^a   Guijarro, David ^b   Köbler, Johannes ^c   Lindner, Wolfgang ^d  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b Mannes Technology Consulting   (Spain)

^c HUMBOLDT UNIVERSITY   (Germany)

^d UNIVERSITY OF ULM   (Germany)

Author keywords

Learning by distances; Learning DNF formulas; Query learning; Statistical queries; UAV queries

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS; MATHEMATICAL MODELS; STATISTICAL METHODS;

LEARNING SETTING; QUERY LEARNING; STATISTICAL QUERIES;

QUERY PROCESSING;

EID: 34250169821     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.03.003     Document Type: Article

References (24)

1. Angluin D. Queries and concept learning. Mach. Learn. 2 (1988) 319-342
2. Angluin D. Negative results for equivalence queries. Mach. Learn. 5 (1990) 121-150
3. Aslam J., and Decatur S. General bounds on statistical query learning and PAC learning with noise via hypothesis boosting. Inform. and Comput. 141 2 (1998) 85-118
4. Balcázar J.L., Castro J., and Guijarro D. A new abstract combinatorial dimension for exact learning via queries. J. Comput. System Sci. 64 (2002) 2-21
5. Balcázar J.L., Castro J., Guijarro D., and Simon H.-U. The consistency dimension and distribution-dependent learning from queries. Theoret. Comput. Sci. 288 2 (2002) 197-215
6. Ben-David S., Itai A., and Kushilevitz E. Learning by distances. Inform. and Comput. 117 2 (1995) 240-250
7. Birkendorf A., Klasner N., Kuhlmann C., and Simon H.U. Structural results about exact learning with unspecified attribute values. J. Comput. System Sci. 60 2 (2000) 258-277
8. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, S. Rudich, Weakly learning DNF and characterizing statistical query learning using Fourier analysis, in: Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, Montréal, Québec, Canada, 1994, pp. 253-262
9. Bshouty N.H., and Feldman V. On using extended statistical queries to avoid membership queries. J. Mach. Learn. Res. 2 (2002) 359-395
10. Bshouty N.H., and Wilson D.K. On learning in the presence of unspecified attribute values. Proceedings of the 12th Annual Conference on Computational Learning Theory (1999), ACM Press 81-87
11. Castro J. A note on bounded query learning. Technical report, Universitat Politècnica de Catalunya. LSI-05-16-R, available at (2005). http://www.lsi.upc.edu/~castro/bounded.ps
12. Dasgupta S., Lee W., and Long P. A theoretical analysis of query selection for collaborative filtering. Mach. Learn. 51 (2003) 283-298
13. Freund Y. Boosting a weak learning algorithm by majority. Inform. and Comput. 121 2 (1995) 256-285
14. Gavaldà R. The complexity of learning with queries. Proceedings of the 9th Annual Conference on Structure in Complexity Theory. Los Alamitos, CA, USA (1994), IEEE Computer Society Press 324-337
15. Gavaldà R. On the power of equivalence queries. Proceedings of the 1st European Conference on Computational Learning Theory: EuroCOLT '93 (1994), Oxford University Press 193-203
16. Goldman S., and Kearns M. On the complexity of teaching. J. Comput. System Sci. 50 (1995) 20-31
17. Goldman S.A., Kwek S.S., and Scott S.D. Learning from examples with unspecified attribute values. Inform. and Comput. 180 2 (2003) 82-100
18. Hegedüs T. Generalized teaching dimension and the query complexity of learning. Proceedings of the 8th Annual Conference on Computational Learning Theory (1995), ACM Press 108-117
19. Hellerstein L., Pillaipakkamnatt K., Raghavan V., and Wilkins D. How many queries are needed to learn?. J. Assoc. Comput. Mach. 43 5 (1996) 840-862
20. Jackson J.C. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. J. Comput. System Sci. 55 (1997) 414-440
21. Kearns M. Efficient noise-tolerant learning from statistical queries. J. ACM 45 6 (1998) 983-1006
22. Köbler J., and Lindner W. The complexity of learning concept classes with polynomial general dimension. Theoret. Comput. Sci. 350 1 (2006) 49-62
23. W. Lindner, Learning DNF by statistical and proper distance queries under the uniform distribution, in: Proc. 16th International Workshop on Algorithmic Learning Theory, 2005, pp. 198-210
24. Littlestone N. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Mach. Learn. 2 (1988) 285-318