Classification automatique de données temporelles en classes ordonnées

12/25/2013
by   Faicel Chamroukhi, et al.
0

This paper proposes a method of segmenting temporal data into ordered classes. It is based on mixture models and a discrete latent process, which enables to successively activates the classes. The classification can be performed by maximizing the likelihood via the EM algorithm or by simultaneously optimizing the model parameters and the partition by the CEM algorithm. These two algorithms can be seen as alternatives to Fisher's algorithm, which improve its computing time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/25/2013

Piecewise regression mixture for simultaneous functional data clustering and optimal segmentation

This paper introduces a novel mixture model-based approach for simultane...
research
12/08/2020

A Bayesian Fisher-EM algorithm for discriminative Gaussian subspace clustering

High-dimensional data clustering has become and remains a challenging ta...
research
10/26/2018

From the EM Algorithm to the CM-EM Algorithm for Global Convergence of Mixture Models

The Expectation-Maximization (EM) algorithm for mixture models often res...
research
10/01/2018

Singularity, Misspecification, and the Convergence Rate of EM

A line of recent work has characterized the behavior of the EM algorithm...
research
12/13/2018

Automatic Differentiation in Mixture Models

In this article, we discuss two specific classes of models - Gaussian Mi...
research
02/10/2023

Efficient and Accurate Learning of Mixtures of Plackett-Luce Models

Mixture models of Plackett-Luce (PL) – one of the most fundamental ranki...
research
02/19/2023

Classification via two-way comparisons

Given a weighted, ordered query set Q and a partition of Q into classes,...

Please sign up or login with your details

Forgot password? Click here to reset