{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:35:18Z","timestamp":1725471318098},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540352945"},{"type":"electronic","value":"9783540352969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11776420_47","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T14:49:15Z","timestamp":1159454955000},"page":"650-652","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for General Active Learning"],"prefix":"10.1007","author":[{"given":"Claire","family":"Monteleoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-45583-3_3","volume-title":"Algorithmic Learning Theory","author":"D. Angluin","year":"2001","unstructured":"Angluin, D.: Queries revisited. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol.\u00a02225, pp. 12\u201331. Springer, Heidelberg (2001)"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Beygelzimer, A., Langford, J.: Agnostic active learning. In: International Conference on Machine Learning (2006)","DOI":"10.1145\/1143844.1143853"},{"key":"47_CR3","unstructured":"Cesa-Bianchi, N., Gentile, C., Zaniboni, L.: Worst-case analysis of selective sampling for linear-threshold algorithms. In: Advances in Neural Information Processing Systems 17 (2004)"},{"issue":"2","key":"47_CR4","first-page":"201","volume":"15","author":"D.A. Cohn","year":"1994","unstructured":"Cohn, D.A., Atlas, L., Ladner, R.E.: Improving generalization with active learning. Machine Learning\u00a015(2), 201\u2013221 (1994)","journal-title":"Machine Learning"},{"key":"47_CR5","unstructured":"Dasgupta, S.: Coarse sample complexity bounds for active learning. In: Advances in Neural Information Processing Systems\u00a018 (2005)"},{"key":"47_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/11503415_17","volume-title":"Learning Theory","author":"S. Dasgupta","year":"2005","unstructured":"Dasgupta, S., Kalai, A.T., Monteleoni, C.: Analysis of perceptron-based active learning. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS, vol.\u00a03559, pp. 249\u2013263. Springer, Heidelberg (2005)"},{"issue":"2-3","key":"47_CR7","doi-asserted-by":"publisher","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.: Selective sampling using the query by committee algorithm. Machine Learning\u00a028(2-3), 133\u2013168 (1997)","journal-title":"Machine Learning"},{"key":"47_CR8","unstructured":"Gilad-Bachrach, R., Navot, A., Tishby, N.: Query by committee made real. In: Advances in Neural Information Processing Systems\u00a018 (2005)"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"K\u00e4\u00e4ri\u00e4inen, M.: On active learning in the non-realizable case. In: Foundations of Active Learning Workshop at Neural Information Processing Systems Conference (2005)","DOI":"10.1007\/11894841_9"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Lewis, D.D., Gale, W.A.: A sequential algorithm for training text classifiers. In: Proc. of SIGIR 1994, 17th ACM International Conference on Research and Development in Information Retrieval (1994)","DOI":"10.1007\/978-1-4471-2099-5_1"},{"issue":"6","key":"47_CR11","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1109\/72.471352","volume":"6","author":"P.M. Long","year":"1995","unstructured":"Long, P.M.: On the sample complexity of PAC learning halfspaces against the uniform distribution. IEEE Transactions on Neural Networks\u00a06(6), 1556\u20131559 (1995)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"5","key":"47_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0020-0190(03)00311-9","volume":"87","author":"P.M. Long","year":"2003","unstructured":"Long, P.M.: An upper bound on the sample complexity of PAC learning halfspaces with respect to the uniform distribution. Information Processing Letters\u00a087(5), 223\u2013229 (2003)","journal-title":"Information Processing Letters"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Seung, H.S., Opper, M., Sompolinsky, H.: Query by committee. In: Proc. Fifth Annual ACM Conference on Computational Learning Theory (1992)","DOI":"10.1145\/130385.130417"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:59Z","timestamp":1605643619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11776420_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}