Dynamic tensor data are becoming prevalent in numerous applications. Existing tensor clustering methods either fail to account for the dynamic nature of the data, or are inapplicable to a general-order tensor. Also there is often a gap between statistical guarantee and computational efficiency for existing tensor clustering solutions. In this article, we aim to bridge this gap by proposing a new dynamic tensor clustering method, which takes into account both sparsity and fusion structures, and enjoys strong statistical guarantees as well as high computational efficiency. Our proposal is based upon a new structured tensor factorization that encourages both sparsity and smoothness in parameters along the specified tensor modes. Computationally, we develop a highly efficient optimization algorithm that benefits from substantial dimension reduction. In theory, we first establish a non-asymptotic error bound for the estimator from the structured tensor factorization. Built upon this error bound, we then derive the rate of convergence of the estimated cluster centers, and show that the estimated clusters recover the true cluster structures with a high probability. Moreover, our proposed method can be naturally extended to co-clustering of multiple modes of the tensor data. The efficacy of our approach is illustrated via simulations and a brain dynamic functional connectivity analysis from an Autism spectrum disorder study.
Multiway clustering of 3-order tensor via affinity matrix
LIPN, UMR CNRS 7030(法国国家科学研究中心计算机科学与信号处理实验室(UMR 7030));Sorbonne Paris Nord University(索邦巴黎北大学);DAVID Lab(DAVID实验室);University of Versailles(凡尔赛大学);Université Paris-Saclay(巴黎萨克雷大学)
A Self-Organizing Tensor Architecture for Multi-View Clustering
Weill Cornell Medicine(威尔康奈尔医学院);University of Illinois at Chicago(伊利诺伊大学芝加哥分校);University of Pennsylvania(宾夕法尼亚大学);Florida State University(佛罗里达州立大学);Shenzhen University(深圳大学);Shanghai Institute for Advanced Communication and Data Science(上海先进通信与数据科学研究院);Fudan University(复旦大学)
Leveraging tensor kernels to reduce objective function mismatch in deep clustering
NORCE Norwegian Research Centre(挪威研究中心(NORCE));UiT The Arctic University of Norway(挪威北极大学);University of Copenhagen(哥本哈根大学);Norwegian Computing Center(挪威计算中心)
Tensor Dirichlet Process Multinomial Mixture Model for Passenger Trajectory Clustering
University of Cologne(科隆大学);Arizona State University(亚利桑那州立大学);Tsinghua University(清华大学);McGill University(麦吉尔大学);The Hong Kong University of Science and Technology(香港科技大学);HKUST (Guangzhou Campus)(香港科技大学(广州校区))
Choose A Table: Tensor Dirichlet Process Multinomial Mixture Model with Graphs for Passenger Trajectory Clustering
University of Cologne(科隆大学);Arizona State University(亚利桑那州立大学);Tsinghua University(清华大学);McGill University(麦吉尔大学);The Hong Kong University of Science and Technology(香港科技大学);HKUST-GZ(香港科技大学(广州))
Comparative study of Discrete Wavelet Transforms and Wavelet Tensor Train decomposition to feature extraction of FTIR data of medicinal plants
Skolkovo Institute of Science and Technology(斯克洛洛夫研究所);Faculty of Computational Mathematics and Cybernetics, Lomonosov Moscow State University(莫斯科国立大学计算数学与电子学系);Faculty of Chemistry, Lomonosov Moscow State University(莫斯科国立大学化学系);Institute of Numerical Mathematics of the Russian Academy of Sciences(俄罗斯科学院数值数学研究所)
Deep Clustering with a Dynamic Autoencoder: From Reconstruction towards Centroids Construction
National Engineering School of Tunis(突尼斯国立工程师学院);University of Tunis El Manar(突尼斯埃尔马纳尔大学);Ryerson University(瑞尔森大学);Higher School of Communication of Tunis(突尼斯高等通信学院);University of Carthage(迦太基大学)