State-space dynamics distance for clustering sequential data

From MaRDI portal
Publication:632582

DOI10.1016/J.PATCOG.2010.11.018zbMATH Open1209.68455arXiv1004.1982OpenAlexW2134745505MaRDI QIDQ632582FDOQ632582


Authors: Darío García-García, Emilio Parrado-Hernández, Fernando Diaz-de-Maria Edit this on Wikidata


Publication date: 25 March 2011

Published in: Pattern Recognition (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1004.1982




Recommendations




Cites Work


Cited In (6)

Uses Software





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)