{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T08:00:27Z","timestamp":1790323227018,"version":"4.1.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2010,4,29]],"date-time":"2010-04-29T00:00:00Z","timestamp":1272499200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10994-010-5174-y","type":"journal-article","created":{"date-parts":[[2010,4,28]],"date-time":"2010-04-28T16:16:30Z","timestamp":1272471390000},"page":"111-139","source":"Crossref","is-referenced-by-count":45,"title":["The true sample complexity of active learning"],"prefix":"10.1007","volume":"80","author":[{"given":"Maria-Florina","family":"Balcan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steve","family":"Hanneke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jennifer Wortman","family":"Vaughan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,4,29]]},"reference":[{"key":"5174_CR1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007454427662","volume":"30","author":"A. Antos","year":"1998","unstructured":"Antos, A., & Lugosi, G. (1998). Strong minimax lower bounds for learning. Machine Learning, 30, 31\u201356.","journal-title":"Machine Learning"},{"key":"5174_CR2","volume-title":"Semi-supervised learning","author":"M.-F. Balcan","year":"2006","unstructured":"Balcan, M.-F., & Blum, A. (2006). A PAC-style model for learning from labeled and unlabeled data. In O.\u00a0Chapelle, B.\u00a0Sch\u00f6lkopf, & A.\u00a0Zien (Eds.), Semi-supervised learning. Cambridge: MIT."},{"key":"5174_CR3","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Beygelzimer, A., & Langford, J. (2006). Agnostic active learning. In Proceedings of the 23rd international conference on machine learning.","DOI":"10.1145\/1143844.1143853"},{"key":"5174_CR4","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Broder, A., & Zhang, T. (2007). Margin based active learning. In Proceedings of the 20th annual conference on learning theory.","DOI":"10.1007\/978-3-540-72927-3_5"},{"key":"5174_CR5","unstructured":"Balcan, M.-F., Hanneke, S., & Wortman, J. (2008). The true sample complexity of active learning. In Proceedings of the 21st annual conference on learning theory."},{"issue":"4","key":"5174_CR6","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989). Learnability and the Vapnik Chervonenkis dimension. Journal of the ACM, 36(4), 929\u2013965.","journal-title":"Journal of the ACM"},{"key":"5174_CR7","doi-asserted-by":"crossref","unstructured":"Castro, R., & Nowak, R. (2007). Minimax bounds for active learning. In Proceedings of the 20th annual conference on learning theory.","DOI":"10.1007\/978-3-540-72927-3_3"},{"issue":"2","key":"5174_CR8","first-page":"201","volume":"15","author":"D. Cohn","year":"1994","unstructured":"Cohn, D., Atlas, L., & Ladner, R. (1994). Improving generalization with active learning. Machine Learning, 15(2), 201\u2013221.","journal-title":"Machine Learning"},{"key":"5174_CR9","unstructured":"Dasgupta, S. (2004). Analysis of a greedy active learning strategy. In Advances in neural information processing systems."},{"key":"5174_CR10","unstructured":"Dasgupta, S. (2005). Coarse sample complexity bounds for active learning. In Advances in neural information processing systems."},{"key":"5174_CR11","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Kalai, A., & Monteleoni, C. (2005). Analysis of perceptron-based active learning. In Proceedings of the 18th annual conference on learning theory.","DOI":"10.1007\/11503415_17"},{"key":"5174_CR12","unstructured":"Dasgupta, S., Hsu, D., & Monteleoni, C. (2007). A general agnostic active learning algorithm. In Advances in neural information processing systems."},{"key":"5174_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A probabilistic theory of pattern recognition","author":"L. Devroye","year":"1996","unstructured":"Devroye, L., Gyorfi, L., & Lugosi, G. (1996). A probabilistic theory of pattern recognition. Berlin: Springer."},{"issue":"23","key":"5174_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1007330508534","volume":"28","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Seung, H. S., Shamir, E., & Tishby, N. (1997). Selective sampling using the query by committee algorithm. Machine Learning, 28(23), 133\u2013168.","journal-title":"Machine Learning"},{"key":"5174_CR15","doi-asserted-by":"crossref","unstructured":"Hanneke, S. (2007a). A bound on the label complexity of agnostic active learning. In Proceedings of the 24th international conference on machine learning.","DOI":"10.1145\/1273496.1273541"},{"key":"5174_CR16","doi-asserted-by":"crossref","unstructured":"Hanneke, S. (2007b). Teaching dimension and the complexity of active learning. In Proceedings of the 20th conference on learning theory.","DOI":"10.1007\/978-3-540-72927-3_7"},{"key":"5174_CR17","unstructured":"Hanneke, S. (2009). Theoretical foundations of active learning. PhD thesis, Machine Learning Department, Carnegie Mellon University."},{"key":"5174_CR18","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1006\/inco.1994.1097","volume":"115","author":"D. Haussler","year":"1994","unstructured":"Haussler, D., Littlestone, N., & Warmuth, M. (1994). Predicting {0,1}-functions on randomly drawn points. Information and Computation, 115, 248\u2013292.","journal-title":"Information and Computation"},{"issue":"5","key":"5174_CR19","doi-asserted-by":"crossref","first-page":"1926\u20131940","DOI":"10.1109\/18.705570","volume":"44","author":"J. Shawe-Taylor","year":"1998","unstructured":"Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1998). Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5), 1926\u20131940.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5174_CR20","volume-title":"Estimation of dependencies based on empirical data","author":"V. Vapnik","year":"1982","unstructured":"Vapnik, V. (1982). Estimation of dependencies based on empirical data. New York: Springer."},{"key":"5174_CR21","volume-title":"Statistical learning theory","author":"V. N. Vapnik","year":"1998","unstructured":"Vapnik, V. N. (1998). Statistical learning theory. New York: Wiley."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5174-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-010-5174-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5174-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:28Z","timestamp":1559338828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-010-5174-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,29]]},"references-count":21,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["5174"],"URL":"https:\/\/doi.org\/10.1007\/s10994-010-5174-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,29]]}}}