Biclustering via sparse singular value decomposition
From MaRDI portal
Recommendations
Cites work
- Adaptive Lasso for Cox's proportional hazards model
- Better Subset Regression Using the Nonnegative Garrote
- Biclustering in data mining
- Estimating the dimension of a model
- Feature selection for consistent biclustering via fractional 0-1 programming
- Finding large average submatrices in high dimensional data
- scientific article; zbMATH DE number 1750182 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- On the ``degrees of freedom of the lasso
- Regularization and Variable Selection Via the Elastic Net
- Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR
- Sparse principal component analysis via regularized low rank matrix approximation
- Statistical Significance of Clustering for High-Dimension, Low–Sample Size Data
- The Adaptive Lasso and Its Oracle Properties
- Variable Selection for Model-Based High-Dimensional Clustering and Its Application to Microarray Data
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(49)- Bi-cross-validation of the SVD and the nonnegative matrix factorization
- Joint and individual variation explained (JIVE) for integrated analysis of multiple data types
- A dual reformulation and solution framework for regularized convex clustering problems
- Selective inference for latent block models
- Some aspects of response variable selection and estimation in multivariate linear regression
- Bayesian bi-clustering methods with applications in computational biology
- Multimodal correlations-based data clustering
- Biclustering via structured regularized matrix decomposition
- Generalized co-clustering analysis via regularized alternating least squares
- Multi-view cluster analysis with incomplete data to understand treatment effects
- Spike-and-slab Lasso biclustering
- On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory
- High dimensional deformed rectangular matrices with applications in matrix denoising
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Complexity of modification problems for reciprocal best match graphs
- On Bayesian new edge prediction and anomaly detection in computer networks
- Dynamic network models and graphon estimation
- A note on rank reduction in sparse multivariate regression
- Singular vector and singular subspace distribution for the matrix denoising model
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee
- Sparse-smooth regularized singular value decomposition
- SVD, discrepancy, and regular structure of contingency tables
- A survey of high dimension low sample size asymptotics
- Bayesian model selection with graph structured sparsity
- A generalized least-square matrix decomposition
- A finite mixture approach to joint clustering of individuals and multivariate discrete outcomes
- Biclustering via sparse clustering
- scientific article; zbMATH DE number 7306902 (Why is no real title available?)
- Biclustering with heterogeneous variance
- Optimal sparse singular value decomposition for high-dimensional high-order data
- Dynamic tensor clustering
- Decentralized dictionary learning over time-varying digraphs
- Multilevel Matrix-Variate Analysis and its Application to Accelerometry-Measured Physical Activity in Clinical Populations
- Convex biclustering
- Uncovering block structures in large rectangular matrices
- A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering
- A method for visual identification of small sample subgroups and potential biomarkers
- Multiple day biclustering of high-frequency financial time series
- A Bayesian hierarchical hidden Markov model for clustering and gene selection: application to kidney cancer gene expression data
- Beyond symmetry: best submatrix selection for the sparse truncated SVD
- Covariate-Dependent Clustering of Undirected Networks with Brain-Imaging Data
- Randomly projected convex clustering model: motivation, realization, and cluster recovery guarantees
- High-Dimensional Block Diagonal Covariance Structure Detection Using Singular Vectors
- Robust convex biclustering with a tuning-free method
- Sparse partial least squares with group and subgroup structure
- A two-way regularization method for MEG source reconstruction
- SOFARI: High-Dimensional Manifold-Based Inference
- A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood
- Finding large average submatrices in high dimensional data
This page was built for publication: Biclustering via sparse singular value decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076038)
