Floating search methods in feature selection
Pattern Recognition LettersPublished 1 November 1994
Pavel Pudil, Jana Novovičová, Josef Kittler
Citations3,070
SJR quartileQ1
SJR score1.00
SNIP1.43
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Sequential search methods characterized by a dynamically changing number of features included or eliminated at each step, henceforth "floating" methods, are presented. They are shown to give very good results and to be computationally more effective than the branch and bound method.
Keywords
Computer Science
IEEE Transactions on ComputersA Branch and Bound Algorithm for Feature Subset Selection
1,240 Citations1977Narendra, Fukunaga
A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features from an n-feature set with the computational effort of evaluating only 6000 subsets.
IEEE Transactions on ComputersA Direct Method of Nonparametric Measurement Selection
831 Citations1971A.W. Whitney
A direct method of measurement selection is proposed to determine the best subset of d measurements out of a set of D total measurements, using a nonparametric estimate of the probability of error given a finite design sample set.
IEEE Transactions on Information TheoryOn the effectiveness of receptors in recognition systems
655 Citations1963Thomas Marill, D. Green
Some of the theoretical problems encountered in trying to determine a more formal measure of the effectiveness of a set of tests are discussed; a measure which might be a practical substitute for the empirical evaluation.
International Journal of Pattern Recognition and Artificial IntelligenceON AUTOMATIC FEATURE SELECTION
391 Citations1988Wojciech Siedlecki, Jack Sklansky
The potential benefits of Monte Carlo approaches such as simulated annealing and genetic algorithms are described and compared to facilitate the planning of future research on feature selection.
IEEE Transactions on Systems Science and CyberneticsFeature Selection in Pattern Recognition
88 Citations1970K. S. Fu, P. Min +1 more
Computer similation results are presented and compared and feature selection techniques discussed include 1) information theoretic approach, 2) direct estimation of error probability, 3) feature-space transformation, and 4) approach of using stochastic automata model.
IEEE Transactions on Systems Man and CyberneticsExperimental Study of Information Measure and Inter-Intra Class Distance Ratios on Feature Selection and Orderings
56 Citations1973Mark Michael, Wen-Chun Lin
This paper describes the results of experimental investigation of two-feature evaluation criteria, i.e., inter-intra class distance ratio and information content measure, and believes that the criteria can be used for other applications and can especially be used where the statistical independency among features is not assumed.
IEEE Transactions on Systems Man and CyberneticsOptimum feature selection by zero-one integer programming
36 Citations1984Manabu Ichino, Jack Sklansky
An optimal method for finding a minimum feature subset based on box classifiers is described, and numerical examples are presented to illustrate the effectiveness of the approach.
Feature Selection in Pattern Recognition
21 Citations1975N. Ahmed, K.R. Rao
The subject of pattern recognition can be divided into two main areas of study: feature selection and classifier design, as summarized in Fig. 10.1.
Pattern Recognition LettersAn analysis of the Max-Min approach to feature selection and ordering
14 Citations1993Pavel Pudil, Jana Novovičová +2 more
It is shown that the theoretical premise providing the basis for the Max-Min algorithm is not necessarily valid and a condition under which theMax-Min algorithms is not justified is derived, and a counterexample illustrating it is presented.