{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:51:31Z","timestamp":1743130291114,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45583-3_12","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"135-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Coherent Concepts"],"prefix":"10.1007","author":[{"given":"Ashutosh","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Roth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"12_CR1","unstructured":"J. Amsterdam. Some philosophical problems with formal learning theory. In National Conference on Artificial Intelligence, pages 580\u2013584, 1988."},{"key":"12_CR2","unstructured":"R. I. Arriaga and S. Vempala. An algorithmic theory of learning: Robust concepts and random projection. In Proc. of the 40th Foundations of Computer Science, 1999."},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0304-3975(91)90026-X","volume":"86","author":"G. Benedek","year":"1991","unstructured":"G. Benedek and A. Itai. Learnability with respect to fixed distributions. Theoret. Comput. Sci., 86(2):377\u2013389, 1991.","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"A. Blum and T. Mitchell. Combining labeled and unlabeled data with co-training. In Proc. of the Annual ACM Workshop on Computational Learning Theory, pages 92\u2013100, 1998.","DOI":"10.1145\/279943.279962"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam\u2019s razor. Information Processing Letters, 24:377\u2013380, April 1987.","journal-title":"Information Processing Letters"},{"key":"12_CR6","first-page":"273","volume":"20","author":"C. Cortes","year":"1995","unstructured":"C. Cortes and V. Vapnik. Support-vector networks. Machine Learning, 20:273\u2013297, 1995.","journal-title":"Machine Learning"},{"key":"12_CR7","unstructured":"H. Druker, R. Schapire, and P. Simard. Improving performance in neural networks using a boosting algorithm. In Neural Information Processing Systems 5, pages 42\u201349. Morgan Kaufmann, 1993."},{"key":"12_CR8","unstructured":"A. Garg, S. Har-Peled, and D. Roth. Generalization bounds for linear learning algorithms. Technical Report UIUCDCS-R-2001-2232, University of Illinois at Urbana Champaign, June 2001."},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1007545901558","volume":"34","author":"A. R. Golding","year":"1999","unstructured":"A. R. Golding and D. Roth. A Winnow based approach to context-sensitive spelling correction. Machine Learning, 34(1\u20133):107\u2013130, 1999. Special Issue on Machine Learning and Natural Language.","journal-title":"Machine Learning"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1023\/A:1007618624809","volume":"37","author":"D. A. McAllester","year":"1999","unstructured":"D. A. McAllester. Some PAC-Bayesian theorems. Machine Learning, 37(3):355\u2013363, 1999.","journal-title":"Machine Learning"},{"key":"12_CR11","unstructured":"D. Roth and D. Zelenko. Towards a theory of coherent concepts. In National Conference on Artificial Intelligence, pages 639\u2013644, 2000."},{"issue":"11","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134\u20131142, November 1984.","journal-title":"Communications of the ACM"},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1162\/neco.1994.6.5.851","volume":"6","author":"V. Vapnik","year":"1994","unstructured":"V. Vapnik, E. Levin, and Y. Le Cun. Measuring the VC-dimension of a learning machine. Neural Computation, 6(5):851\u2013876, 1994.","journal-title":"Neural Computation"},{"key":"12_CR14","volume-title":"Statistical Learning Theory","author":"V. N. Vapnik","year":"1998","unstructured":"V. N. Vapnik. Statistical Learning Theory. John-Wiley and Sons Inc., New York, 1998."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45583-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T01:03:23Z","timestamp":1585616603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}