State-space dynamics distance for clustering sequential data
From MaRDI portal
Publication:632582
Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 2090270 (Why is no real title available?)
- scientific article; zbMATH DE number 3103174 (Why is no real title available?)
- Bayesian clustering by dynamics
- Clustering of time series data -- a survey
- Dynamic programming algorithm optimization for spoken word recognition
- Pattern recognition and machine learning.
- Regularization on graphs with function-adapted diffusion processes
- Structural, Syntactic, and Statistical Pattern Recognition
Cited in
(6)- scientific article; zbMATH DE number 2090270 (Why is no real title available?)
- scientific article; zbMATH DE number 2013259 (Why is no real title available?)
- A hierarchical framework for state-space matrix inference and clustering
- On measuring similarity for sequences of itemsets
- Symbolic pattern recognition for sequential data
- scientific article; zbMATH DE number 2101273 (Why is no real title available?)
This page was built for publication: State-space dynamics distance for clustering sequential data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632582)