Adaptive branch and bound algorithm for selecting optimal features
- 1 September 2007
- journal article
- research article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 28 (12), 1415-1427
- https://doi.org/10.1016/j.patrec.2007.02.015
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Fast branch & bound algorithms for optimal feature selectionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- An improved branch and bound algorithm for feature selectionPattern Recognition Letters, 2003
- Waveband selection for hyperspectral data: optimal feature selectionPublished by SPIE-Intl Soc Optical Eng ,2003
- Comparison of algorithms that select features for pattern classifiersPattern Recognition, 2000
- Feature selection: evaluation, application, and small sample performanceIEEE Transactions on Pattern Analysis and Machine Intelligence, 1997
- Floating search methods in feature selectionPattern Recognition Letters, 1994
- Comparative study of techniques for large-scale feature selection* *This work was suported by a SERC grant GR/E 97549. The first author was also supported by a FPI grant from the Spanish MEC, PF92 73546684Published by Elsevier ,1994
- A Branch and Bound Algorithm for Feature Subset SelectionIEEE Transactions on Computers, 1977
- A Direct Method of Nonparametric Measurement SelectionIEEE Transactions on Computers, 1971
- On the effectiveness of receptors in recognition systemsIEEE Transactions on Information Theory, 1963