Tensor Multi-Elastic Kernel Self-Paced Learning for Time Series Clustering

被引:35
作者
Tang, Yongqiang [1 ,2 ]
Xie, Yuan [3 ]
Yang, Xuebing [1 ]
Niu, Jinghao [1 ,2 ]
Zhang, Wensheng [1 ,2 ]
机构
[1] Chinese Acad Sci, Res Ctr Precis Sensing & Control, Inst Automat, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Beijing 101408, Peoples R China
[3] East China Normal Univ, Sch Comp Sci & Technol, Shanghai 200241, Peoples R China
基金
中国国家自然科学基金;
关键词
Kernel; Time series analysis; Time measurement; Clustering algorithms; Optimization; Task analysis; Time series clustering; multiple kernels clustering; self-paced learning; tensor optimization; CLASSIFICATION; REPRESENTATION; DISTANCE;
D O I
10.1109/TKDE.2019.2937027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Time series clustering has attracted growing attention due to the abundant data accessible and extensive value in various applications. The unique characteristics of time series, including high-dimension, warping, and the integration of multiple elastic measures, pose challenges for the present clustering algorithms, most of which take into account only part of these difficulties. In this paper, we make an effort to simultaneously address all aforementioned issues in time series clustering under a unified multiple kernels clustering (MKC) framework. Specifically, we first implicitly map the raw time series space into multiple kernel spaces via elastic distance measure functions. In such high-dimensional spaces, we resort to the tensor constraint based self-representation subspace clustering approach, which involves the self-paced learning paradigm, to explore the essential low-dimensional structure of the data, as well as the high-order complementary information from different elastic kernels. The proposed approach can be extended to more challenging multivariate time series clustering scenario in a direct but elegant way. Extensive experiments on 85 univariate and 10 multivariate time series datasets demonstrate the significant superiority of the proposed approach beyond the baseline and several state-of-the-art MKC methods.
引用
收藏
页码:1223 / 1237
页数:15
相关论文
共 58 条
[1]   Time-series clustering - A decade review [J].
Aghabozorgi, Saeed ;
Shirkhorshidi, Ali Seyed ;
Teh Ying Wah .
INFORMATION SYSTEMS, 2015, 53 :16-38
[2]  
[Anonymous], 2009, P 8 AUSTR DAT MIN C
[3]  
[Anonymous], 2004, Proceedings of the Thirtieth International Conference on Very Large Data Bases, DOI DOI 10.1016/B978-012088469-8.50070-X
[4]   Time-Series Classification with COTE: The Collective of Transformation-Based Ensembles [J].
Bagnall, Anthony ;
Lines, Jason ;
Hills, Jon ;
Bostrom, Aaron .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (09) :2522-2535
[5]   Learning a symbolic representation for multivariate time series classification [J].
Baydogan, Mustafa Gokce ;
Runger, George .
DATA MINING AND KNOWLEDGE DISCOVERY, 2015, 29 (02) :400-422
[6]   Accelerating Dynamic Time Warping Clustering with a Novel Admissible Pruning Strategy [J].
Begum, Nurjahan ;
Ulanova, Liudmila ;
Wang, Jun ;
Keogh, Eamonn .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :49-58
[7]   Multiple Kernel Learning for Visual Object Recognition: A Review [J].
Bucak, Serhat S. ;
Jin, Rong ;
Jain, Anil K. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2014, 36 (07) :1354-1369
[8]  
Burden RL., 2011, NUMERICAL ANAL
[9]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[10]  
Chen YH, 2009, J MACH LEARN RES, V10, P747