Feature selection for automatic classification of non-Gaussian data
IEEE Transactions on Systems, Man and Cybernetics - Special issue on artificial intelligence
Evaluation of the branch and bound algorithm for feature selection
Pattern Recognition Letters
Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
Feature Selection: Evaluation, Application, and Small Sample Performance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Wrappers for feature subset selection
Artificial Intelligence - Special issue on relevance
Artificial intelligence: a new synthesis
Artificial intelligence: a new synthesis
A Monotonic Measure for Optimal Feature Selection
ECML '98 Proceedings of the 10th European Conference on Machine Learning
Performance evaluation of load distribution strategies in parallel branch and bound computations
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
A Parallel Optimal Branch-and-Bound Algorithm for MIN-Based Multiprocessors
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
OPUS: an efficient admissible algorithm for unordered search
Journal of Artificial Intelligence Research
Generalized spectral bounds for sparse LDA
ICML '06 Proceedings of the 23rd international conference on Machine learning
MILES: Multiple-Instance Learning via Embedded Instance Selection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Non-parametric classifier-independent feature selection
Pattern Recognition
Adaptive branch and bound algorithm for selecting optimal features
Pattern Recognition Letters
A hybrid genetic algorithm for feature selection wrapper based on mutual information
Pattern Recognition Letters
A multilevel tabu search algorithm for the feature selection problem in biomedical data
Computers & Mathematics with Applications
A parameterless feature ranking algorithm based on MI
Neurocomputing
Mixed feature selection based on granulation and approximation
Knowledge-Based Systems
Consistency measures for feature selection
Journal of Intelligent Information Systems
Feature selection with dynamic mutual information
Pattern Recognition
An improvement on floating search algorithms for feature subset selection
Pattern Recognition
Approximate nonmyopic sensor selection via submodularity and partitioning
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A rough set approach to feature selection based on ant colony optimization
Pattern Recognition Letters
On the selection of decision trees in random forests
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Information theoretic feature extraction for audio-visual speech recognition
IEEE Transactions on Signal Processing
Selecting discrete and continuous features based on neighborhood decision error minimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A novel feature selection approach by hybrid genetic algorithm
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
A new feature selection algorithm for multispectral and polarimetric vehicle images
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Multibody structure-and-motion segmentation by branch-and-bound model selection
IEEE Transactions on Image Processing
Classification of mycobacterium tuberculosis in images of ZN-stained sputum smears
IEEE Transactions on Information Technology in Biomedicine
Soft fuzzy rough sets for robust feature evaluation and selection
Information Sciences: an International Journal
Environmental Modelling & Software
Tournament searching method to feature selection problem
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
SFFS-MR: a floating search strategy for GRNs inference
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
Inference of restricted stochastic boolean GRN's by Bayesian error and entropy based criteria
CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
Information Sciences: an International Journal
Fast wrapper feature subset selection in high-dimensional datasets by means of filter re-ranking
Knowledge-Based Systems
International Journal of Computer Games Technology
Dimensionality reduction for evolving RBF networks with particle swarms
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
Feature selection in an electric billing database considering attribute inter-dependencies
ICDM'06 Proceedings of the 6th Industrial Conference on Data Mining conference on Advances in Data Mining: applications in Medicine, Web Mining, Marketing, Image and Signal Mining
Feature selection based on run covering
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Advances on automated multiple view inspection
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Efficient feature selection filters for high-dimensional data
Pattern Recognition Letters
Feature subset selection using separability index matrix
Information Sciences: an International Journal
Feature selection using dynamic weights for classification
Knowledge-Based Systems
A GA-based feature selection approach with an application to handwritten character recognition
Pattern Recognition Letters
Speeding up incremental wrapper feature subset selection with Naive Bayes classifier
Knowledge-Based Systems
Supervised feature subset selection with ordinal optimization
Knowledge-Based Systems
| Hi-index | 0.15 |
A novel search principle for optimal feature subset selection using the Branch & Bound method is introduced. Thanks to a simple mechanism for predicting criterion values, a considerable amount of time can be saved by avoiding many slow criterion evaluations. We propose two implementations of the proposed prediction mechanism that are suitable for use with nonrecursive and recursive criterion forms, respectively. Both algorithms find the optimum usually several times faster than any other known Branch & Bound algorithm. As the algorithm computational efficiency is crucial, due to the exponential nature of the search problem, we also investigate other factors that affect the search performance of all Branch & Bound algorithms. Using a set of synthetic criteria, we show that the speed of the Branch & Bound algorithms strongly depends on the diversity among features, feature stability with respect to different subsets, and criterion function dependence on feature set size. We identify the scenarios where the search is accelerated the most dramatically (finish in linear time), as well as the worst conditions. We verify our conclusions experimentally on three real data sets using traditional probabilistic distance criteria.