Greedy feature selection: Classifier-dependent feature selection via greedy methods

2024-03-08 · Fabiana Camattari, Sabrina Guastavino, Francesco Marchetti, Michele Piana, Emma Perracchione

The purpose of this study is to introduce a new approach to feature ranking for classification tasks, called in what follows greedy feature selection. In statistical learning, feature selection is usually realized by means of methods that are independent of the classifier applied to perform the prediction using that reduced number of features. Instead, greedy feature selection identifies the most important feature at each step and according to the selected classifier. In the paper, the benefits of such scheme are investigated theoretically in terms of model capacity indicators, such as the Vapnik-Chervonenkis (VC) dimension or the kernel alignment, and tested numerically by considering its application to the problem of predicting geo-effective manifestations of the active Sun.

📄 PDF Abstract BibTeX arXiv:2403.05138

Code (0)

등록된 구현이 없습니다.

Tasks

feature selection

Methods 이 논문이 사용한 방법론

Feature Selection Feature selection, also known as variable selection, attribute selection or variable subset selection, is the process of selecting a subset of relevant features (variables,…

Features in Concert: Discriminative Feature Selection meets Unsupervised Clustering

2014-11-27 · Marius Leordeanu, Alexandra Radu, Rahul Sukthankar

Feature selection is an essential problem in computer vision, important for category learning and recognition. Along with the rapid development of a wide variety of visual features and classifiers, there is a growing nee…

Clustering feature selection

Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks

2026-02-16 · Sungwoo Kang arxiv

The Winner Determination Problem (WDP) in combinatorial auctions is NP-hard, and no existing method reliably predicts which instances will defeat fast greedy heuristics. The ML-for-combinatorial-optimization community ha…

Binary Classification

Labeling the Features Not the Samples: Efficient Video Classification with Minimal Supervision

2015-12-01 · Marius Leordeanu, Alexandra Radu, Shumeet Baluja, Rahul Sukthankar

Feature selection is essential for effective visual recognition. We propose an efficient joint classifier learning and feature selection method that discovers sparse, compact representations of input features from a vast…

Clustering feature selection General Classification Video Classification

Scalable Greedy Feature Selection via Weak Submodularity

2017-03-08 · Rajiv Khanna, Ethan Elenberg, Alexandros G. Dimakis, Sahand Negahban 외

Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high.…

feature selection

High-Order Conditional Mutual Information Maximization for dealing with High-Order Dependencies in Feature Selection

2022-07-18 · Francisco Souza, Cristiano Premebida, Rui Araújo

This paper presents a novel feature selection method based on the conditional mutual information (CMI). The proposed High Order Conditional Mutual Information Maximization (HOCMIM) incorporates high order dependencies in…

feature selection Vocal Bursts Intensity Prediction