The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Normalized Mutual Information Feature Selection
Open accessAbstract
A filter method of feature selection based on mutual information, called normalized mutual information feature selection (NMIFS), is presented. NMIFS is an enhancement over Battiti's MIFS, MIFS-U, and mRMR methods. The average normalized mutual information is proposed as a measure of redundancy among features. NMIFS outperformed MIFS, MIFS-U, and mRMR on several artificial and benchmark data sets without requiring a user-defined parameter. In addition, NMIFS is combined with a genetic algorithm to form a hybrid filter/wrapper method called GAMIFS. This includes an initialization procedure and a mutation operator based on NMIFS to speed up the convergence of the genetic algorithm. GAMIFS overcomes the limitations of incremental search algorithms that are unable to find dependencies between groups of features.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Peng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
Information theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
Statistical pattern recognition: a review
Jain, A. K., Duin, P. W., & Mao, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824819 · Cited by 6,767
Independent coordinates for strange attractors from mutual information
Fraser, A. M., & Swinney, H. L. (1986) · Physical Review A · doi:10.1103/physreva.33.1134 · Cited by 4,606
Introduction to statistical pattern recognition (2nd ed.)
Fukunaga, K. (1990) · Academic Press Professional, Inc. eBooks · Cited by 3,797
Feature selection for classification
DASH, M., & LIU, H. (1997) · Intelligent Data Analysis · doi:10.1016/s1088-467x(97)00008-5 · Cited by 3,574
Kraskov, A., Stögbauer, H., & Grassberger, P. (2004) · Physical Review E · doi:10.1103/physreve.69.066138 · Cited by 3,512
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322753616 · Cited by 3,502
(1998) · Cited by 3,476
A fuzzy-logic-based approach to qualitative modeling
Sugeno, M., & Yasukawa, T. (1993) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.1993.390281 · Cited by 2,411
Irrelevant Features and the Subset Selection Problem
John, G. H., Kohavi, R., & Pfleger, K. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50023-4 · Cited by 2,368
Using mutual information for selecting features in supervised neural net learning
Battiti, R. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.298224 · Cited by 2,148
Efficient Feature Selection via Analysis of Relevance and Redundancy
Yu, L., & Liu, H. (2004) · doi:10.5555/1005332.1044700 · Cited by 1,983
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Input feature selection for classification problems
Kwak, N., & Choi, C.-H. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/72.977291 · Cited by 938
Niching methods for genetic algorithms
Mahfoud, S. W. (1996) · Cited by 897
Consistency-based search in feature selection
Dash, M., & Liu, H. (2003) · Artificial Intelligence · doi:10.1016/s0004-3702(03)00079-1 · Cited by 889
Dimensionality reduction using genetic algorithms
Raymer, M. L., Punch, W. F., Goodman, E. D., Kuhn, L. A., & Jain, A. K. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.850656 · Cited by 840
A note on genetic algorithms for large-scale feature selection
Siedlecki, W., & Sklansky, J. (1989) · Pattern Recognition Letters · doi:10.1016/0167-8655(89)90037-8 · Cited by 806
A NOTE ON GENETIC ALGORITHMS FOR LARGE-SCALE FEATURE SELECTION
SIEDLECKI, W., & SKLANSKY, J. (1993) · Handbook of Pattern Recognition and Computer Vision · doi:10.1142/9789814343138_0005 · Cited by 765
Information Theory and Statistics
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch11 · Cited by 729
A Test for Normality Based on Sample Entropy
Vasicek, O. (1976) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1976.tb01566.x · Cited by 673
An Introduction to Genetic Algorithms.
Heiss-Czedik, D. (1997) · Artificial Life · doi:10.1162/artl.1997.3.1.63 · Cited by 668
Input feature selection by mutual information based on Parzen window
Kwak, N., & Choi, C.-H. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1114861 · Cited by 641
Information Theoretic Learning
Erdogmus, D., & Principe, J. C. (2009) · Encyclopedia of Artificial Intelligence · doi:10.4018/978-1-59904-849-9.ch133 · Cited by 506
Estimating Optimal Feature Subsets Using Efficient Estimation of High-Dimensional Mutual Information
Chow, T. W. S., & Huang, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.841414 · Cited by 163
A hybrid filter/wrapper approach of feature selection using information theory
Sebban, M., & Nock, R. (2002) · Pattern Recognition · doi:10.1016/s0031-3203(01)00084-x · Cited by 160
Feature extraction using information-theoretic learning
Hild, K. E., Erdogmus, D., Torkkola, K., & Principe, J. C. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.186 · Cited by 160
Feature selection from huge feature sets
Bins, J., & Draper, B. A. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2001.937619 · Cited by 140
Feature Selection in MLPs and SVMs Based on Maximum Output Information
Sindhwani, V., Rakshit, S., Deodhare, D., Deniz Erdogmus, B., Príncipe, J. C., & Niyogi, P. (2004) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.828772 · Cited by 109
Bonev, B., Escolano, F., & Cazorla, M. (2008) · Pattern Analysis and Applications · doi:10.1007/s10044-008-0107-0 · Cited by 70
Partial BFGS Update and Efficient Step-Length Calculation for Three-Layer Neural Networks
Saito, K., & Nakano, R. (1997) · Neural Computation · doi:10.1162/neco.1997.9.1.123 · Cited by 58
AMIFS: adaptive feature selection by using mutual information
Tesmer, M., & Estévez, P. A. (2005) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2004.1379918 · Cited by 33
Self-citation
Cited by
Machine Learning Applications in Cancer Prognosis and Prediction
Kourou, K., Exarchos, T. P., Exarchos, K. P., Karamouzis, M. V., & Fotiadis, D. I. (2015) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2014.11.005 · Cited by 3,338
A Survey on Evolutionary Computation Approaches to Feature Selection
Xue, B., Zhang, M., Browne, W. N., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2504420 · Cited by 1,841
A review of feature selection methods based on mutual information
Vergara, J. R., & Estévez, P. A. (2014) · Neural Computing and Applications · doi:10.1007/s00521-013-1368-0 · Cited by 1,255
Ghamisi, P., Yokoya, N., Li, J., Liao, W., Liu, S., Plaza, J., Rasti, B., & Plaza, A. (2017) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2017.2762087 · Cited by 909
Whale optimization approaches for wrapper feature selection
Mafarja, M., & Mirjalili, S. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.11.006 · Cited by 825
Metadata
- Authors
- Estevez, P. A., Tesmer, M., Perez, C. A., & Zurada, J. M.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2009-02
- Volume
- 20
- Issue
- 2
- Pages
- 189-201
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2156483112
- Cited by
- 1,288
- References
- 41
- FWCI
- 35.42
- Type
- journal article
- Language
- en
- Open access
- green
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.