On approximating the smallest enclosing Bregman Balls

MaRDI QIDQ3601581zbMATH OpenFDO

Authors Richard Nock, Frank Nielsen

Publication date 10 February 2009

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Smallest enclosing spheres and Chernoff points in Bregman geometry
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• On the smallest enclosing information disk
• Computational Science and Its Applications – ICCSA 2004
• Learning algorithms for enclosing points in Bregmanian spheres.

Cited in

(11)

• Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
• Clustering in Hilbert's projective geometry: the case studies of the probability simplex and the elliptope of correlation matrices
• Smallest enclosing ball multidistance
• On the smallest enclosing information disk
• Smallest enclosing spheres and Chernoff points in Bregman geometry
• Learning algorithms for enclosing points in Bregmanian spheres.
• Approximating covering and minimum enclosing balls in hyperbolic geometry
• Inner Regularization of Log-Concave Measures and Small-Ball Estimates
• A comprehensive approach to mode clustering
• Computational Science and Its Applications – ICCSA 2004
• Fast Learning of Generalized Minimum Enclosing Ball for Large Datasets

This page was built for publication: On approximating the smallest enclosing Bregman Balls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601581)