{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:35:52Z","timestamp":1774946152022,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540265566","type":"print"},{"value":"9783540318927","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11503415_17","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T18:16:38Z","timestamp":1279131398000},"page":"249-263","source":"Crossref","is-referenced-by-count":42,"title":["Analysis of Perceptron-Based Active Learning"],"prefix":"10.1007","author":[{"given":"Sanjoy","family":"Dasgupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam Tauman","family":"Kalai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claire","family":"Monteleoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Artificial Intelligence","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":"17_CR2","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1162\/neco.1990.2.2.248","volume":"2","author":"E.B. Baum","year":"1997","unstructured":"Baum, E.B.: The perceptron algorithm is fast for nonmalicious distributions. Neural Computation\u00a02, 248\u2013260 (1997)","journal-title":"Neural Computation"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A., Frieze, A., Kannan, R., Vempala, S.: A polynomial-time algorithm for learning noisy linear threshold functions. In: Proc. 37th IEEE Symposium on the Foundations of Computer Science (1996)","DOI":"10.1109\/SFCS.1996.548492"},{"key":"17_CR4","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, vol.\u00a017 (2004)"},{"key":"17_CR5","unstructured":"Dasgupta, S.: Analysis of a greedy active learning strategy. In: Advances in Neural Information Processing Systems, vol.\u00a017 (2004)"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(01)00079-2","volume":"284","author":"S. Fine","year":"2002","unstructured":"Fine, S., Gilad-Bachrach, R., Shamir, E.: Query by committee, linear separation and random walks. Theoretical Computer Science\u00a0284(1), 25\u201351 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"17_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":"17_CR8","unstructured":"Gilad-Bachrach, R., Navot, A., Tishby, N.: Kernel query by committee (KQBC). Technical Report 2003-88, Leibniz Center, the Hebrew University (2003)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Lewis, D.D., Gale, W.A.: A sequential algorithm for training text classifiers. In: Proc. of SIGIR-94, 17th ACM International Conference on Research and Development in Information Retrieval (1994)","DOI":"10.1007\/978-1-4471-2099-5_1"},{"issue":"6","key":"17_CR10","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":"17_CR11","doi-asserted-by":"publisher","first-page":"229","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), 229\u2013234 (2003)","journal-title":"Information Processing Letters"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Servedio, R.A.: On PAC learning using winnow, perceptron, and a perceptron-like algorithm. In: Computational Learning Theory, pp. 296\u2013307 (1999)","DOI":"10.1145\/307400.307474"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11503415_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:42:46Z","timestamp":1619491366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11503415_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265566","9783540318927"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11503415_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}