The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Input feature selection for classification problems
Abstract
Feature selection plays an important role in classifying systems such as neural networks (NNs). We use a set of attributes which are relevant, irrelevant or redundant and from the viewpoint of managing a dataset which can be huge, reducing the number of attributes by selecting only the relevant ones is desirable. In doing so, higher performances with lower computational effort is expected. In this paper, we propose two feature selection algorithms. The limitation of mutual information feature selector (MIFS) is analyzed and a method to overcome this limitation is studied. One of the proposed algorithms makes more considered use of mutual information between input attributes and output classes than the MIFS. What is demonstrated is that the proposed method can provide the performance of the ideal greedy selection algorithm when information is distributed uniformly. The computational load for this algorithm is nearly the same as that of MIFS. In addition, another feature selection algorithm using the Taguchi method is proposed. This is advanced as a solution to the question as to how to identify good features with as few experiments as possible. The proposed algorithms are applied to several classification problems and compared with MIFS. These two algorithms can be combined to complement each other's limitations. The combined algorithm performed well in several experiments and should prove to be a useful method in selecting features for classification problems.
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
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,387
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
(1992) · Cited by 23,431
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
(2005) · Technometrics · doi:10.1198/tech.2005.s303 · Cited by 17,923
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Classification and regression trees
Praagman, J. (1985) · European Journal of Operational Research · doi:10.1016/0377-2217(85)90321-2 · Cited by 10,053
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
Fisher, R. A. (1936) · BMJ · doi:10.1136/bmj.1.3923.554-a · Cited by 4,980
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
Applied Regression Analysis (2nd ed).
de Carvalho, J. F., Draper, N. R., & Smith, H. (1981) · Journal of the American Statistical Association · doi:10.2307/2287608 · Cited by 3,044
Data mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
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
Clarke, G. M., Draper, N. R., & Smith, H. (1982) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2982106 · Cited by 1,788
Database mining: a performance perspective
Agrawal, R., Imielinski, T., & Swami, A. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250074 · Cited by 1,505
Correlation-based Feature Subset Selection for Machine Learning
Hall, M. A. (1998) · Cited by 955
Taguchi on Robust Technology Development: Bringing Quality Engineering Upstream
Taguchi, G. (1993) · ASME Press eBooks · doi:10.1115/1.800288 · Cited by 536
The MONK's problems: A Performance Comparison of Different Learning Algorithms
Thrun, S., Bala, J. W., Bloedorn, E., Bratko, I., Cestnik, B., Cheng, J. Q., Jong, K. A. D., Džeroski, S., Fisher, D., Fahlman, S. E., et al. (1991) · doi:10.13021/mars/3370 · Cited by 445
Cherkassky, V., & Mulier, F. M. (1998) · Cited by 384
Neural-network feature selector
Setiono, R., & Liu, H. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572104 · Cited by 379
Determining input features for multilayer perceptrons
Belue, L. M., & Bauer, K. W. (1995) · Neurocomputing · doi:10.1016/0925-2312(94)e0053-t · Cited by 147
Knowledge mining by imprecise querying: a classification-based approach
Anwar, T. M., Beck, H., & Navathe, S. B. (2003) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.1992.213146 · Cited by 77
Integrated feature architecture selection
Steppe, J. M., Bauer, K. W., & Rogers, S. K. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.508942 · Cited by 69
Using Taguchi's method of experimental design to control errors in layered perceptrons
Peterson, G. E., Clair, D. C. S., Aylward, S., & Bond, W. E. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.392257 · Cited by 47
Feature selection via the discovery of simple classification rules
Holmes, G., & Nevill-Manning, C. G. (1995) · Cited by 39
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
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
Feature selection using Joint Mutual Information Maximisation
Bennasar, M., Hicks, Y., & Setchi, R. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.07.007 · Cited by 659
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
Metadata
- Authors
- Kwak, N., & Choi, C.-H.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2002
- Volume
- 13
- Issue
- 1
- Pages
- 143-159
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2113890143
- Cited by
- 938
- References
- 28
- FWCI
- 19.40
- 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.