{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T23:43:55Z","timestamp":1747439035561},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667483"},{"type":"electronic","value":"9783540467694"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46769-6_21","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T07:42:39Z","timestamp":1172648559000},"page":"252-263","source":"Crossref","is-referenced-by-count":9,"title":["A Note on Support Vector Machine Degeneracy"],"prefix":"10.1007","author":[{"given":"Ryan","family":"Rifkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Pontil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Verri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,19]]},"reference":[{"key":"21_CR1","volume-title":"Data Mining and Knowledge Discovery","author":"C. Burges","year":"1998","unstructured":"C. Burges. A tutorial on support vector machines for pattern recognition. In Data Mining and Knowledge Discovery. Kluwer Academic Publishers, Boston, 1998. (Volume 2)."},{"key":"21_CR2","first-page":"1","volume":"20","author":"C. Cortes","year":"1995","unstructured":"C. Cortes and V. Vapnik. Support vector networks. Machine Learning, 20:1\u201325, 1995.","journal-title":"Machine Learning"},{"key":"21_CR3","unstructured":"E. Osuna. Support Vector Machines: Training and Applications. PhD thesis, Massachusetts Institute of Technology, 1998."},{"key":"21_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness W. Freeman and Company, San Francisco, 1979."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46769-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T22:20:02Z","timestamp":1550269202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46769-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667483","9783540467694"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-46769-6_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}