arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.07259stat.MLmath.STstat.TH
收藏

动态张量聚类

Dynamic Tensor Clustering

Will Wei Sun, Lexin Li

摘要:

动态张量数据在许多应用中变得普遍。现有的张量聚类方法要么不能考虑数据的动态性质,要么不适用于一般阶张量。此外,现有的张量聚类解决方案的统计保证和计算效率之间往往存在差距。在这篇文章中,我们的目标是通过提出一种新的动态张量聚类方法来弥合这一差距,该方法同时考虑了稀疏性和融合结构,并具有很强的统计保证以及高计算效率。我们的建议是基于一个新的结构张量分解,鼓励沿指定的张量模式的参数的稀疏性和平滑性。在计算上,我们开发了一个高效的优化算法,受益于大量的降维。在理论上,我们首先建立一个非渐近误差界的估计结构张量分解。建立在这个误差界,然后我们推导出估计的聚类中心的收敛速度,并表明估计的集群恢复真正的集群结构具有很高的概率。此外,我们提出的方法可以自然地扩展到多个模式的张量数据的共同聚类。我们的方法的有效性说明通过模拟和大脑动态功能连接分析自闭症谱系障碍的研究。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑