The DOI matches its Crossref record; 99 of the 99 references it cites were found in a registry or an index.
Prototype Selection for Nearest Neighbor Classification: Taxonomy and Empirical Study
Abstract
The nearest neighbor classifier is one of the most used and well-known techniques for performing recognition tasks. It has also demonstrated itself to be one of the most useful algorithms in data mining in spite of its simplicity. However, the nearest neighbor classifier suffers from several drawbacks such as high storage requirements, low efficiency in classification response, and low noise tolerance. These weaknesses have been the subject of study for many researchers and many solutions have been proposed. Among them, one of the most promising solutions consists of reducing the data used for establishing a classification rule (training data) by means of selecting relevant prototypes. Many prototype selection methods exist in the literature and the research in this area is still advancing. Different properties could be observed in the definition of them, but no formal categorization has been established yet. This paper provides a survey of the prototype selection methods proposed in the literature from a theoretical and empirical point of view. Considering a theoretical point of view, we propose a taxonomy based on the main characteristics presented in prototype selection and we analyze their advantages and drawbacks. Empirically, we conduct an experimental study involving different sizes of data sets for measuring their performance in terms of accuracy, reduction capabilities, and runtime. The results obtained by all the methods studied have been verified by nonparametric statistical tests. Several remarks, guidelines, and recommendations are made for the use of prototype selection for nearest neighbor classification.
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 Coefficient of Agreement for Nominal Scales
Cohen, J. (1960) · Educational and Psychological Measurement · doi:10.1177/001316446002000104 · Cited by 42,398
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 24,155
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
Individual Comparisons by Ranking Methods
Wilcoxon, F. (1945) · Biometrics Bulletin · doi:10.2307/3001968 · Cited by 15,354
Kohonen, T. (1990) · Proceedings of the IEEE · doi:10.1109/5.58325 · Cited by 8,414
A study of the behavior of several methods for balancing machine learning training data
Batista, G. E. A. P. A., Prati, R. C., & Monard, M. C. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007735 · Cited by 4,203
Devijver, P. A., & Kittler, J. (1982) · Prentice-Hall International eBooks · Cited by 2,910
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1998) · Journal of the ACM · doi:10.1145/293347.293348 · Cited by 2,300
García, S., Fernández, A., Luengo, J., & Herrera, F. (2010) · Information Sciences · doi:10.1016/j.ins.2009.12.010 · Cited by 2,229
Self-citation
Cited by
Big data preprocessing: methods and prospects
García, S., Ramírez-Gallego, S., Luengo, J., Benítez, J. M., & Herrera, F. (2016) · Big Data Analytics · doi:10.1186/s41044-016-0014-0 · Cited by 709
Self-citationMulti-class texture analysis in colorectal cancer histology
Kather, J. N., Weis, C.-A., Bianconi, F., Melchers, S. M., Schad, L. R., Gaiser, T., Marx, A., & Zöllner, F. G. (2016) · Scientific Reports · doi:10.1038/srep27988 · Cited by 578
A survey on data preprocessing for data stream mining: Current status and future directions
Ramírez-Gallego, S., Krawczyk, B., García, S., Woźniak, M., & Herrera, F. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.01.078 · Cited by 502
Self-citationDynamic classifier selection: Recent advances and perspectives
Cruz, R. M. O., Sabourin, R., & Cavalcanti, G. D. C. (2018) · Information Fusion · doi:10.1016/j.inffus.2017.09.010 · Cited by 440
EUSBoost: Enhancing ensembles for highly imbalanced data-sets by evolutionary undersampling
Galar, M., Fernández, A., Barrenechea, E., & Herrera, F. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2013.05.006 · Cited by 419
Self-citationUnder-sampling class imbalanced datasets by combining clustering analysis and instance selection
Tsai, C.-F., Lin, W.-C., Hu, Y.-H., & Yao, G.-T. (2019) · Information Sciences · doi:10.1016/j.ins.2018.10.029 · Cited by 329
Tutorial on practical tips of the most influential data preprocessing algorithms in data mining
García, S., Luengo, J., & Herrera, F. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.12.006 · Cited by 310
Self-citationKardani, N., Zhou, A., Nazem, M., & Shen, S.-L. (2021) · Journal of Rock Mechanics and Geotechnical Engineering · doi:10.1016/j.jrmge.2020.05.011 · Cited by 285
Evolutionary undersampling boosting for imbalanced classification of breast cancer malignancy
Krawczyk, B., Galar, M., Jeleń, Ł., & Herrera, F. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2015.08.060 · Cited by 263
Self-citationData preprocessing in predictive data mining
Alexandropoulos, S.-A. N., Kotsiantis, S. B., & Vrahatis, M. N. (2019) · The Knowledge Engineering Review · doi:10.1017/s026988891800036x · Cited by 209
An efficient instance selection algorithm to reconstruct training set for support vector machine
Liu, C., Wang, W., Wang, M., Lv, F., & Konan, M. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.10.031 · Cited by 146
Metadata
- Authors
- Garcia, S., Derrac, J., Cano, J. R., & Herrera, F.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2012-03
- Volume
- 34
- Issue
- 3
- Pages
- 417-435
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2151537585
- Cited by
- 695
- References
- 99
- FWCI
- 38.73
- 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.