Fitting the Smallest Enclosing Bregman Ball

作者: Richard Nock , Frank Nielsen

DOI: 10.1007/11564096_65

关键词: Support vector machineOne-class classificationEuclidean geometryCombinatoricsBregman divergenceApproximation algorithmBall (mathematics)Euclidean spaceSupport pointMathematics

摘要: Finding a point which minimizes the maximal distortion with respect to dataset is an important estimation problem that has recently received growing attentions in machine learning, advent of one class classification. We propose two theoretically founded generalizations arbitrary Bregman divergences, recent popular smallest enclosing ball approximation algorithm for Euclidean spaces coined by Bădoiu and Clarkson 2002.

参考文章(7)
Mihai Bădoiu, Kenneth L. Clarkson, Optimal core-sets for balls Computational Geometry: Theory and Applications. ,vol. 40, pp. 14- 22 ,(2008) , 10.1016/J.COMGEO.2007.04.002
Arindam Banerjee, Srujana Merugu, Inderjit S Dhillon, Joydeep Ghosh, John Lafferty, Clustering with Bregman Divergences siam international conference on data mining. ,vol. 6, pp. 1705- 1749 ,(2005) , 10.1137/1.9781611972740.22
David M.J Tax, Robert P.W Duin, Support vector domain description Pattern Recognition Letters. ,vol. 20, pp. 1191- 1199 ,(1999) , 10.1016/S0167-8655(99)00087-2
Koby Crammer, Gal Chechik, A needle in a haystack Twenty-first international conference on Machine learning - ICML '04. pp. 26- ,(2004) , 10.1145/1015330.1015399
Christopher J.C. Burges, A Tutorial on Support Vector Machines for Pattern Recognition Data Mining and Knowledge Discovery. ,vol. 2, pp. 121- 167 ,(1998) , 10.1023/A:1009715923555
Ivor W Tsang, James T Kwok, Pak-Ming Cheung, Nello Cristianini, Core Vector Machines: Fast SVM Training on Very Large Data Sets Journal of Machine Learning Research. ,vol. 6, pp. 363- 392 ,(2005) , 10.5555/1046920.1058114