{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:49:32Z","timestamp":1760597372286},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042737"},{"type":"electronic","value":"9783642042744"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04274-4_91","type":"book-chapter","created":{"date-parts":[[2009,9,11]],"date-time":"2009-09-11T15:34:34Z","timestamp":1252683274000},"page":"884-893","source":"Crossref","is-referenced-by-count":33,"title":["Learning SVMs from Sloppily Labeled Data"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Stempfel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liva","family":"Ralaivola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"91_CR1","first-page":"463","volume":"3","author":"P.L. Bartlett","year":"2002","unstructured":"Bartlett, P.L., Mendelson, S.: Rademacher and gaussian complexities: Risk bounds and structural results. J. of Machine Learning Research\u00a03, 463\u2013482 (2002)","journal-title":"J. of Machine Learning Research"},{"key":"91_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Mitchell, T.: Combining Labeled and Unlabeled Data with Co-Training. In: Proc. of the 11th Conf. on Computational Learning Theory, pp. 92\u2013100 (1998)","DOI":"10.1145\/279943.279962"},{"issue":"5","key":"91_CR3","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1162\/neco.2007.19.5.1155","volume":"19","author":"O. Chapelle","year":"2007","unstructured":"Chapelle, O.: Training a support vector machine in the primal. Neural Comput.\u00a019(5), 1155\u20131178 (2007)","journal-title":"Neural Comput."},{"issue":"6","key":"91_CR4","first-page":"673","volume":"20","author":"C. Magnan","year":"2006","unstructured":"Magnan, C.: Asymmetrical Semi-Supervised Learning and Prediction of Disulfide Connectivity in Proteins. RIA, New Methods in Machine Learning: Theory and applications\u00a020(6), 673\u2013695 (2006)","journal-title":"RIA, New Methods in Machine Learning: Theory and applications"},{"key":"91_CR5","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Survey in Combinatorics, pp. 148\u2013188 (1989)","DOI":"10.1017\/CBO9781107359949.008"},{"key":"91_CR6","volume-title":"Learning with Kernels, Support Vector Machines, Regularization, Optimization and Beyond","author":"B. Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., Smola, A.J.: Learning with Kernels, Support Vector Machines, Regularization, Optimization and Beyond. MIT University Press, Cambridge (2002)"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks \u2013 ICANN 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04274-4_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T18:01:30Z","timestamp":1552154490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04274-4_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042737","9783642042744"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04274-4_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}