Simplification and hierarchical representations of mixtures of exponential families

Authors:
V. Garcia;F. Nielsen
Affiliations:
ícole polytechnique, Laboratoire d'informatique, 91128 Palaiseau Cedex, France;ícole polytechnique, Laboratoire d'informatique, 91128 Palaiseau Cedex, France and Sony Computer Science Laboratories Inc., 3-14-13 Higashi Gotanda, Shinagawa-Ku, 141-0022 Tokyo, Japan
Venue:
Signal Processing
Year:
2010

Citing 9
Cited 1

Cluster ensembles --- a knowledge reuse framework for combining multiple partitions

The Journal of Machine Learning Research
An Efficient Image Similarity Measure Based on Approximations of KL-Divergence Between Two Gaussian Mixtures

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Clustering documents with an exponential-family approximation of the Dirichlet compound multinomial distribution

ICML '06 Proceedings of the 23rd international conference on Machine learning
Clustering with Bregman Divergences

The Journal of Machine Learning Research
k-means++: the advantages of careful seeding

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Simplifying Mixture Models Using the Unscented Transform

IEEE Transactions on Pattern Analysis and Machine Intelligence
Sided and symmetrized Bregman centroids

IEEE Transactions on Information Theory
A new closed-form information metric for shape analysis

MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
Least squares quantization in PCM

IEEE Transactions on Information Theory

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.08

Visualization

Abstract

A mixture model in statistics is a powerful framework commonly used to estimate the probability measure function of a random variable. Most algorithms handling mixture models were originally specifically designed for processing mixtures of Gaussians. However, other distributions such as Poisson, multinomial, Gamma/Beta have gained interest in signal processing in the past decades. These common distributions are unified in the framework of exponential families in statistics. In this paper, we present three generic clustering algorithms working on arbitrary mixtures of exponential families: the Bregman soft clustering, the Bregman hard clustering, and the Bregman hierarchical clustering. These algorithms allow one to estimate a mixture model from observations, to simplify such a mixture model, and to automatically learn the ''optimal'' number of components in a simplified mixture model according to a resolution parameter. In addition, we present jMEF, an open source Java^T^M library allowing users to create, process and manage mixtures of exponential families. In particular, jMEF includes the three aforementioned Bregman clustering algorithms.