Orthogonal Matching Pursuit for Text Classification
In text classification, the problem of overfitting arises due to the high dimensionality, making regularization essential. Although classic regularizers provide sparsity, they fail to return highly accurate models. On the contrary, state-of-the-art group-lasso regularizers provide better results at the expense of low sparsity. In this paper, we apply a greedy variable selection algorithm, called Orthogonal Matching Pursuit, for the text classification task. We also extend standard group OMP by introducing overlapping Group OMP to handle overlapping groups of features. Empirical analysis verifies that both OMP and overlapping GOMP constitute powerful regularizers, able to produce effective and very sparse models. Code and data are available online: https://github.com/y3nk0/OMP-for-Text-Classification .
Code (1)
Tasks
ClassificationGeneral Classificationtext-classificationText ClassificationVariable SelectionSimilar Papers 제목 키워드 기반
Simultaneous Optimized Orthogonal Matching Pursuit with Application to ECG Compression
A greedy pursuit strategy which finds a common basis for approximating a set of similar signals is proposed. The strategy extends the Optimized Orthogonal Matching Pursuit approach to selecting the subspace containing th…
Sparse Representation-Based Classification: Orthogonal Least Squares or Orthogonal Matching Pursuit?
Spare representation of signals has received significant attention in recent years. Based on these developments, a sparse representation-based classification (SRC) has been proposed for a variety of classification and re…
BenchmarkingClassificationFace RecognitionGeneral Classification+4The performance of orthogonal multi-matching pursuit under RIP
The orthogonal multi-matching pursuit (OMMP) is a natural extension of orthogonal matching pursuit (OMP). We denote the OMMP with the parameter $M$ as OMMP(M) where $M\geq 1$ is an integer. The main difference between OM…
Signal and Noise Statistics Oblivious Orthogonal Matching Pursuit
Orthogonal matching pursuit (OMP) is a widely used algorithm for recovering sparse high dimensional vectors in linear regression models. The optimal performance of OMP requires \textit{a priori} knowledge of either the s…
regressionAnalysis of the Self Projected Matching Pursuit Algorithm
The convergence and numerical analysis of a low memory implementation of the Orthogonal Matching Pursuit greedy strategy, which is termed Self Projected Matching Pursuit, is presented. This approach renders an iterative …