{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T23:48:33Z","timestamp":1781912913184,"version":"3.54.5"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4034,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0304-3975(01)00079-2","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T12:10:37Z","timestamp":1034338237000},"page":"25-51","source":"Crossref","is-referenced-by-count":17,"title":["Query by committee, linear separation and random walks"],"prefix":"10.1016","volume":"284","author":[{"given":"Shai","family":"Fine","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ran","family":"Gilad-Bachrach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eli","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00079-2_BIB1","unstructured":"C. Burges, A Tutorial on Support Vector Machines for pattern recognition, 1998, available at http:\/\/svm.research.bell-labs.com\/SVMdoc.html."},{"key":"10.1016\/S0304-3975(01)00079-2_BIB2","unstructured":"D. Cohn, L. Atlas, R. Ladner, Training connectionist networks with queries and selective sampling, Adv. Neural Inform. Process. Systems 2, 1990."},{"key":"10.1016\/S0304-3975(01)00079-2_BIB3","doi-asserted-by":"crossref","unstructured":"I. Dagan, S. Engelson, Committee-based sampling for training probabilistic classifiers, Proc. 12th Int. Conf. on Machine Learning, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50027-X"},{"issue":"1","key":"10.1016\/S0304-3975(01)00079-2_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","article-title":"A random polynomial time algorithm for approximating the volume of convex bodies","volume":"38","author":"Dyer","year":"1991","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(01)00079-2_BIB5","series-title":"Convexity","author":"Eggleston","year":"1958"},{"issue":"2\/3","key":"10.1016\/S0304-3975(01)00079-2_BIB6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1007330508534","article-title":"Selective sampling using the query by committee algorithm","volume":"28","author":"Freund","year":"1997","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(01)00079-2_BIB7","series-title":"Geometric algorithms and Combinatorial Optimization","author":"Grotchel","year":"1988"},{"key":"10.1016\/S0304-3975(01)00079-2_BIB8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF00993163","article-title":"Bounds on the sample complexity of Bayesian learning using information theory and the vc dimension","volume":"14","author":"Haussler","year":"1994","journal-title":"Mach. Learning"},{"issue":"4","key":"10.1016\/S0304-3975(01)00079-2_BIB9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/rsa.3240040402","article-title":"Random walks in a convex body and an improved volume algorithm","volume":"4","author":"Lovasz","year":"1993","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0304-3975(01)00079-2_BIB10","unstructured":"Ray Liere, Prasad Tadepalli, Active learning with committees for text categorization, AAAI-97, 1997."},{"key":"10.1016\/S0304-3975(01)00079-2_BIB11","doi-asserted-by":"crossref","unstructured":"D.A. McAllester, Some pac-bayesian theorems, Proc. 11th Annu. Conf. on Computational Learning Theory, 1998, pp. 230\u2013234.","DOI":"10.1145\/279943.279989"},{"key":"10.1016\/S0304-3975(01)00079-2_BIB12","doi-asserted-by":"crossref","unstructured":"H.S. Seung, M. Opper, H. Sompolinsky, Query by committee, Proc. 5th Workshop on Computational Learning Theory, Morgan Kaufman, San Mateo, CA, 1992, pp. 287\u2013294.","DOI":"10.1145\/130385.130417"},{"key":"10.1016\/S0304-3975(01)00079-2_BIB13","series-title":"A pac analysis of a Bayesian estimator, Proc. 10th Annu. Conf. on Computational Learning Theory","author":"Shawe-Taylor","year":"1997"},{"key":"10.1016\/S0304-3975(01)00079-2_BIB14","series-title":"Statistical Learning Theory","author":"Vapnik","year":"1998"},{"key":"10.1016\/S0304-3975(01)00079-2_BIB15","unstructured":"V. Vapnik, S. Golowich, A. Smola, Support vector method for function approximation, regression estimation, and signal processing, Adv. Neural Inform. Process. Systems, 1996."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000792?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000792?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,5]],"date-time":"2020-03-05T14:39:16Z","timestamp":1583419156000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0304397501000792"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00079-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}