Pages that link to "Item:Q3076038"

The following pages link to Biclustering via Sparse Singular Value Decomposition (Q3076038):

Displaying 39 items.

• Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee (Q331671) (← links)
• Sparse-smooth regularized singular value decomposition (Q391596) (← links)
• SVD, discrepancy, and regular structure of contingency tables (Q403553) (← links)
• A method for visual identification of small sample subgroups and potential biomarkers (Q652375) (← links)
• A two-way regularization method for MEG source reconstruction (Q714359) (← links)
• A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood (Q892490) (← links)
• Joint and individual variation explained (JIVE) for integrated analysis of multiple data types (Q1951546) (← links)
• A dual reformulation and solution framework for regularized convex clustering problems (Q2029898) (← links)
• Selective inference for latent block models (Q2044409) (← links)
• Some aspects of response variable selection and estimation in multivariate linear regression (Q2062774) (← links)
• Bayesian bi-clustering methods with applications in computational biology (Q2080793) (← links)
• Multimodal correlations-based data clustering (Q2087416) (← links)
• Biclustering via structured regularized matrix decomposition (Q2141911) (← links)
• Generalized co-clustering analysis via regularized alternating least squares (Q2189610) (← links)
• Multi-view cluster analysis with incomplete data to understand treatment effects (Q2215041) (← links)
• On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory (Q2244449) (← links)
• High dimensional deformed rectangular matrices with applications in matrix denoising (Q2278666) (← links)
• Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) (← links)
• Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
• On Bayesian new edge prediction and anomaly detection in computer networks (Q2291541) (← links)
• Dynamic network models and graphon estimation (Q2313290) (← links)
• A note on rank reduction in sparse multivariate regression (Q2323156) (← links)
• Singular vector and singular subspace distribution for the matrix denoising model (Q2656600) (← links)
• A survey of high dimension low sample size asymptotics (Q4639812) (← links)
• (Q4969177) (← links)
• A Generalized Least-Square Matrix Decomposition (Q4975339) (← links)
• A finite mixture approach to joint clustering of individuals and multivariate discrete outcomes (Q5106920) (← links)
• (Q5149011) (← links)
• Biclustering with heterogeneous variance (Q5171014) (← links)
• Optimal Sparse Singular Value Decomposition for High-Dimensional High-Order Data (Q5208075) (← links)
• Dynamic Tensor Clustering (Q5208093) (← links)
• Decentralized Dictionary Learning Over Time-Varying Digraphs (Q5214231) (← links)
• Multilevel Matrix-Variate Analysis and its Application to Accelerometry-Measured Physical Activity in Clinical Populations (Q5231486) (← links)
• Convex biclustering (Q5347398) (← links)
• Uncovering block structures in large rectangular matrices (Q6074727) (← links)
• Multiple day biclustering of high-frequency financial time series (Q6541447) (← links)
• A Bayesian hierarchical hidden Markov model for clustering and gene selection: application to kidney cancer gene expression data (Q6625479) (← links)
• Beyond symmetry: best submatrix selection for the sparse truncated SVD (Q6634519) (← links)
• Covariate-Dependent Clustering of Undirected Networks with Brain-Imaging Data (Q6637467) (← links)