The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Data dimensionality reduction with application to simplifying rbf network structure and improving classification performance
Open accessAbstract
For high dimensional data, if no preprocessing is carried out before inputting patterns to classifiers, the computation required may be too heavy. For example, the number of hidden units of a radial basis function (RBF) neural network can be too large. This is not suitable for some practical applications due to speed and memory constraints. In many cases, some attributes are not relevant to concepts in the data at all. In this paper, we propose a novel separability-correlation measure (SCM) to rank the importance of attributes. According to the attribute ranking results, different attribute subsets are used as inputs to a classifier, such as an RBF neural network. Those attributes that increase the validation error are deemed irrelevant and are deleted. The complexity of the classifier can thus be reduced and its classification performance improved. Computer simulations show that our method for attribute importance ranking leads to smaller attribute subsets with higher accuracies compared with the existing SUD and Relief-F methods. We also propose a modified method for efficient construction of an RBF classifier. In this method we allow for large overlaps between clusters corresponding to the same class label. Our approach significantly reduces the structural complexity of the RBF network and improves the classification performance.
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Fast Learning in Networks of Locally-Tuned Processing Units
Moody, J., & Darken, C. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.281 · Cited by 4,194
Estimating attributes: Analysis and extensions of RELIEF
Kononenko, I. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-57868-4_57 · Cited by 2,958
Devijver, P. A., & Kittler, J. (1982) · Prentice-Hall International eBooks · Cited by 2,910
Fisher discriminant analysis with kernels
Mika, S., Ratsch, G., Weston, J., Scholkopf, B., & Mullers, K. R. (2003) · Neural Networks for Signal Processing IX: Proceedings of the 1999 IEEE Signal Processing Society Workshop (Cat. No.98TH8468) · doi:10.1109/nnsp.1999.788121 · Cited by 2,661
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
Neural Network for Pattern Recognition
Mukherjee, A. (2018) · Cited by 412
Dimensionality reduction of unsupervised data
Dash, M., Liu, H., & Yao, J. (2002) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/tai.1997.632300 · Cited by 178
Enhanced Fisher linear discriminant models for face recognition
Liu, C., & Wechsler, H. (2002) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1998.711956 · Cited by 126
An algorithm to generate radial basis function (RBF)-like nets for classification problems
Roy, A., Govil, S., & Miranda, R. (1995) · Neural Networks · doi:10.1016/0893-6080(94)00064-s · Cited by 121
A neural-network learning theory and a polynomial time RBF algorithm
Roy, A., Govil, S., & Miranda, R. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.641453 · Cited by 84
Efficient training of RBF networks for classification
Nabney, I. T. (1999) · International Conference on Artificial Neural Networks · doi:10.1049/cp:19991110 · Cited by 79
An adaptive learning algorithm for principal component analysis
Chen, L.-H., & Chang, S. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.410369 · Cited by 57
Fast nonlinear dimension reduction
Kambhatla, N., & Leen, T. K. (2002) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1993.298730 · Cited by 43
Cited by
Qiu, S., Zhao, H., Jiang, N., Wang, Z., Liu, L., An, Y., Zhao, H., Miao, X., Liu, R., & Fortino, G. (2022) · Information Fusion · doi:10.1016/j.inffus.2021.11.006 · Cited by 671
Pourbabaee, B., Roshtkhari, M. J., & Khorasani, K. (2018) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2017.2705582 · Cited by 411
Feature selection methods for big data bioinformatics: A survey from the search perspective
Wang, L., Wang, Y., & Chang, Q. (2016) · Methods · doi:10.1016/j.ymeth.2016.08.014 · Cited by 331
Self-citationLiu, T., Huang, J., Liao, T., Pu, R., Liu, S., & Peng, Y. (2022) · IRBM · doi:10.1016/j.irbm.2020.12.002 · Cited by 137
Metadata
- Authors
- Fu, X., & Wang, L.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
- Published
- 2003-06
- Volume
- 33
- Issue
- 3
- Pages
- 399-409
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2151419026
- Cited by
- 312
- References
- 15
- FWCI
- 10.25
- 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.