{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:06:26Z","timestamp":1725559586761},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540265566"},{"type":"electronic","value":"9783540318927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11503415_4","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T22:16:38Z","timestamp":1279145798000},"page":"48-62","source":"Crossref","is-referenced-by-count":5,"title":["Loss Bounds for Online Category Ranking"],"prefix":"10.1007","author":[{"given":"Koby","family":"Crammer","sequence":"first","affiliation":[]},{"given":"Yoram","family":"Singer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K.S. Azoury","year":"2001","unstructured":"Azoury, K.S., Warmuth, M.W.: Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning\u00a043(3), 211\u2013246 (2001)","journal-title":"Machine Learning"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L.M. Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics\u00a07, 200\u2013217 (1967)","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"4_CR3","volume-title":"Parallel Optimization: Theory, Algorithms, and Applications","author":"Y. Censor","year":"1997","unstructured":"Censor, Y., Zenios, S.A.: Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, Oxford (1997)"},{"issue":"2\/3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1013912006537","volume":"47","author":"M. Collins","year":"2002","unstructured":"Collins, M., Schapire, R.E., Singer, Y.: Logistic regression, AdaBoost and Bregman distances. Machine Learning\u00a047(2\/3), 253\u2013285 (2002)","journal-title":"Machine Learning"},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Chichester (1991)"},{"unstructured":"Crammer, K.: Online Learning for Complex Categorial Problems. PhD thesis, Hebrew University of Jerusalem, (2005) (to appear)","key":"4_CR6"},{"unstructured":"Crammer, K., Dekel, O., Shalev-Shwartz, S., Singer, Y.: Online passive aggressive algorithms. In: Advances in Neural Information Processing Systems, vol.\u00a016 (2003)","key":"4_CR7"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1162\/153244303322533188","volume":"3","author":"K. Crammer","year":"2003","unstructured":"Crammer, K., Singer, Y.: A new family of online algorithms for category ranking. Jornal of Machine Learning Research\u00a03, 1025\u20131058 (2003)","journal-title":"Jornal of Machine Learning Research"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1162\/jmlr.2003.3.4-5.951","volume":"3","author":"K. Crammer","year":"2003","unstructured":"Crammer, K., Singer, Y.: Ultraconservative online algorithms for multiclass problems. Jornal of Machine Learning Research\u00a03, 951\u2013991 (2003)","journal-title":"Jornal of Machine Learning Research"},{"doi-asserted-by":"crossref","unstructured":"Elisseeff, A., Weston, J.: A kernel method for multi-labeled classification. Advances in Neural Information Processing Systems\u00a014 (2001)","key":"4_CR10","DOI":"10.7551\/mitpress\/1120.003.0092"},{"unstructured":"Gentile, C., Warmuth, M.: Linear hinge loss and average margin. In: Advances in Neural Information Processing Systems, vol.\u00a010 (1998)","key":"4_CR11"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R.E. Schapire","year":"1999","unstructured":"Schapire, R.E., Singer, Y.: Improved boosting algorithms using confidence-rated predictions. Machine Learning\u00a037(3), 1\u201340 (1999)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11503415_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T09:42:07Z","timestamp":1711618927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11503415_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265566","9783540318927"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11503415_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}