Fitting the smallest enclosing bregman ball

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3720 LNAI, Issue , 2005, Pages 649-656

  Nock, Richard ^a   Nielsen, Prank ^b  

^a UNIVERSITÉ DES ANTILLES ET DE LA GUYANE   (France)

^b SONY COMPUTER SCIENCE LABORATORIES INC   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BREGMAN BALL; BREGMAN DIVERGENCES; CLASS CLASSIFICATION;

ALGORITHMS; APPROXIMATION THEORY; CLASSIFICATION (OF INFORMATION); COMPUTATION THEORY; LEARNING SYSTEMS; PARAMETER ESTIMATION; PROBLEM SOLVING;

DATABASE SYSTEMS;

EID: 33646435539     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564096_65     Document Type: Conference Paper

References (8)

1. M. Bǎdoiu and K.-L. Clarkson. Optimal core-sets for balls, 2002. Manuscript.
2. th SIAM International Conference on Data Mining, pages 234-245, 2004.
3. L. M. Bregman. 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.
4. C. J. C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2:121-167, 1998.
5. th International Conference on Machine Learning, 2004.
6. th International Conference on Computational Learning Theory, 2000.
7. D. Tax and R. Duin. Support Vector Domain Description. Pattern Recognition Letters, 20:1191-1199, 1999.
8. I. W. Tsang, J. T. Kwok, and P.-M. Cheung. Core Vector Machines: fast SVM training on very large datasets. Journal of Machine Learning Research, 6:363-392, 2005.