Biometrics · 2010 · 270 citations · 24 references
ComputingBiostatisticsData ScienceGenomic Data AnalysisHealth Data AnalyticsHealth Data ScienceDimension ReductionDimensionality ReductionMatrix FactorizationHigh-dimensional Data MiningLeast Squares ProblemsParameter SelectionRegularizationSingular Value DecompositionSingular VectorsSparse Data HandlingSparse Matrix Algorithms
Sparse singular value decomposition (SSVD) is proposed as a new exploratory analysis tool for biclustering or identifying interpretable row-column associations within high-dimensional data matrices. SSVD seeks a low-rank, checkerboard structured matrix approximation to data matrices. The desired checkerboard structure is achieved by forcing both the left- and right-singular vectors to be sparse, that is, having many zero entries. By interpreting singular vectors as regression coefficient vectors for certain linear regressions, sparsity-inducing regularization penalties are imposed to the least squares regression to produce sparse singular vectors. An efficient iterative algorithm is proposed for computing the sparse singular vectors, along with some discussion of penalty parameter selection. A lung cancer microarray dataset and a food nutrition dataset are used to illustrate SSVD as a biclustering method. SSVD is also compared with some existing biclustering methods using simulated datasets.
24
The Adaptive Lasso and Its Oracle Properties
Hui Zou · Journal of the American Statistical Association · 2006 · 7.6K citations
The Approximation of One Matrix by Another of Lower Rank
Carl Eckart, Gale Young · Psychometrika · 1936 · 3.8K citations