State-space dynamics distance for clustering sequential data

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

Emilio Parrado-Hernández, Fernando Diaz-de-Maria, Darío García-García

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

zbMATH Keywords

clusteringhidden Markov modelssequential data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Cites Work

• Dynamic programming algorithm optimization for spoken word recognition
• Clustering of time series data -- a survey
• Structural, Syntactic, and Statistical Pattern Recognition
• Bayesian clustering by dynamics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• A hierarchical framework for state-space matrix inference and clustering

Uses Software

• UCI-ml
• PRMLT

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)