{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:57Z","timestamp":1743049677663,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_10","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"106-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Learning of Boolean Functions Using Support Vector Machines"],"prefix":"10.1007","author":[{"given":"Ken","family":"Sadohara","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"10_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. The complexity of approximating a nonlinear program. In Complexity of Numerical Optimization, pages 16\u201332. World Scientific, 1993.","DOI":"10.1142\/9789814354363_0002"},{"key":"10_CR3","unstructured":"V. Cherkassky and F. Mulier. Learning from Data. Wiley, 1998."},{"key":"10_CR4","unstructured":"N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines. Cambridge Press, 2000."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1023\/A:1007413511361","volume":"29","author":"P. Domingos","year":"1997","unstructured":"P. Domingos. On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29:103-130, 1997.","journal-title":"Machine Learning"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1023\/A:1009868929893","volume":"3","author":"P. Domingos","year":"1999","unstructured":"P. Domingos. The role of Occam\u2019s razor in knowledge discovery. Data Mining and Knowledge Discovery, 3:409\u2013425, 1999.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"M. Kearns, Ming Li, L. Pitt, and L.G. Valiant. On the learnability of Boolean formulae. ACM, pages 285\u2013295, 1987.","DOI":"10.1145\/28395.28426"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"R. Khardon, D. Roth, and R. Servedio. Efficiency versus convergence of Boolean kernels for on-line learning algorithms. Manuscript, 2001.","DOI":"10.7551\/mitpress\/1120.003.0059"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MIS.1998.671088","volume":"13","author":"H. Liu","year":"1998","unstructured":"H. Liu and H. Motoda. Feature transformation and subset selection. IEEE Intelligent Systems, 13(2):26\u201328, 1998.","journal-title":"IEEE Intelligent Systems"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"L. Pitt and L.G. Valiant. Computational limitations on learning from examples. Journal of the Association for Computing Machinery, 35(4):965\u2013984, 1988.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"J.C. Platt. Fast training of support vector machines using sequential minimal optimization. In Advances in Kernel Methods-Support Vector Learning, pages 185\u2013208. MIT Press, 1998.","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"J.R. Quinlan. An empirical comparison of genetic and decision-tree classifiers. In Proceedings of International Conference on Machine Learning, pages 135\u2013141, 1988.","DOI":"10.1016\/B978-0-934613-64-4.50019-0"},{"key":"10_CR13","unstructured":"J.R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993."},{"issue":"11","key":"10_CR14","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, 1984.","journal-title":"Communications of the ACM"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"V. Vapnik. The Nature of Statistical Learning Theory. Springer-Verlag, 1995.","DOI":"10.1007\/978-1-4757-2440-0"},{"key":"10_CR16","unstructured":"V. Vapnik. Statistical Learning Theory. Wiley, 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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T14:53:52Z","timestamp":1708268032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_10","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"}}]}}