期刊文献+

融合选择提取与子类聚类的快速Shapelet发现算法 被引量:9

Fast Shapelet Discovery Algorithm Combining Selective Extraction and Subclass Clustering
下载PDF
导出
摘要 基于Shapelet的时间序列分类算法具有可解释性,且分类准确率高、分类速度快.在这些算法中,Shapelet学习算法不依赖于单一分类器,能够学习出不在原始时间序列中的Shapelet,可以取得较高的分类准确率,同时还可以保证Shapelet发现和分类器构建同时完成;但如果产生的Shapelet过多,会增加依赖参数,导致训练时间太长,分类速度低,动态更新困难,且相似重复的Shapelet会降低分类的可解释性.提出一种选择性提取方法,用于更精准地选择Shapelet候选集,并改变学习方法以加速Shapelet学习过程;方法中提出了两个优化策略,通过对原始训练集采用时间序列聚类,可以得到原始时间序列中没有的Shapelet,同时在选择性提取算法中加入投票机制,以解决产生Shapelet过多的问题.实验表明,该算法在保持较高准确率的同时,可以显著地提高训练速度. The time series classification algorithm based on Shapelet has the characteristics of interpretability,high classifica-tion accuracy and fast classification speed.Among these Shapelet-based algorithms,learning Shapelet algorithm does not rely on a single classifier,and Shapelet that is not in the original time series can be learned,which can achieve a high classification accuracy and ensure that Shapelet discovery and classifier construction are completed at the same time.However,if too many Shapelets are generated,it will increase the dependent parameters,resulting in too long training time,low classification speed,and difficult dynamic updates.And similar redundancy Shapelets will reduce the interpretability of the classification.This study proposes a new selective extraction algorithm to select Shapelet candidate set and change the learning method to accelerate the learning process of Shapelet and puts forward two optimization strategies.By using time series clustering for the original training set,Shapelets not in the original time series can be obtained.Meanwhile,a voting mechanism is added into the selective extraction algorithm to solve the problem of excessive Shapelet generation.Experiments show that the proposed algorithm can improve the training speed while maintaining high accuracy.
作者 赵超 王腾江 刘士军 潘丽 嵇存 ZHAO Chao;WANG Teng-Jiang;LIU Shi-Jun;PAN Li;JI Cun(School of Software,Shandong University,Ji’nan 250101,China;Inspur General Software Co.Ltd.,Ji’nan 250101,China;School of Information Science and Engineering,Shandong Normal University,Ji’nan 250014,China)
出处 《软件学报》 EI CSCD 北大核心 2020年第3期763-777,共15页 Journal of Software
基金 国家自然科学基金(61872222) 山东省重点研发计划(2018GGX101019) 山东大学未来学者计划。
关键词 时间序列 分类 Shapelet 候选集 选择性提取 time series classification Shapelet candidates selective extraction
  • 相关文献

参考文献2

二级参考文献25

  • 1Lines J, Davis LM, Hills J, Bagnall A. A shapelet transform for time series classification. In: Proc. of the 18th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD 2012). Beijing: ACM Press, 2012. 289-297. [doi: 10.1145/2339530. 2339579].
  • 2Ding H, Trajcevski G, Scheuermann P, Wang X, Keogh EJ. Querying and mining of time series data: Experimental comparison of representations and distance measures. In: Proc. of the 34th lnt'l Conf. on Very Large Data Bases (VLDB 2008). Auckland: Springer-Verlag, 2008. 1542-1552. [doi: 10.14778/1454159.1454226].
  • 3Rakthanmanon T, Campana B, Mueen A, Batista G, Westover B, Zhu Q, Zakaria J, Keogh E. Searching and mining trillions of time series subsequences under dynamic time warping. In: Proc. of the 18th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD 2012). Beijing: ACM Press, 2012. 262-270. [doi: 10.1145/2339530.2339576].
  • 4Berndt DJ, Clifford J. Using dynamic time warping to find patterns in time series. In: Proc. of the KDD Workshop. 1994. 359-370.
  • 5Ye L, Keogh EJ. Time series shapelets: A new primitive for data mining. In: Proc. of the 15th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD 2009). Paris: ACM Press, 2009. 947-956. [doi: 10.1145/1557019.1557122].
  • 6Ye L, Keogh EJ. Time series shapelets: A novel technique that allows accurate, interpretable and fast classification. Data Mining and Knowledge Discovery, 2011,22(1-2):149-182. [doi: 10.1007/s10618-010-0179-5].
  • 7Mueen A, Keogh E J, Young N. Logical-Shapelets: An expressive primitive for time series classification. In: Proc. of the 17th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD 2011). San Diego: ACM Press, 2011. 1154-1162. [doi: 10. 1145/2020408.2020587].
  • 8Rakthanmauon T, Keogh EJ. Fast shapelets: A scalable algorithm for discovering time aeries shapelets. In: Proc. of the ~3th SIAM Int'l Conf. on Data Mining (SDM 2013). Austin: SIAM Press, 2013. 668-676. [doi: 10.1137/1.9781611972832.74].
  • 9Keogh E, Lonardi S, Ratanamahatana CA. Towards parameter-free data mining. In: Proe. of the ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD 2004). Seattle: ACM Press, 2004. 206-215. [doi: 10.1145/1014052.1014077].
  • 10Esling P, Agon C. Time-Series data mining. ACM Computing Surveys, 2012,45(1):12:1-12:34. [doi: 10.1145/2379776.2379788].

共引文献27

同被引文献52

引证文献9

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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