Infinite Feature Selection: A Graph-based Feature Filtering Approach

Abstract

We propose a filtering feature selection framework that considers subsets of features as paths in a graph, where a node is a feature and an edge indicates pairwise (customizable) relations among features, dealing with relevance and redundancy principles. By two different interpretations (exploiting properties of power series of matrices and relying on Markov chains fundamentals) we can evaluate the values of paths (i.e., feature subsets) of arbitrary lengths, eventually go to infinite, from which we dub our framework Infinite Feature Selection (Inf-FS). Going to infinite allows to constrain the computational complexity of the selection process, and to rank the features in an elegant way, that is, considering the value of any path (subset) containing a particular feature. We also propose a simple unsupervised strategy to cut the ranking, so providing the subset of features to keep. In the experiments, we analyze diverse settings with heterogeneous features, for a total of 11 benchmarks, comparing against 18 widely-known comparative approaches. The results show that Inf-FS behaves better in almost any situation, that is, when the number of features to keep are fixed a priori, or when the decision of the subset cardinality is part of the process.

TPAMI PREPRINT 2020

References in corpus (18)

• Very Deep Convolutional Networks for Large-Scale Image Recognition
• Least Angle Regression
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Rejoinder to "Least angle regression" by Efron et al
• Predicting Parameters in Deep Learning
• Generalized Fisher Score for Feature Selection
• High-dimensional generalized linear models and the lasso
• Gradient Hard Thresholding Pursuit for Sparsity-Constrained Optimization
• Ranking to Learn: Feature Ranking and Selection via Eigenvector Centrality
• Ranking to Learn and Learning to Rank: On the Role of Ranking in Pattern Recognition Applications
• Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit

Cited by in corpus (1)

• Top-$k$ Regularization for Supervised Feature Selection