{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:14:46Z","timestamp":1740374086403,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407201"},{"type":"electronic","value":"9783540451679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_29","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:10:53Z","timestamp":1279840253000},"page":"388-402","source":"Crossref","is-referenced-by-count":2,"title":["Learning Algorithms for Enclosing Points in Bregmanian Spheres"],"prefix":"10.1007","author":[{"given":"Koby","family":"Crammer","sequence":"first","affiliation":[]},{"given":"Yoram","family":"Singer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K. Azoury","year":"2001","unstructured":"Azoury, K., Warmuth, M.: Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning\u00a043, 211\u2013246 (2001)","journal-title":"Machine Learning"},{"issue":"2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/18.661502","volume":"44","author":"P.L. Bartlett","year":"1998","unstructured":"Bartlett, P.L.: The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network. IEEE Transactions on Information Theory\u00a044(2), 525\u2013536 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"29_CR3","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":"29_CR4","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)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Collins, M., Dasgupta, S., Schapire, R.: A generalization of principal component analysis to the exponential family. In: Adv. in NIPS, vol.\u00a013 (2001)","DOI":"10.7551\/mitpress\/1120.003.0084"},{"issue":"2\/3","key":"29_CR6","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":"29_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. of the Royal Stat. Soc. Ser. B 39, 1\u201338 (1977)","journal-title":"J. of the Royal Stat. Soc. Ser. B"},{"key":"29_CR8","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, 2nd edn. John Wiley, Chichester (1987)","edition":"2"},{"key":"29_CR9","unstructured":"Gentile, C., Warmuth, M.: Linear hinge loss and average margin. In: Advances in Neural Information Processing Systems, vol.\u00a010 (1998)"},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1017938623079","volume":"45","author":"J. Kivinen","year":"2001","unstructured":"Kivinen, J., Warmuth, M.K.: Relative loss bounds for multidimensional regression problems. Journal of Machine Learning\u00a045(3), 301\u2013329 (2001)","journal-title":"Journal of Machine Learning"},{"key":"29_CR11","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in Neural Information Processing Systems, vol.\u00a013, pp. 556\u2013562 (2000)"},{"issue":"3","key":"29_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"},{"issue":"5","key":"29_CR13","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R.E. Schapire","year":"1998","unstructured":"Schapire, R.E., Freund, Y., Bartlett, P., Lee, W.S.: Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics\u00a026(5), 1651\u20131686 (1998)","journal-title":"The Annals of Statistics"},{"key":"29_CR14","unstructured":"Sch\u00f6lkopf, B., Burges, C., Vapnik, V.N.: Extracting support data for a given task. In: Fayyad, U.M., Uthurusamy, R. (eds.) 1st International Conference on Knowledge Discovery & Data Mining (KDD). AAAI Press, Menlo Park (1995)"},{"issue":"7","key":"29_CR15","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1162\/089976601750264965","volume":"13","author":"B. Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B., Platt, J., Shawe-Taylor, J., Smola, A.J., Williamson, R.C.: Estimating the support of a high-dimensional distribution. Neural Computation\u00a013(7), 1443\u20131472 (2001)","journal-title":"Neural Computation"},{"key":"29_CR16","unstructured":"Sha, F., Saul, L.K., Lee, D.D.: Multiplicative updates for nonnegative quadratic programming in support vector machines. In: Becker, S., Thrun, S., Obermayer, K. (eds.) Advances in Neural Information Processing Systems, vol.\u00a015 (2002)"},{"key":"29_CR17","unstructured":"Tax, D.M.J.: One-class classification; Concept-learning in the absence of counterexamples. PhD thesis, Delft University of Technology (2001)"},{"key":"29_CR18","unstructured":"Tax, D.M.J., Duin, R.P.W.: Data domain description using support vectors. In: Verleysen, M. (ed.) Proceedings of the European Symposium on Artificial Neural Networks, April 1999, pp. 251\u2013256 (1999)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T07:35:44Z","timestamp":1740296144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}