Dynamic Tensor Clustering

DOI10.1080/01621459.2018.1527701zbMath1428.62260arXiv1708.07259OpenAlexW2963256582MaRDI QIDQ5208093

Lexin Li, Wei Sun

Publication date: 15 January 2020

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.07259

zbMATH Keywords

nonconvex optimizationcluster analysisvariable selectiontensor decompositionmultidimensional array

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Nonconvex programming, global optimization (90C26)

Related Items (17)

Inference for low-rank tensors -- no need to debias ⋮ A general framework for tensor screening through smoothing ⋮ 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 ⋮ Algorithms for structure preserving best rank-one approximations of partially symmetric tensors ⋮ Partially Observed Dynamic Tensor Response Regression ⋮ Correlation Tensor Decomposition and Its Application in Spatial Imaging Data ⋮ Unnamed Item ⋮ Biconvex Clustering ⋮ Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization ⋮ Covariate-Assisted Sparse Tensor Completion ⋮ Optimal estimation and computational limit of low-rank Gaussian mixtures ⋮ Statistical performance of quantile tensor regression with convex regularization ⋮ Tensor envelope mixture model for simultaneous clustering and multiway dimension reduction ⋮ Network modeling in biology: statistical methods for gene and brain networks ⋮ Optimal Sparse Singular Value Decomposition for High-Dimensional High-Order Data ⋮ Unnamed Item

Uses Software

• AS 136
• Cross
• clusterpath

Cites Work

• Unnamed Item
• Estimating the Number of Clusters in a Data Set Via the Gap Statistic
• Tensor Decompositions and Applications
• Algorithm AS 136: A K-Means Clustering Algorithm
• On tensor completion via nuclear norm minimization
• Tensor sliced inverse regression
• The solution path of the generalized lasso
• Analysis of presence-only data via semi-supervised learning approaches
• Cross: efficient low-rank tensor completion
• Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
• Multilayer tensor factorization with applications to recommender systems
• Joint estimation of sparse multivariate regression and conditional graphical models
• Consistent selection of the number of clusters via crossvalidation
• The Analysis of Two-Way Functional Data Using Two-Way Regularized Singular Value Decompositions
• Biclustering via Sparse Singular Value Decomposition
• Simultaneous supervised clustering and feature selection over a graph
• A SPATIAL SCAN STATISTIC FOR COMPOUND POISSON DATA, USING NEGATIVE BINOMIAL DISTRIBUTION AND ACCOUNTING FOR POPULATION STRATIFICATION
• Penalized Clustering of Large-Scale Functional Data With Multiple Covariates
• Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
• Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion
• Sparsity and Smoothness Via the Fused Lasso
• Likelihood-Based Selection and Sharp Parameter Estimation
• Structural Pursuit Over Multiple Undirected Graphs
• A Unified Approach for Simultaneous Gene Clustering and Differential Expression Identification
• Tensor Regression with Applications in Neuroimaging Data Analysis
• Convex biclustering
• Provable Sparse Tensor Decomposition

This page was built for publication: Dynamic Tensor Clustering