Return
State-space dynamics distance for clustering sequential data
DOI:10.1016/j.patcog.2010.11.018.png)
Abstract
En 中文
This paper proposes a novel similarity measure for clustering sequential data. We first construct a common state space by training a single probabilistic model with all the sequences in order to get a unified representation for the dataset. Then, distances are obtained attending to the transition matrices induced by each sequence in that state space. This approach solves some of the usual overfitting and scalability issues of the existing semi-parametric techniques that rely on training a model for each sequence. Empirical studies on both synthetic and real-world datasets illustrate the advantages of the proposed similarity measure for clustering sequences. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Sequential data
Clustering
Hidden Markov models
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
A TUTORIAL ON HIDDEN MARKOV-MODELS AND SELECTED APPLICATIONS IN SPEECH RECOGNITION
PROCEEDINGS OF THE IEEE
IF25.9
Secretory patterns of LH and FSH during development and hypothalamic and hypophysial characteristics following development of steroid-induced ovarian follicular cysts in dairy cattle
Reproduction
IF0

