C-focus: A continuous extension of focus

A Arauzo, JM Benitez, JL Castro - Advances in Soft Computing …, 2003 - Springer
This paper deals with the problem of feature selection. Almuallim and Dieterich [1]
developed the FOCUS algorithm which performs optimal feature selection on boolean …

[引用][C] A note on some feature selection criteria

CE Queiros, ES Gelsema - Pattern recognition letters, 1989 - Elsevier
A note on some feature selection criteria Page 1 Pattern Recognition Letters 10 (1989) 155 158
September 1989 North-Holland A note on some feature selection criteria CE QUEIROS Dept …

Projection-based measure for efficient feature selection

R Ruiz, JC Riquelme… - Journal of Intelligent & …, 2002 - content.iospress.com
The attribute selection techniques for supervised learning, used in the preprocessing phase
to emphasize the most relevant attributes, allow making models of classification simpler and …

Feature selection and transformation

F Escolano, P Suau, B Bonev - Information Theory in Computer Vision and …, 2009 - Springer
A fundamental problem in pattern classification is to work with a set of features which are
appropriate for the classification requirements. The first step is the feature extraction. In …

Optimum feature selection by zero-one integer programming

M Ichino, J Sklansky - IEEE transactions on systems, man, and …, 1984 - ieeexplore.ieee.org
An optimal method for finding a minimum feature subset based on box classifiers is
described. Feature selection is represented as a problem of zero-one integer programming …

[PDF][PDF] Genetic search for feature subset selection: A comparison between CHC and GENESIS

C Guerra-Salcedo, D Whitley - SGA'98. Symposium on Genetic …, 1998 - researchgate.net
Classification problems map an object to a particular class using a set of available features.
The problem is how to choose the best subset of features that provide an accurate …

An improved branch and bound algorithm for feature selection

X Chen - Pattern Recognition Letters, 2003 - Elsevier
Feature selection plays an important role in pattern classification. In this paper, we present
an improved branch and bound algorithm for optimal feature subset selection. This algorithm …

A monotonic measure for optimal feature selection

H Liul, H Motoda, M Dash - Machine Learning: ECML-98: 10th European …, 1998 - Springer
Feature selection is a problem of choosing a subset of relevant features. In general, only
exhaustive search can bring about the optimal subset. With a monotonic measure …

Evaluation of the branch and bound algorithm for feature selection

Y Hamamoto, S Uchimura, Y Matsuura… - Pattern Recognition …, 1990 - Elsevier
Narendra and Fukunaga show that the branch and bound algorithm guarantees the optimal
feature subset without evaluating all possible feature subsets, if the criterion function used …

Best first strategy for feature selection

L Xu, P Yan, T Chang - 9th international conference on pattern …, 1988 - computer.org
A heuristic search strategy taken from the field of artificial intelligence is applied to feature
selection. An algorithm called BFF for feature selection is proposed. It is proved that this …