{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:50Z","timestamp":1725488450505},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423430"},{"type":"electronic","value":"9783540445814"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44581-1_26","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:13:49Z","timestamp":1186740829000},"page":"402-415","source":"Crossref","is-referenced-by-count":10,"title":["Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Forster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niels","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans Ulrich","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,13]]},"reference":[{"key":"26_CR1","unstructured":"Ben-David, S.. (2000). Personal Communication."},{"key":"26_CR2","unstructured":"Ben-David, S., Eiron, N., & Simon, H.U. (2000). Limitations of learning via embeddings in Euclidean Hals-Spaces. The Fourteenth Annual Conference on Computational Learning Theory and The Fifth European Conference on Computational Learning Theory."},{"key":"26_CR3","unstructured":"Ben-David, S., Eiron, N., & Simon, H.U. (2000). Unpublished manuscript."},{"key":"26_CR4","first-page":"157","volume":"100","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M.K. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 100, 157\u2013184.","journal-title":"Journal of the ACM"},{"key":"26_CR5","volume-title":"An Introduction to Support Vector Machines","author":"N. Christianini","year":"2000","unstructured":"Christianini, N., & Shawe-Taylor, J. (2000). An Introduction to Support Vector Machines. Cambridge, United Kingdom: Cambridge University Press."},{"key":"26_CR6","unstructured":"Forster, J. (2001). A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity. Sixteenth Annual IEEE Conference on Computational Complexity."},{"key":"26_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1985","unstructured":"Horn, R.A., & Johnson, C.R. (1985). Matrix Analysis. Cambridge, United Kingdom: Cambridge University Press."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Kearns, M.J., & Vazirani, U.V. (1994). An Introduction to Computational Learning Theory. Cambridge, Massachusetts: Massachusetts Institute of Technology.","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(95)00005-4","volume":"156","author":"M. Krause","year":"1996","unstructured":"Krause, M. (1996). Geometric arguments yield better bounds for threshold circuits and distributed computing. Theoretical Computer Science, 156, 99\u2013117.","journal-title":"Theoretical Computer Science"},{"key":"26_CR10","first-page":"107","volume":"9","author":"W. Maass","year":"1992","unstructured":"Maass, W. & Turan, G. (1992). Lower Bound Methods and Separation Results for On-Line Learning Models. Machine Learning, 9, 107\u2013145.","journal-title":"Machine Learning"},{"key":"26_CR11","first-page":"615","volume":"12","author":"A.B. Novikoff","year":"1962","unstructured":"Novikoff, A.B. (1962). On convergence proofs on perceptrons. Symposium on the Mathematical Theory of Automata, 12, 615\u2013622. Polytechnic Institute of Brooklyn.","journal-title":"Symposium on the Mathematical Theory of Automata"},{"key":"26_CR12","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V. (1998). Statistical Learning Theory. New York: John Wiley & Sons, Inc."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., & Chervonenkis, A.Y. (1971). On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16, 264\u2013280.","journal-title":"Theory of Probability and its Applications"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44581-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T06:57:08Z","timestamp":1550732228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44581-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423430","9783540445814"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44581-1_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}