Biclustering via structured regularized matrix decomposition
From MaRDI portal
Publication:2141911
DOI10.1007/s11222-022-10095-1zbMath1486.62011MaRDI QIDQ2141911
Publication date: 25 May 2022
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-022-10095-1
62-08: Computational methods for problems pertaining to statistics
62H30: Classification and discrimination; cluster analysis (statistical aspects)
68T05: Learning and adaptive systems in artificial intelligence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Finding large average submatrices in high dimensional data
- Block clustering with Bernoulli mixture models: comparison of different approaches
- The composite absolute penalties family for grouped and hierarchical variable selection
- Within group variable selection through the exclusive Lasso
- Sparse principal component analysis by choice of norm
- Optimal Estimation and Completion of Matrices with Biclustering Structures
- On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
- Biclustering via Sparse Singular Value Decomposition
- Stability Selection
- Co-Clustering of Ordinal Data via Latent Continuous Random Variables and Not Missing at Random Entries
- Convex biclustering
- Reduced Rank Stochastic Regression with a Sparse Singular value Decomposition
- Estimation and selection for the latent block model on categorical data