The DOI matches its Crossref record.
Estimating Optimal Feature Subsets Using Efficient Estimation of High-Dimensional Mutual Information
Abstract
A novel feature selection method using the concept of mutual information (MI) is proposed in this paper. In all MI based feature selection methods, effective and efficient estimation of high-dimensional MI is crucial. In this paper, a pruned Parzen window estimator and the quadratic mutual information (QMI) are combined to address this problem. The results show that the proposed approach can estimate the MI in an effective and efficient way. With this contribution, a novel feature selection method is developed to identify the salient features one by one. Also, the appropriate feature subsets for classification can be reliably estimated. The proposed methodology is thoroughly tested in four different classification applications in which the number of features ranged from less than 10 to over 15,000. The presented results are very promising and corroborate the contribution of the proposed feature selection methodology.
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
Normalized Mutual Information Feature Selection
Estevez, P. A., Tesmer, M., Perez, C. A., & Zurada, J. M. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005601 · Cited by 1,288
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
Building an Intrusion Detection System Using a Filter-Based Feature Selection Algorithm
Ambusaidi, M. A., He, X., Nanda, P., & Tan, Z. (2016) · IEEE Transactions on Computers · doi:10.1109/tc.2016.2519914 · Cited by 646
Unler, A., Murat, A., & Chinnam, R. B. (2011) · Information Sciences · doi:10.1016/j.ins.2010.05.037 · Cited by 319
Non-linear variable selection for artificial neural networks using partial mutual information
May, R. J., Maier, H. R., Dandy, G. C., & Fernando, T. M. K. G. (2008) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2008.03.007 · Cited by 310
Metadata
- Authors
- Chow, T. W. S., & Huang, D.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2005-01
- Volume
- 16
- Issue
- 1
- Pages
- 213-224
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2129977294
- Cited by
- 163
- References
- 0
- FWCI
- 11.55
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Estimating Optimal Feature Subsets Using Efficient Estimation of High-Dimensional Mutual Information. https://app.cochat.ai/papers/10.1109/tnn.2004.841414
- The paper
- Chow, T. W. S., & Huang, D. (2005). Estimating Optimal Feature Subsets Using Efficient Estimation of High-Dimensional Mutual Information. IEEE Transactions on Neural Networks. https://doi.org/10.1109/tnn.2004.841414
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.