The DOI matches its Crossref record.
Nearest prototype classification: clustering, genetic algorithms, or random search?
Abstract
Three questions related to the nearest prototype classifier (NPC) are addressed: when is it better to construct the prototypes instead of selecting them as a subset of the given labeled data; how can we trade classification accuracy for a reduction in the number of prototypes; and how good is pure random search (RS) for selection of prototypes from the data? We compare the resubstitution performance of the NPC on the IRIS data set, where the prototypes are either extracted by replacement (R-prototypes) or by selection (S-prototypes). Results for the R-prototypes are taken from a previous study and are contrasted with S-prototype results obtained by a genetic algorithm (GA) or by RS. The best results reached by both algorithms (GA and RS), followed by resubstitution NPC, are two errors with sets of three S-prototypes. This compares favorably to the best result found with R-prototypes, viz., three errors with five R-prototypes. Based on our results, we recommend GA selection for the NPC. A by-product of this research is a counter example to minimality of a recently published minimal consistent set selection procedure.
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
Cited by
A Review on Evaluation Metrics for Data Classification Evaluations
M, H., & M.N, S. (2015) · International Journal of Data Mining & Knowledge Management Process · doi:10.5121/ijdkp.2015.5201 · Cited by 2,693
“Most of PS classifiers such as Monte Carlo Sampling (MCS) algorithm [32] genetic algorithm [22], evolutionary algorithm [10], and tabu search [38] were developed based on statistics, natureinspired , optimization methods or combination of these methods.”
Method(2016) · neural information processing systems · Cited by 556
GA-fuzzy modeling and classification: complexity and performance
Setnes, M., & Roubos, H. (2000) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.873575 · Cited by 473
The Impact of Automated Parameter Optimization on Defect Prediction Models
Tantithamthavorn, C., McIntosh, S., Hassan, A. E., & Matsumoto, K. (2019) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2018.2794977 · Cited by 415
Evolutionary Undersampling for Classification with Imbalanced Datasets: Proposals and Taxonomy
García, S., & Herrera, F. (2009) · Evolutionary Computation · doi:10.1162/evco.2009.17.3.275 · Cited by 414
A review of instance selection methods
Olvera-López, J. A., Carrasco-Ochoa, J. A., Martínez-Trinidad, J. F., & Kittler, J. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-010-9165-y · Cited by 394
Multisource Transfer Learning for Cross-Subject EEG Emotion Recognition
Li, J., Qiu, S., Shen, Y.-Y., Liu, C.-L., & He, H. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2904052 · Cited by 353
Adversarial Reciprocal Points Learning for Open Set Recognition
Chen, G., Peng, P., Wang, X., & Tian, Y. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3106743 · Cited by 344
Dynamic clustering using particle swarm optimization with application in image segmentation
Omran, M. G. H., Salman, A., & Engelbrecht, A. P. (2006) · Pattern Analysis and Applications · doi:10.1007/s10044-005-0015-5 · Cited by 292
Probabilistic neural-network structure determination for pattern classification
Mao, K. Z., Tan, K.-C., & Ser, W. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.857781 · Cited by 283
New Applications of Ensembles of Classifiers
Barandela, R., Valdovinos, R. M., & S�nchez, J. S. (2003) · Pattern Analysis & Applications · doi:10.1007/s10044-003-0192-z · Cited by 280
Selecting Representative Data Sets
Borovicka, T., Jirina, M., Kordik, P., & Jiri, M. (2012) · Advances in Data Mining Knowledge Discovery and Applications · doi:10.5772/50787 · Cited by 94
Metadata
- Authors
- Kuncheva, L. I., & Bezdek, J. C.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
- Published
- 1998
- Volume
- 28
- Issue
- 1
- Pages
- 160-164
- ISSN
- 1094-6977 (ISSN-L)
- OpenAlex
- W2136137122
- Cited by
- 214
- References
- 0
- FWCI
- 8.75
- 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.