Two-way Spectrum Pursuit for CUR Decomposition and Its Application in Joint Column/Row Subset Selection
The problem of simultaneous column and row subset selection is addressed in this paper. The column space and row space of a matrix are spanned by its left and right singular vectors, respectively. However, the singular vectors are not within actual columns/rows of the matrix. In this paper, an iterative approach is proposed to capture the most structural information of columns/rows via selecting a subset of actual columns/rows. This algorithm is referred to as two-way spectrum pursuit (TWSP) which provides us with an accurate solution for the CUR matrix decomposition. TWSP is applicable in a wide range of applications since it enjoys a linear complexity w.r.t. number of original columns/rows. We demonstrated the application of TWSP for joint channel and sensor selection in cognitive radio networks, informative users and contents detection, and efficient supervised data reduction.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
High Dimensional Low Rank plus Sparse Matrix Decomposition
This paper is concerned with the problem of low rank plus sparse matrix decomposition for big data. Conventional algorithms for matrix decomposition use the entire data to extract the low-rank and sparse components, and …
ClusteringSmall Data Image ClassificationVocal Bursts Intensity PredictionAnalysis of Orthogonal Matching Pursuit for Compressed Sensing in Practical Settings
Orthogonal matching pursuit (OMP) is a widely used greedy algorithm for sparse signal recovery in compressed sensing (CS). Prior work on OMP, however, has only provided reconstruction guarantees under the assumption that…
compressed sensingSelect to Better Learn: Fast and Accurate Deep Learning Using Data Selection From Nonlinear Manifolds
Finding a small subset of data whose linear combination spans other data points, also called column subset selection problem (CSSP), is an important open problem in computer science with many applications in computer vis…
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it is nevertheless plagued by a well-known, w…
Collaborative FilteringDimensionality ReductionMatrix CompletionJoint Modeling of a Matrix with Associated Text via Latent Binary Features
A new methodology is developed for joint analysis of a matrix and accompanying documents, with the documents associated with the matrix rows/columns. The documents are modeled with a focused topic model, inferring latent…