返回
摘要
En 中文
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. There is also a gap between statistical guarantee and computational efficiency for existing tensor clustering solutions. In this article, we propose a new dynamic tensor clustering method that works for a general-order dynamic tensor, and enjoys both strong statistical guarantee and high computational efficiency. Our proposal is based on 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. Theoretically, we first establish a nonasymptotic 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 high probability. Moreover, our proposed method can be naturally extended to co-clustering of multiple modes of the tensor data. The efficacy of our method is illustrated through simulations and a brain dynamic functional connectivity analysis from an autism spectrum disorder study. for this article are available online.
Keyword:
Cluster analysis
Multidimensional array
Nonconvex optimization
Tensor decomposition
Variable selection
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
DC Offset Error Compensation Algorithm for PR Current Control of a Single-Phase Grid-Tied Inverter
Energies
IF0
Triazines and related products. Part VIII. Potential irreversible chymotrypsin inhibitors: 3-alkyl-1,2,3-benzotriazin-4(3H)-ones and o-azidobenzamides三嗪及其相关产品。第VIII部分。潜在的不可逆糜蛋白酶抑制剂:3-烷基-1,2,3-苯并三嗪-4(3H)-酮和邻叠氮苯甲酰胺

