摘要
提出一种新的基于符号化表示的时间序列频繁子序列的挖掘算法。利用基于PAA的分段线性表示法进行降维,通过在高斯分布下设置断点,实现时间序列符号化表示,利用投影数据库挖掘频繁子序列。该算法简单、新颖,运行快速,简化了子序列支持数的计算。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第10期61-63,共3页
Computer Engineering
基金
福建省自然科学基金资助项目(S0650013)
