Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Song, Weia; 1; * | Wang, Zhiguangb; 1 | Zhang, Fanc | Ye, Yangdonga | Fan, Minga
Affiliations: [a] School of Information Engineering, Zhengzhou University, Zhengzhou 450001, Henan, China | [b] Deparment of Computer Science, University of Maryland, Baltimore County, MD 21250, USA | [c] School of Information Engineering, North China University of Water Resources and Electric Power, Zhengzhou 450046, Henan, China
Correspondence: [*] Corresponding author: Wei Song, School of Information Engineering, Zhengzhou University, Zhengzhou 450001, Henan, China. E-mail:iewsong@zzu.edu.cn
Note: [1] These authors contribute equally.
Abstract: Symbolic Aggregate approximation (SAX) has been the de facto standard representation methods for knowledge discovery in time series on a number of tasks and applications. So far, very little work has been done in empirically investigating the intrinsic properties and statistical mechanics in SAX words. In this paper, we applied several statistical measurements and proposed a new statistical measurement, i.e. information embedding cost (IEC) to analyze the statistical behaviors of the symbolic dynamics. Our experiments on the benchmark datasets and the clinical signals demonstrate that SAX can always reduce the complexity while preserving the core information embedded in the original time series with significant embedding efficiency, as well as robust to missing values and noise. Our proposed IEC score provide a priori to determine if SAX is adequate for specific dataset, which can be generalized to evaluate other symbolic representations. Our work provides an analytical framework with several statistical tools to analyze, evaluate and further improve the symbolic dynamics for knowledge discovery in time series.
Keywords: SAX, knowledge discovery in time series, information embedding cost, permutation entropy, symbolic complexity
DOI: 10.3233/IDA-150351
Journal: Intelligent Data Analysis, vol. 21, no. 1, pp. 135-150, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl