Dynamic tensor clustering
From MaRDI portal
Publication:5208093
Abstract: 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.
Recommendations
- A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering
- Approximation algorithms for tensor clustering
- Factor Models for High-Dimensional Tensor Time Series
- Tensor envelope mixture model for simultaneous clustering and multiway dimension reduction
- Partially Observed Dynamic Tensor Response Regression
Cites work
- A SPATIAL SCAN STATISTIC FOR COMPOUND POISSON DATA, USING NEGATIVE BINOMIAL DISTRIBUTION AND ACCOUNTING FOR POPULATION STRATIFICATION
- A Unified Approach for Simultaneous Gene Clustering and Differential Expression Identification
- A tensor approach to learning mixed membership community models
- Algorithm AS 136: A K-Means Clustering Algorithm
- Analysis of presence-only data via semi-supervised learning approaches
- Biclustering via sparse singular value decomposition
- Consistent selection of the number of clusters via crossvalidation
- Convex biclustering
- Cross: efficient low-rank tensor completion
- Estimating the number of clusters in a data set via the gap statistic
- Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion
- Joint estimation of sparse multivariate regression and conditional graphical models
- Likelihood-based selection and sharp parameter estimation
- Multilayer tensor factorization with applications to recommender systems
- On tensor completion via nuclear norm minimization
- Penalized Clustering of Large-Scale Functional Data With Multiple Covariates
- Provable sparse tensor decomposition
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
- Simultaneous supervised clustering and feature selection over a graph
- Sparsity and Smoothness Via the Fused Lasso
- Structural pursuit over multiple undirected graphs
- Tensor Decompositions and Applications
- Tensor Regression with Applications in Neuroimaging Data Analysis
- Tensor sliced inverse regression
- The analysis of two-way functional data using two-way regularized singular value decompositions
- The solution path of the generalized lasso
Cited in
(29)- Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization
- Tree-based structural twin support tensor clustering with square loss function
- Model-Based Tensor Low-Rank Clustering
- Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer
- Tensor envelope mixture model for simultaneous clustering and multiway dimension reduction
- Tensor clustering with planted structures: statistical optimality and computational limits
- Network modeling in biology: statistical methods for gene and brain networks
- TreeKDE: clustering multivariate data based on decision tree and using one-dimensional kernel density estimation
- Detecting clusters in multivariate response regression
- Biconvex Clustering
- Covariate-Assisted Sparse Tensor Completion
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
- Dynamic modeling and online monitoring of tensor data streams with application to passenger flow surveillance
- A general framework for tensor screening through smoothing
- Optimal sparse singular value decomposition for high-dimensional high-order data
- A parameter-less algorithm for tensor co-clustering
- Algorithms for structure preserving best rank-one approximations of partially symmetric tensors
- Clustering Boolean tensors
- Classification of longitudinal brain networks with an application to understanding superior aging
- Correlation Tensor Decomposition and Its Application in Spatial Imaging Data
- Partially Observed Dynamic Tensor Response Regression
- A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering
- Approximation algorithms for tensor clustering
- Inference for low-rank tensors -- no need to debias
- Statistical performance of quantile tensor regression with convex regularization
- scientific article; zbMATH DE number 7370581 (Why is no real title available?)
- scientific article; zbMATH DE number 7306902 (Why is no real title available?)
- Optimal estimation and computational limit of low-rank Gaussian mixtures
- Guaranteed Functional Tensor Singular Value Decomposition
This page was built for publication: Dynamic tensor clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208093)
