• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science

Previous Articles     Next Articles

A study on complexity and relative intrinsic properties of
SAX representation method based on permutation entropy

SONG Wei1,SONG Yu1,ZHANG Fan2,FAN Ming1,YE Yangdong1   

  1. (1.School of Information Engineering,Zhengzhou University,Zhengzhou 450001;
    2.School of Information Engineering,North China University
    of Water Resources and Electric Power,Zhengzhou 450046,China)
     
  • Received:2017-09-17 Revised:2018-01-24 Online:2018-07-25 Published:2018-07-25

Abstract:

Symbolic aggregate approximation (SAX) is a typical and effective symbolic feature representation method. At present, there are many practical applications of the SAX method, but the analysis of its intrinsic properties, such as complexity, information loss, correlation and periodicity, is relatively rare. In this paper, we apply the permutation entropy to analyze the complexity and statistics characteristics of the relative intrinsic properties of the SAX method. Experiments on benchmark datasets and real clinical data show that the SAX method can significantly reduce the complexity of feature representation and alleviate the redundancy effect while preserving the inherent correlation measured by the autocorrelation function ACF. This work can provide support for the SAX method and its further application, and provide analytical and statistical tools for the design and evaluation of new symbolic representation methods.
 
 

Key words: permutation entropy, symbolic aggregate approximation, intrinsic properties;complexity, correlation