A Computationally Compact Divergence Measure for Speech Processing
IEEE Transactions on Pattern Analysis and Machine Intelligence
A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Natural gradient works efficiently in learning
Neural Computation
Additive models, boosting, and inference for generalized divergences
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Parallel Optimization: Theory, Algorithms and Applications
Parallel Optimization: Theory, Algorithms and Applications
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Divergence function, duality, and convex analysis
Neural Computation
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
The Journal of Machine Learning Research
Means of Positive Numbers and Matrices
SIAM Journal on Matrix Analysis and Applications
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Clustering with Bregman Divergences
The Journal of Machine Learning Research
A Unified Continuous Optimization Framework for Center-Based Clustering Methods
The Journal of Machine Learning Research
Perceptual and objective detection of discontinuities in concatenative speech synthesis
ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02
k-means++: the advantages of careful seeding
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Integration of Stochastic Models by Minimizing α-Divergence
Neural Computation
On the smallest enclosing information disk
Information Processing Letters
Matrix Nearness Problems with Bregman Divergences
SIAM Journal on Matrix Analysis and Applications
Proceedings of the 25th international conference on Machine learning
Modeling musical anticipation: from the time of music to the music of time
Modeling musical anticipation: from the time of music to the music of time
Bregman Divergences and Surrogates for Learning
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Fermat--Weber center of a convex object
Computational Geometry: Theory and Applications
Learning distance functions for image retrieval
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Fitting the smallest enclosing bregman ball
ECML'05 Proceedings of the 16th European conference on Machine Learning
On the optimality of conditional expectation as a Bregman predictor
IEEE Transactions on Information Theory
On Divergences and Informations in Statistics and Information Theory
IEEE Transactions on Information Theory
Wavelet-based texture retrieval using generalized Gaussian density and Kullback-Leibler distance
IEEE Transactions on Image Processing
α-divergence is unique, belonging to both f-divergence and Bregman divergence classes
IEEE Transactions on Information Theory
Geometric representations for multiple documents
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Neurocomputing
Divergence-based vector quantization
Neural Computation
Approximate bregman near neighbors in sublinear time: beyond the triangle inequality
Proceedings of the twenty-eighth annual symposium on Computational geometry
Pattern learning and recognition on statistical manifolds: an information-geometric review
SIMBAD'13 Proceedings of the Second international conference on Similarity-Based Pattern Recognition
Hi-index | 754.90 |
In this paper, we generalize the notions of centroids (and barycenters) to the broad class of information-theoretic distortion measures called Bregman divergences. Bregman divergences form a rich and versatile family of distances that unifies quadratic Euclidean distances with various well-known statistical entropic measures. Since besides the squared Euclidean distance, Bregman divergences are asymmetric, we consider the left-sided and right-sided centroids and the symmetrized centroids as minimizers of average Bregman distortions. We prove that all three centroids are unique and give closed-form solutions for the sided centroids that are generalized means. Furthermore, we design a provably fast and efficient arbitrary close approximation algorithm for the symmetrized centroid based on its exact geometric characterization. The geometric approximation algorithm requires only to walk on a geodesic linking the two left/right-sided centroids. We report on our implementation for computing entropic centers of image histogram clusters and entropic centers of multivariate normal distributions that are useful operations for processing multimedia information and retrieval. These experiments illustrate that our generic methods compare favorably with former limited ad hoc methods.