{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T11:43:23Z","timestamp":1750765403040,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729259"},{"type":"electronic","value":"9783540729273"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72927-3_24","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:30:27Z","timestamp":1181615427000},"page":"323-335","source":"Crossref","is-referenced-by-count":4,"title":["How Good Is a Kernel When Used as a Similarity Measure?"],"prefix":"10.1007","author":[{"given":"Nathan","family":"Srebro","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Balcan, M.F., Blum, A.: On a theory of learning with similarity functions. In: Proceedings of the 23rd International Conference on Machine Learning (2006)","key":"24_CR1","DOI":"10.1145\/1143844.1143854"},{"unstructured":"Jaakkola, T.S., Haussler, D.: Exploiting generative models in discriminative classifiers. In: Advances in Neural Information Processing Systems 11. MIT Press (1999)","key":"24_CR2"},{"doi-asserted-by":"crossref","unstructured":"Viswanathan, S., Smola, A.J.: Fast kernels for string and tree matching. In: Advances in Neural Information Processing Systems 15. MIT Press (2003)","key":"24_CR3","DOI":"10.7551\/mitpress\/4057.003.0008"},{"doi-asserted-by":"crossref","unstructured":"Smola, A.J., Sch\u00f6lkopf, B.: Learning with Kernels. MIT Press (2002)","key":"24_CR4","DOI":"10.7551\/mitpress\/4175.001.0001"},{"doi-asserted-by":"crossref","unstructured":"McAllester, D.: Simplified PAC-bayesian margin bounds. In: Proceedings of the 16th Annual Conference on Learning Theory (2003)","key":"24_CR5","DOI":"10.1007\/978-3-540-45167-9_16"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1162\/153244303321897690","volume":"3","author":"P.L. Bartlett","year":"2003","unstructured":"Bartlett, P.L., Mendelson, S.: Rademacher and gaussian complexities: risk bounds and structural results. J. Mach. Learn. Res.\u00a03, 463\u2013482 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R. Hettich","year":"1993","unstructured":"Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods, and applications. SIAM Rev.\u00a035, 380\u2013429 (1993)","journal-title":"SIAM Rev."}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72927-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:52:40Z","timestamp":1737093160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72927-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729259","9783540729273"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72927-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}