← Core Methods
Machine Learning › Core Methods ›

Feature Selection

462 directly classified papers

Papers per year

Papers

A General Framework for Structured Sparsity via Proximal Optimization AISTATS 2012
On fast approximate submodular minimization NIPS 2011
Target Neighbor Consistent Feature Weighting for Nearest Neighbor Classification NIPS 2011
EigenNet: A Bayesian hybrid of generative and conditional models for sparse learning NIPS 2011
Hashing Algorithms for Large-Scale Learning NIPS 2011
Identifying Alzheimer's Disease-Related Brain Regions from Multi-Modality Neuroimaging Data using Sparse Composite Linear Discrimination Analysis NIPS 2011
Efficient Methods for Overlapping Group Lasso NIPS 2011
Learning Higher-Order Graph Structure with Features by Structure Penalty NIPS 2011
Projection onto A Nonnegative Max-Heap NIPS 2011
Nearest Neighbor based Greedy Coordinate Descent NIPS 2011
Group Lasso Estimation of High-dimensional Covariance Matrices JMLR 2011
Tight conditions for consistent variable selection in high dimensional nonparametric regression COLT 2011
On the accuracy of l1-filtering of signals with block-sparse structure NIPS 2011
Group Orthogonal Matching Pursuit for Logistic Regression AISTATS 2011
On Learning Discrete Graphical Models using Group-Sparse Regularization AISTATS 2011
Multivariate Dyadic Regression Trees for Sparse Learning Problems NIPS 2010
Exclusive Lasso for Multi-task Feature Selection AISTATS 2010
Convex Structure Learning in Log-Linear Models: Beyond Pairwise Potentials AISTATS 2010
A Regularization Approach to Nonlinear Variable Selection AISTATS 2010
The Group Dantzig Selector AISTATS 2010
The Feature Selection Path in Kernel Methods AISTATS 2010
Ultra-high Dimensional Multiple Output Learning With Simultaneous Orthogonal Matching Pursuit: Screening Approach AISTATS 2010
Feature Selection using Multiple Streams AISTATS 2010
Probabilistic Multi-Task Feature Selection NIPS 2010
A Primal-Dual Algorithm for Group Sparse Regularization with Overlapping Groups NIPS 2010