{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:47:39Z","timestamp":1725482859336},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657019"},{"type":"electronic","value":"9783540490975"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49097-3_4","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T10:32:28Z","timestamp":1175769148000},"page":"34-49","source":"Crossref","is-referenced-by-count":2,"title":["Query by Committee, Linear Separation and Random Walks"],"prefix":"10.1007","author":[{"given":"Ran","family":"Bachrach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shai","family":"Fine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"R. Bachrach, S. Fine, and E. Shamir. Query by committee, linear separation and random walks-full version. 1998. Available at http:\/\/www.cs.huji.ac.il\/labs\/learning\/Papers\/MLT list.html .","DOI":"10.1007\/3-540-49097-3_4"},{"key":"4_CR2","unstructured":"C. Burges. A tutorial on support vector machines for pattern recognition. 1998. Available at http:\/\/svm.research.bell-labs.com\/SVMdoc.html ."},{"key":"4_CR3","unstructured":"D. Cohn, L. Atlas, and R. Ladner. Training connectionist networks with queries and selective sampling. Advanced in Neural Information Processing Systems 2, 1990."},{"issue":"Number 1","key":"4_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"M. Dyer","year":"1991","unstructured":"M. Dyer, A. Frieze, and R. Kannan. A random polynomial time algorithm for approximating the volume of convex bodies. Journal of the Association for Com-puting Machinery, 38, Number 1:1\u201317, 1991.","journal-title":"Journal of the Association for Com-puting Machinery"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"H.G. Eggleston. Convexity. Cambridge Univ. Press, 1958.","DOI":"10.1017\/CBO9780511566172"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1007330508534","volume":"28","author":"Y. Freund","year":"1997","unstructured":"Y. Freund, H. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Macine Learning, 28:133\u2013168, 1997.","journal-title":"Macine Learning"},{"key":"4_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and Combinatorial Optimization","author":"L. Grotchel","year":"1988","unstructured":"L. Grotchel, L. Lovasz, and A. Schrijver. Geometric algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988."},{"key":"4_CR8","first-page":"83","volume":"14","author":"D. Haussler","year":"1994","unstructured":"D. Haussler, M. Kearns, and R.E. Schapie. Bounds on the sample complexity of bayesian learning using information theory and the vc dimension. Machine Learning, 14:83\u2013113, 1994.","journal-title":"Machine Learning"},{"issue":"Number 4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"L. Lovasz","year":"1993","unstructured":"L. Lovasz and M. Simonovits. Random walks in a convex body and an improved volume algorithm. Random Structures and Algorithms, 4, Number 4:359\u2013412, 1993.","journal-title":"Random Structures and Algorithms"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"D.A. McAllester. Some pac-bayesian theorems. Proc. of the Eleventh Annual Conference on Computational Learning Theory, pages 230\u2013234, 1998.","DOI":"10.1145\/279943.279989"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"H.S. Seung, M. Opper, and H. Sompolinsky. Query by committee. Proc. of the Fith Workshop on Computational Learning Theory, pages 287\u2013294, 1992.","DOI":"10.1145\/130385.130417"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"J. Shawe-Taylor and R.C. Williamson. A pac analysis of a bayesian estimator. Proc. of the Tenth Annual Conference on Computational Learning Theory., 1997.","DOI":"10.1145\/267460.267466"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49097-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T03:33:10Z","timestamp":1556335990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49097-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657019","9783540490975"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-49097-3_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}