Dynamic tensor clustering
From MaRDI portal
Publication:5208093
DOI10.1080/01621459.2018.1527701zbMATH Open1428.62260arXiv1708.07259OpenAlexW2963256582MaRDI QIDQ5208093FDOQ5208093
Publication date: 15 January 2020
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1708.07259
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
Factor analysis and principal components; correspondence analysis (62H25) Nonconvex programming, global optimization (90C26)
Cites Work
- Penalized Clustering of Large-Scale Functional Data With Multiple Covariates
- Algorithm AS 136: A K-Means Clustering Algorithm
- Estimating the number of clusters in a data set via the gap statistic
- Cross: efficient low-rank tensor completion
- The analysis of two-way functional data using two-way regularized singular value decompositions
- Sparsity and Smoothness Via the Fused Lasso
- The solution path of the generalized lasso
- Tensor Decompositions and Applications
- Tensor Regression with Applications in Neuroimaging Data Analysis
- Likelihood-based selection and sharp parameter estimation
- Structural pursuit over multiple undirected graphs
- Provable Sparse Tensor Decomposition
- A tensor approach to learning mixed membership community models
- Simultaneous supervised clustering and feature selection over a graph
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- Consistent selection of the number of clusters via crossvalidation
- Joint estimation of sparse multivariate regression and conditional graphical models
- Biclustering via sparse singular value decomposition
- On tensor completion via nuclear norm minimization
- A Unified Approach for Simultaneous Gene Clustering and Differential Expression Identification
- Tensor sliced inverse regression
- Convex biclustering
- Analysis of presence-only data via semi-supervised learning approaches
- Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion
- Multilayer tensor factorization with applications to recommender systems
- Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
- A SPATIAL SCAN STATISTIC FOR COMPOUND POISSON DATA, USING NEGATIVE BINOMIAL DISTRIBUTION AND ACCOUNTING FOR POPULATION STRATIFICATION
Cited In (27)
- Model-Based Tensor Low-Rank Clustering
- Algorithms for structure preserving best rank-one approximations of partially symmetric tensors
- Guaranteed Functional Tensor Singular Value Decomposition
- Biconvex Clustering
- Covariate-Assisted Sparse Tensor Completion
- Title not available (Why is that?)
- Tensor clustering with planted structures: statistical optimality and computational limits
- Inference for low-rank tensors -- no need to debias
- Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization
- A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering
- A general framework for tensor screening through smoothing
- Optimal estimation and computational limit of low-rank Gaussian mixtures
- Detecting clusters in multivariate response regression
- Tensor envelope mixture model for simultaneous clustering and multiway dimension reduction
- Approximation algorithms for tensor clustering
- Network modeling in biology: statistical methods for gene and brain networks
- Dynamic modeling and online monitoring of tensor data streams with application to passenger flow surveillance
- Statistical performance of quantile tensor regression with convex regularization
- Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
- Title not available (Why is that?)
- Optimal sparse singular value decomposition for high-dimensional high-order data
- Correlation Tensor Decomposition and Its Application in Spatial Imaging Data
- Partially Observed Dynamic Tensor Response Regression
- Classification of longitudinal brain networks with an application to understanding superior aging
- TreeKDE: clustering multivariate data based on decision tree and using one-dimensional kernel density estimation
- Clustering Boolean tensors
Uses Software
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)
