The DOI matches its Crossref record.
A Branch and Bound Algorithm for Feature Subset Selection
Abstract
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. Existing procedures for feature subset selection, such as sequential selection and dynamic programming, do not guarantee optimality of the selected feature subset. Exhaustive search, on the other hand, is generally computationally unfeasible. The present algorithm is very efficient and it selects the best subset without exhaustive search. Computational aspects of the algorithm are discussed. Results of several experiments demonstrate the very substantial computational savings realized. For example, the best 12-feature set from a 24-feature set was selected with the computational effort of evaluating only 6000 subsets. Exhaustive search would require the evaluation of 2 704 156 subsets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A survey on feature selection methods
Chandrashekar, G., & Sahin, F. (2014) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2013.11.024 · Cited by 5,189
(1998) · Cited by 3,476
An introduction to multisensor data fusion
Hall, D. L., & Llinas, J. (1997) · Proceedings of the IEEE · doi:10.1109/5.554205 · Cited by 2,629
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018) · ACM Computing Surveys · doi:10.1145/3136625 · Cited by 2,442
Chen, C. L. P., & Liu, Z. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2716952 · Cited by 1,957
Particle Swarm Optimization: A Comprehensive Survey
Shami, T. M., El-Saleh, A. A., Alswaitti, M., Al-Tashi, Q., Summakieh, M. A., & Mirjalili, S. (2022) · IEEE Access · doi:10.1109/access.2022.3142859 · Cited by 1,584
Relief-based feature selection: Introduction and review
Urbanowicz, R. J., Meeker, M., La Cava, W., Olson, R. S., & Moore, J. H. (2018) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2018.07.014 · Cited by 1,311
Machine learning in bioinformatics
Larrañaga, P., Calvo, B., Santana, R., Bielza, C., Galdiano, J., Inza, I., Lozano, J. A., Armañanzas, R., Santafé, G., Pérez, A., et al. (2006) · Briefings in Bioinformatics · doi:10.1093/bib/bbk007 · Cited by 867
Feature dimensionality reduction: a review
Jia, W., Sun, M., Lian, J., & Hou, S. (2022) · Complex & Intelligent Systems · doi:10.1007/s40747-021-00637-x · Cited by 797
Feature selection with multi-view data: A survey
Zhang, R., Nie, F., Li, X., & Wei, X. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.019 · Cited by 313
An Efficient Application Partitioning Algorithm in Mobile Environments
Wu, H., Knottenbelt, W. J., & Wolter, K. (2019) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2019.2891695 · Cited by 125
Druckmann, S., Hill, S., Schürmann, F., Markram, H., & Segev, I. (2013) · Cerebral Cortex · doi:10.1093/cercor/bhs290 · Cited by 66
Higher order statistics and neural network for tremor recognition
Jakubowski, J., Kwiatos, K., Chwaleba, A., & Osowski, S. (2002) · IEEE Transactions on Biomedical Engineering · doi:10.1109/10.979354 · Cited by 78
Feature Augmentation with Reinforcement Learning
Liu, J., Chai, C., Luo, Y., Lou, Y., Feng, J., & Tang, N. (2022) · 2022 IEEE 38th International Conference on Data Engineering (ICDE) · doi:10.1109/icde53745.2022.00317 · Cited by 33
Arruti, A., Cearreta, I., Álvarez, A., Lazkano, E., & Sierra, B. (2014) · PLoS ONE · doi:10.1371/journal.pone.0108975 · Cited by 21
Metadata
- Authors
- Narendra, & Fukunaga
- Venue
- IEEE Transactions on Computers
- Published
- 1977-09
- Volume
- C-26
- Issue
- 9
- Pages
- 917-922
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W1523989055
- Cited by
- 1,245
- References
- 0
- FWCI
- 3.32
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
