Abstract
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learning, with the advent of one class classification. We propose two theoretically founded generalizations to arbitrary Bregman divergences, of a recent popular smallest enclosing ball approximation algorithm for Euclidean spaces coined by Bădoiu and Clarkson in 2002.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bădoiu, M., Clarkson, K.-L.: Optimal core-sets for balls (2002) (manuscript)
Banerjee, A., Merugu, S., Dhillon, I., Ghosh, J.: Clustering with bregman divergences. In: Proc. of the 4th SIAM International Conference on Data Mining, pp. 234–245 (2004)
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 Comp. Math. and Math. Phys. 7, 200–217 (1967)
Burges, C.J.C.: A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 2, 121–167 (1998)
Crammer, K., Chechik, G.: A needle in a haystack: local one-class optimization. In: Proc. of the 21st International Conference on Machine Learning (2004)
Gentile, C., Warmuth, M.: Proving relative loss bounds for on-line learning algorithms using Bregman divergences. In: Tutorials of the 13th International Conference on Computational Learning Theory (2000)
Tax, D., Duin, R.: Support Vector Domain Description. Pattern Recognition Letters 20, 1191–1199 (1999)
Tsang, I.W., Kwok, J.T., Cheung, P.-M.: Core Vector Machines: fast SVM training on very large datasets. Journal of Machine Learning Research 6, 363–392 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nock, R., Nielsen, F. (2005). Fitting the Smallest Enclosing Bregman Ball. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds) Machine Learning: ECML 2005. ECML 2005. Lecture Notes in Computer Science(), vol 3720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564096_65
Download citation
DOI: https://doi.org/10.1007/11564096_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29243-2
Online ISBN: 978-3-540-31692-3
eBook Packages: Computer ScienceComputer Science (R0)