arrow
返回

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
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

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.
Keyword:
Sequential data
Clustering
Hidden Markov models
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

U
Universidad Carlos III de Madrid
学者数:
5.5K
论文数: 5.7K
被引数: 4.5K
引用论文

引用论文

Bayesian clustering by dynamics
err2002-01-01
err126
errOAAI
errRamoni, M; Sebastiani, P; Cohen, P
err分享
err收藏
学者 查看更多内容