arrow
Return

State-space dynamics distance for clustering sequential data

delete2011-05-01
delete8
delete
OA
AI
E
Emilio Parrado-Hernández
F
Fernando Díaz-de-María
DOI:10.1016/j.patcog.2010.11.018delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

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

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

U
Universidad Carlos III de Madrid
Scholars:
5.5K
Papers: 5.7K
Citations: 4.5K
Cited Papers

Cited Papers

Bayesian clustering by dynamics
err2002-01-01
err126
errOAAI
errRamoni, M; Sebastiani, P; Cohen, P
errShare
errSave
researcher View more