Feature-based Dividing Symbolic Time Series Representation for Streaming Data Processing

被引:3
作者
Zhan, Peng [1 ]
Hu, Yupeng [1 ]
Zhang, Qi [1 ]
Zheng, Jiecai [2 ]
Li, Xueqing [1 ]
机构
[1] Shandong Univ, Sch Software, Jinan, Shandong, Peoples R China
[2] Shandong Sprot Univ, Sch Sport Commun & Informat Technol, Jinan, Shandong, Peoples R China
来源
2018 NINTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY IN MEDICINE AND EDUCATION (ITME 2018) | 2018年
基金
国家高技术研究发展计划(863计划); 中国国家自然科学基金;
关键词
Symbolic Aggregate Approximation; Time Series; Dimensionality Reduction; Streaming Data Processing;
D O I
10.1109/ITME.2018.00184
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Along with the continuous development of information technology, massive numbers of detecting instruments or systems in various fields are continuously producing plenty number of streaming time series data. In recent years, many representation approaches for time series has been proposed with the main objective of dimensionality reduction to support various data mining algorithms in the domain of time series data processing. Symbolic Aggregate approXimation(SAX) is a major symbolic representation and dimensionality reduction algorithm which has been widely used in many application scenarios of time series data mining, such as motifs discovery, outlier detection, etc. In this paper, we propose a symbolic representation method of streaming time series based on VTPdiving with sliding window and a similarity measurement algorithm for the proposed representation method which lower bounding the Euclidean distance on the original data. Extensive experiments on different kinds of typical time series datasets have been conducted to demonstrate the advantages of our proposed method.
引用
收藏
页码:817 / 823
页数:7
相关论文
共 18 条
[1]  
Agrawal R., 1993, Foundations of Data Organization and Algorithms. 4th International Conference. FODO '93 Proceedings, P69
[2]  
Camerra A., 2010, Proceedings 2010 10th IEEE International Conference on Data Mining (ICDM 2010), P58, DOI 10.1109/ICDM.2010.124
[3]   Locally adaptive dimensionality reduction for indexing large time series databases [J].
Chakrabarti, K ;
Keogh, E ;
Mehrotra, S ;
Pazzani, M .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2002, 27 (02) :188-228
[4]   Haar wavelets for efficient similarity search of time-series: With and without time warping [J].
Chan, FKP ;
Fu, AWC ;
Yu, C .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2003, 15 (03) :686-705
[5]  
Chen Y., 2015, The UCR Time Series Classification Archive
[6]  
Jin S., 2008, ISAX INDEXING MINING
[7]   On the need for time series data mining benchmarks: A survey and empirical demonstration [J].
Keogh, E ;
Kasetty, S .
DATA MINING AND KNOWLEDGE DISCOVERY, 2003, 7 (04) :349-371
[8]   Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases [J].
Eamonn Keogh ;
Kaushik Chakrabarti ;
Michael Pazzani ;
Sharad Mehrotra .
Knowledge and Information Systems, 2001, 3 (3) :263-286
[9]  
Keogh E.J., 2004, Data Mining in Time Series Databases, DOI DOI 10.1142/SMPAI
[10]  
[李海林 Li Hailin], 2011, [模式识别与人工智能, Pattern Recognition and Artificial Intelligence], V24, P665