聚类分析
计算机科学
系列(地层学)
动态时间归整
核(代数)
数据挖掘
张量(固有定义)
人工智能
CURE数据聚类算法
相关聚类
数据流聚类
单变量
时间序列
高维数据聚类
模式识别(心理学)
机器学习
多元统计
数学
古生物学
纯数学
生物
组合数学
作者
Yongqiang Tang,Yuan Xie,Xuebing Yang,Jinghao Niu,Wensheng Zhang
标识
DOI:10.1109/tkde.2019.2937027
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI