On approximating the smallest enclosing Bregman Balls

Authors:
Frank Nielsen;Richard Nock
Affiliations:
Sony Computer Science Laboratories Inc., Tokyo, Japan;University of Antilles-Guyanem, Martinique, France
Venue:
Proceedings of the twenty-second annual symposium on Computational geometry
Year:
2006

Citing 3
Cited 4

Smaller core-sets for balls

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Clustering with Bregman Divergences

The Journal of Machine Learning Research
Fitting the smallest enclosing bregman ball

ECML'05 Proceedings of the 16th European conference on Machine Learning

Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Similarity search on Bregman divergence: towards non-metric indexing

Proceedings of the VLDB Endowment
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

ACM Transactions on Algorithms (TALG)
Pattern learning and recognition on statistical manifolds: an information-geometric review

SIMBAD'13 Proceedings of the Second international conference on Similarity-Based Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a generalization of Bǎdoiu and Clarkson's algorithm [3] for computing a (1+ε)-approximation of the smallest enclosing ball of a point set equipped with a Bregman divergence as a distortion measure.