Parameter Estimation in Finite Mixture Models by Regularized Optimal Transport: A Unified Framework for Hard and Soft Clustering

11/12/2017
by   Arnaud Dessein, et al.
0

In this short paper, we formulate parameter estimation for finite mixture models in the context of discrete optimal transportation with convex regularization. The proposed framework unifies hard and soft clustering methods for general mixture models. It also generalizes the celebrated k-means and expectation-maximization algorithms in relation to associated Bregman divergences when applied to exponential family mixture models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2013

A Variational Approximations-DIC Rubric for Parameter Estimation and Mixture Model Selection Within a Family Setting

Mixture model-based clustering has become an increasingly popular data a...
research
12/09/2020

Conjugate Mixture Models for Clustering Multimodal Data

The problem of multimodal clustering arises whenever the data are gather...
research
07/29/2015

Context-aware learning for finite mixture models

This work introduces algorithms able to exploit contextual information i...
research
03/30/2017

The Informativeness of k-Means and Dimensionality Reduction for Learning Mixture Models

The learning of mixture models can be viewed as a clustering problem. In...
research
03/23/2012

k-MLE: A fast algorithm for learning statistical mixture models

We describe k-MLE, a fast and efficient local search algorithm for learn...
research
09/13/2022

Addressing overfitting in spectral clustering via a non-parametric bootstrap

Finite mixture modelling is a popular method in the field of clustering ...
research
05/19/2018

Estimation of Non-Normalized Mixture Models and Clustering Using Deep Representation

We develop a general method for estimating a finite mixture of non-norma...

Please sign up or login with your details

Forgot password? Click here to reset