期刊文献+

SAX结合Adaboost算法的时间序列分类问题

Research on Time Series Data Classification Combine SAX and AdaBoost Algorithm
下载PDF
导出
摘要 SAX是一种典型的符号化特征表示方法.该方法在时间序列特征表示中不仅可以有效地降维、降噪,而且具有简单、直观等特点.时间序列长度不一、特征表示过程中信息损失等问题的存在,使得常规的分类算法难以很好地完成分类任务.在对时间序列数据进行基于SAX符号化的BOP表示方法的基础上,提出了结合集成学习中AdaBoost算法进行分类的新方法,实验结果表明,该方法不仅能很好地处理SAX符号化表示中的信息损失问题,而且与已有方法相比,在分类准确度方面也有了显著的提高. Symbolic Aggregate approXimation (SAX) is a typical symbolic representation method, which is straight-for- ward and very simple, and it efficiently converts time series data to a symbolic representation with dimension reduction. The is- sues of time series data such as variable in length, and information lose during the representation, making many traditional clas- sification methods unable to apply directly. This paper focus on the SAX discretization method coupled with the Bag of Patterns (BOP) representation in classification task, and proposed the new approach by use AdaBoost Algorithm to remedy the informa- tion loss by SAX representation. The experimental results show that, the approach improved the classification accuracy obvi- ously.
出处 《河南师范大学学报(自然科学版)》 CAS 北大核心 2015年第3期155-160,共6页 Journal of Henan Normal University(Natural Science Edition)
基金 国家自然科学基金(61202207) 河南省教育厅科学技术研究重点项目(13A520453)
关键词 时间序列 分类 SAX BOP ADABOOST time series classification SAX BOP AdaBoost
  • 相关文献

参考文献16

  • 1Fu T. A review on time series data mining[J]. Engineering Applications of Artificial Intelligence, 2011,24 (1): 164-181.
  • 2李海林,郭崇慧.时间序列数据挖掘中特征表示与相似性度量研究综述[J].计算机应用研究,2013,30(5):1285-1291. 被引量:65
  • 3Lin J, Keogh E, Lonardi S, et al. A symbolic representation of time series, with implications for streaming algorithms[C]. Proc of the 8th ACM SIGMOD Workshop on Research issues in data mining and knowledge discovery(DMKD '03) ,San Diego,2003.
  • 4Lin J, Keogh E,Wei L, et al. Experiencing SAX: a novel symbolic representation of time series[J]. Data Mining and Knowledge Discover- y, 2007,15(2) : 107-144.
  • 5Junejo I, Aghbari Z. Using SAX representation for human action recognition[J]. Journal of Visual Communication and Image Represen ration,2012,23(6) : 853-861.
  • 6Afroni M, Sutanto D, Stirling D. Analysis of Nonstationary Power-Quality Waveforms Using Iterative Hilbert Huang Transform and SAX Algorithm[J]. IEEE Transactions on Power Delivery, 2013,28(4) : 2134-2144.
  • 7Oates T,Mackenzie C,Stein D,et al. Exploiting Representational Diversity for Tirne Series Classification[C]. Proc of llth Int Conf on Machine Learning and Applications(ICMLA '12), Boca Raton, 2012.
  • 8Freund Y,Schapire R. A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting[J]. Journal of Computer and System Sciences, 1997, 55(1) : 119-139.
  • 9Keogh E, Pazzani M. Derivative dynamic time warping[-C]. Proc of 1st Int Conf on Data Mining, Chicago,2001.
  • 10Chen L,Ng R. On the marriage of lp-norms and edit distance[C]. Proe of 30th Int Conf on Very Large Data Bases(VLDB 04), Morgan Kaufmann,2004.

二级参考文献76

  • 1李爱国,覃征.在线分割时间序列数据[J].软件学报,2004,15(11):1671-1679. 被引量:27
  • 2肖辉,胡运发.基于分段时间弯曲距离的时间序列挖掘[J].计算机研究与发展,2005,42(1):72-78. 被引量:59
  • 3李爱国,覃征.大规模时间序列数据库降维及相似搜索[J].计算机学报,2005,28(9):1467-1475. 被引量:20
  • 4HAN J W,KAMBER M,PEI J. Data mining:concepts and techniques [ M]. 3rd ed. San Francisco:Morgan Kanfmann Publishers, 2011.
  • 5P.ENG C K, HAVLIN S, STANLEY H E, et al. Quantification of scaling exponents and crossover phenomena in nonstationary heartbeat time series [ J ]. Chaos, 1995,5 ( 1 ) :83- 88.
  • 6YANG Qiang,WU Xin-dong. 10 challenging problems in data mining research[ J]. Intemational Journal of Information Technology & Decision Making,2006,5(4) :597-604.
  • 7FU T C. A review on time series data mining[J]. Engineering Appli- cations of Artificial Intelligence,2011,24( 1 ) : 164-181.
  • 8RATANAMAHATANA C, KEOGH E, BAGNALL T, et al. A novel bit level time series representation with implications for similarity search and clustering [ C]//Proc of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining. 2005:771-777.
  • 9KEOGH E, LIN J, FU A. Hot SAX:efficiently finding the most unusu- al time series subsequence[ C]//Proc of the 5th IEEE International Conference on Data Mining. 2005:226-233.
  • 10AGRAWAL R, FALOUTSOS C, SWAMI A. Efficient similarity search in sequence databases[ C ]//Proc of the 4th International Conference on Foundations of Data Organization and Algorithms. Washington DC : IEEE Computer Society, 1993:69- 84.

共引文献64

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部