| 基于符号化表示的时间序列频繁子序列挖掘 |
| |
| 引用本文： | 胡晓琳,陈晓云.基于符号化表示的时间序列频繁子序列挖掘[J].计算机工程,2008,34(10):61-63. |
| |
| 作者姓名： | 胡晓琳 陈晓云 |
| |
| 作者单位： | 福州大学数学与计算机科学学院,福州,350002;福州大学数学与计算机科学学院,福州,350002 |
| |
| 摘 要： | 提出一种新的基于符号化表示的时间序列频繁子序列的挖掘算法。利用基于PAA的分段线性表示法进行降维，通过在高斯分布下设置断点，实现时间序列符号化表示，利用投影数据库挖掘频繁子序列。该算法简单、新颖，运行快速，简化了子序列支持数的计算。
|
| 关 键 词： | 数据挖掘 频繁子序列 时间序列 符号化 |
| 文章编号： | 1000-3428(2008)10-0061-03 |
| 修稿时间： | 2007年7月22日 |
Frequent Subsequence Mining in Time Series Based on Symbolic Representation |
| |
| HU Xiao-lin,CHEN Xiao-yun.Frequent Subsequence Mining in Time Series Based on Symbolic Representation[J].Computer Engineering,2008,34(10):61-63. |
| |
| Authors: | HU Xiao-lin CHEN Xiao-yun |
| |
| Affiliation: | (Department of Mathematics and Computer Science, Fuzhou University, Fuzhou 350002) |
| |
| Abstract: | This paper proposes a new algorithm for mining frequent subsequence in time series based on symbolic representation. A dimensionality reduction technique called PAA linear segment representation is used. Under the Gaussian distribution, several breakpoints are set. The projected database is built to mine the frequent subsequence. The algorithm is simple and new, runs so fast, and reduces the cost of computing support counts of subsequences. |
| |
| Keywords: | data mining frequent subsequence time series symbolic |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
