Sparse Matrix-based Random Projection for Classification
As a typical dimensionality reduction technique, random projection can be simply implemented with linear projection, while maintaining the pairwise distances of high-dimensional data with high probability. Considering this technique is mainly exploited for the task of classification, this paper is developed to study the construction of random matrix from the viewpoint of feature selection, rather than of traditional distance preservation. This yields a somewhat surprising theoretical result, that is, the sparse random matrix with exactly one nonzero element per column, can present better feature selection performance than other more dense matrices, if the projection dimension is sufficiently large (namely, not much smaller than the number of feature elements); otherwise, it will perform comparably to others. For random projection, this theoretical result implies considerable improvement on both complexity and performance, which is widely confirmed with the classification experiments on both synthetic data and real data.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationDimensionality Reductionfeature selectionGeneral ClassificationSimilar Papers 제목 키워드 기반
Optimal Projections for Discriminative Dictionary Learning using the JL-lemma
Dimensionality reduction-based dictionary learning methods in the literature have often used iterative random projections. The dimensionality of such a random projection matrix is a random number that might not lead to a…
Dictionary LearningDimensionality ReductionFace RecognitionLEMMA+1Random Features for Sparse Signal Classification
Random features is an approach for kernel-based inference on large datasets. In this paper, we derive performance guarantees for random features on signals, like images, that enjoy sparse representations and show that t…
ClassificationGeneral ClassificationTheory of Dual-sparse Regularized Randomized Reduction
In this paper, we study randomized reduction methods, which reduce high-dimensional features into low-dimensional space by randomized methods (e.g., random projection, random hashing), for large-scale high-dimensional cl…
General ClassificationDeep Learning Sparse Ternary Projections for Compressed Sensing of Images
Compressed sensing (CS) is a sampling theory that allows reconstruction of sparse (or compressible) signals from an incomplete number of measurements, using of a sensing mechanism implemented by an appropriate projection…
compressed sensingDeep LearningStable Sparse Subspace Embedding for Dimensionality Reduction
Sparse random projection (RP) is a popular tool for dimensionality reduction that shows promising performance with low computational complexity. However, in the existing sparse RP matrices, the positions of non-zero entr…
Dimensionality Reduction