On a class of computationally efficient feature selection criteria
From MaRDI portal
Recommendations
- Efficient feature selection via analysis of relevance and redundancy
- Feature selection algorithms in classification problems: an experimental evaluation
- Feature selection algorithms in classification problems: an experimental evaluation
- Computational Methods of Feature Selection
- Toward a Fundamental Theory of Optimal Feature Selection: Part II-Implementation and Computational Complexit
- Toward optimal feature selection using ranking methods and classification algorithms
- A feature selection algorithm based on classification complementarity
Cites work
Cited in
(14)- On information and distance measures, error bounds, and feature selection
- Feature definition in pattern recognition with small sample size
- Robust hierarchical feature selection driven by data and knowledge
- On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts
- Toward a Fundamental Theory of Optimal Feature Selection: Part I
- An improved branch \& bound algorithm in feature selection
- scientific article; zbMATH DE number 2042277 (Why is no real title available?)
- A divergence criterion for classifier-independent feature selection
- scientific article; zbMATH DE number 6982930 (Why is no real title available?)
- Anytime algorithm for feature selection
- scientific article; zbMATH DE number 4114104 (Why is no real title available?)
- On feature selection with measurement cost and grouped features
- Toward optimal feature selection using ranking methods and classification algorithms
- A centroid-based gene selection method for microarray data classification
This page was built for publication: On a class of computationally efficient feature selection criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1222525)