.png){kind=icon}
返回
Mining categorical sequences from data using a hybrid clustering method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2013.11.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The identification of different dynamics in sequential data has become an every day need in scientific fields such as marketing, bioinformatics, finance, or social sciences. Contrary to cross-sectional or static data, this type of observations (also known as stream data, temporal data, longitudinal data or repeated measures) are more challenging as one has to incorporate data dependency in the clustering process. In this research we focus on clustering categorical sequences. The method proposed here combines model-based and heuristic clustering. In the first step, the categorical sequences are transformed by an extension of the hidden Markov model into a probabilistic space, where a symmetric Kullback-Leibler distance can operate. Then, in the second step, using hierarchical clustering on the matrix of distances, the sequences can be clustered. This paper illustrates the enormous potential of this type of hybrid approach using a synthetic data set as well as the well-known Microsoft dataset with website users search patterns and a survey on job career dynamics. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Data mining
Sequential data
Hidden Markov models
Clustering
Categorical data
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
A model for real-time failure prognosis based on hidden Markov model and belief rule base基于隐马尔可夫模型和置信规则库的实时故障预测模型
OAAI
OAAI分享收藏分享收藏
查看更多内容