The DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
A Taxonomy and Experimental Study on Prototype Generation for Nearest Neighbor Classification
Open accessAbstract
The nearest neighbor (NN) rule is one of the most successfully used techniques to resolve classification and pattern recognition tasks. Despite its high classification accuracy, this rule suffers from several shortcomings in time response, noise sensitivity, and high storage requirements. These weaknesses have been tackled by many different approaches, including a good and well-known solution that we can find in the literature, which consists of the reduction of the data used for the classification rule (training data). Prototype reduction techniques can be divided into two different approaches, which are known as prototype selection and prototype generation (PG) or abstraction. The former process consists of choosing a subset of the original training data, whereas PG builds new artificial prototypes to increase the accuracy of the NN classification. In this paper, we provide a survey of PG methods specifically designed for the NN rule. From a theoretical point of view, we propose a taxonomy based on the main characteristics presented in them. Furthermore, from an empirical point of view, we conduct a wide experimental study that involves small and large datasets to measure their performance in terms of accuracy and reduction capabilities. The results are contrasted through nonparametrical statistical tests. Several remarks are made to understand which PG models are appropriate for application to different datasets.
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
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865
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 25,411
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
He, H., & Garcia, E. A. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.239 · Cited by 10,359
Witten, I. H. (2008) · Cited by 9,143
Kohonen, T. (1990) · Proceedings of the IEEE · doi:10.1109/5.58325 · Cited by 8,414
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Barker, L. (2002) · Technometrics · doi:10.1198/tech.2002.s659 · Cited by 2,477
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-citationAsymptotic Properties of Nearest Neighbor Rules Using Edited Data
Wilson, D. L. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309137 · Cited by 2,130
Learning from Data: Concepts, Theory, and Methods
Cherkassky, V., & Mulier, F. M. (1998) · Cited by 1,783
The condensed nearest neighbor rule (Corresp.)
Hart, P. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054155 · Cited by 1,733
CLASSIFICATION OF IMBALANCED DATA: A REVIEW
SUN, Y., WONG, A. K. C., & KAMEL, M. S. (2009) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001409007326 · Cited by 1,692
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006559212014 · Cited by 1,671
García, S., & Herrera, F. (2008) · Institutional Repository of the University of Granada (University of Granada) · Cited by 1,619
Self-citationKEEL: a software tool to assess evolutionary algorithms for data mining problems
Alcalá-Fdez, J., Sánchez, L., García, S., del Jesus, M. J., Ventura, S., Garrell, J. M., Otero, J., Romero, C., Bacardit, J., Rivas, V. M., et al. (2009) · Soft Computing · doi:10.1007/s00500-008-0323-y · Cited by 1,505
Self-citationImproved Heterogeneous Distance Functions
Wilson, D. R., & Martinez, T. R. (1997) · Journal of Artificial Intelligence Research · doi:10.1613/jair.346 · Cited by 1,344
Introduction to Machine Learning
(2010) · Kybernetes · doi:10.1108/k.2010.06739hae.001 · Cited by 1,183
Reduction Techniques for Instance-Based Learning Algorithms
Wilson, D. R., & Martinez, T. R. (2000) · Machine Learning · doi:10.1023/a:1007626913721 · Cited by 1,182
Statistical Comparisons of Classifiers over Multiple Data Sets
DemšarJanez (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248548 · Cited by 1,074
Particle Swarm Optimization in Wireless-Sensor Networks: A Brief Survey
Kulkarni, R. V., & Venayagamoorthy, G. K. (2011) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2010.2054080 · Cited by 732
Wettschereck, D., Aha, D. W., & Mohri, T. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006593614256 · Cited by 717
García, S., Fernández, A., Luengo, J., & Herrera, F. (2009) · Soft Computing · doi:10.1007/s00500-008-0392-y · Cited by 682
Self-citationThe Top Ten Algorithms in Data Mining
(2009) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420089653 · Cited by 670
A Survey on the Application of Genetic Programming to Classification
Espejo, P. G., Ventura, S., & Herrera, F. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2009.2033566 · Cited by 642
Self-citationAdvances in Instance Selection for Instance-Based Learning Algorithms
Brighton, H., & Mellish, C. (2002) · Data Mining and Knowledge Discovery · doi:10.1023/a:1014043630878 · Cited by 532
Learning from Data: Concepts, Theory, and Methods
Cherkassky, V., & Mulier, F. (2007) · Wiley eBooks · doi:10.1002/9780470140529 · Cited by 487
The Handbook of Parametric and Nonparametric Statistical Procedures
Kemp, F. (2003) · Journal of the Royal Statistical Society: Series D (The Statistician) · doi:10.1111/1467-9884.t01-9-00356 · Cited by 481
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
Self-citationNearest-neighbor methods in learning and vision : theory and practice
Shakhnarovich, G., Indyk, P., & Darrell, T. (2005) · Cited by 399
Handbook of parametric and nonparametric statistical procedures, 2nd ed.
Sheskin, D. J. (2000) · Cited by 353
Finding Prototypes For Nearest Neighbor Classifiers
Chang, C.-L. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223827 · Cited by 324
Prototype selection for dissimilarity-based classifiers
Pękalska, E., Duin, R. P. W., & Paclík, P. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2005.06.012 · Cited by 302
Machine learning and data mining
Kononenko, I., & Kukar, M. (2007) · Woodhead Publishing Limited eBooks · doi:10.1533/9780857099440 · Cited by 293
Similarity-based Classification: Concepts and Algorithms
Chen, Y., Garcia, E. K., Gupta, M. R., Rahimi, A., & Cazzanti, L. (2009) · doi:10.5555/1577069.1577096 · Cited by 292
Automatically countering imbalance and its empirical relationship to cost
Chawla, N. V., Cieslak, D. A., Hall, L. O., & Joshi, A. (2008) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-008-0087-0 · Cited by 255
Unifying instance-based and rule-based induction
Domingos, P. (1996) · Machine Learning · doi:10.1007/bf00058656 · Cited by 242
The optimal distance measure for nearest neighbor classification
Short, R., & Fukunaga, K. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056403 · Cited by 241
Improving nearest neighbor rule with a simple adaptive distance measure
Wang, J., Neskovic, P., & Cooper, L. N. (2007) · Pattern Recognition Letters · doi:10.1016/j.patrec.2006.07.002 · Cited by 240
Machine learning and data mining: introduction to principles and algorithms
(2008) · Choice Reviews Online · doi:10.5860/choice.45-3834 · Cited by 233
A memetic algorithm for evolutionary prototype selection: A scaling up approach
García, S., Cano, J. R., & Herrera, F. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.02.006 · Cited by 181
Self-citationAnalysis of new techniques to obtain quality training sets
SANCHEZ, J. (2003) · Pattern Recognition Letters · doi:10.1016/s0167-8655(02)00225-8 · Cited by 176
A Taxonomy of Similarity Mechanisms for Case-Based Reasoning
Cunningham, P. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.227 · Cited by 172
Learning weighted metrics to minimize nearest-neighbor classification error
Paredes, R., & Vidal, E. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.145 · Cited by 163
Adaptive nearest neighbor pattern classification
Geva, S., & Sitte, J. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80344 · Cited by 142
Shintemirov, A., Tang, W., & Wu, Q. (2008) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/tsmcc.2008.2007253 · Cited by 141
A Novel Template Reduction Approach for the $K$-Nearest Neighbor Method
Fayed, H. A., & Atiya, A. F. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2018547 · Cited by 132
A lot of randomness is hiding in accuracy
Ben‐David, A. (2007) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2007.01.001 · Cited by 125
A bootstrap technique for nearest neighbor classifier design
Hamamoto, Y., Uchimura, S., & Tomita, S. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.566814 · Cited by 122
Multiple-prototype classifier design
Bezdek, J. C., Reichherzer, T., Lim, G., et al. (1998) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/5326.661091 · Cited by 114
Constructing Ensembles of Classifiers by Means of Weighted Instance Selection
García‐Pedrajas, N. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005496 · Cited by 104
IFS-CoCo: Instance and feature selection based on cooperative coevolution with nearest neighbor rule
Derrac, J., García, S., & Herrera, F. (2009) · Pattern Recognition · doi:10.1016/j.patcog.2009.12.012 · Cited by 101
Self-citationThe Nearest Neighbor Algorithm of Local Probability Centers
Li, B., Chen, Y. W., & Chen, Y. Q. (2008) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2007.908363 · Cited by 95
Class Conditional Nearest Neighbor for Large Margin Instance Selection
Marchiori, E. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.164 · Cited by 91
A brief taxonomy and ranking of creative prototype reduction schemes
Kim, S.-W., & Oommen, B. J. (2003) · Pattern Analysis and Applications · doi:10.1007/s10044-003-0191-0 · Cited by 90
On the relation of performance to editing in nearest neighbor rules
Koplowitz, J., & Brown, T. A. (1981) · Pattern Recognition · doi:10.1016/0031-3203(81)90102-3 · Cited by 87
Discovering useful concept prototypes for classification based on filtering and abstraction
Lam, W. P., Keung, C.-K., & Liu, D. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1023804 · Cited by 81
Particle swarm optimization for prototype reduction
Nanni, L., & Lumini, A. (2008) · Neurocomputing · doi:10.1016/j.neucom.2008.03.008 · Cited by 76
Vector quantization technique for nonparametric classifier design
Xie, Q., Laszlo, C. A., & Ward, R. K. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.250849 · Cited by 74
Evolutionary Design of Nearest Prototype Classifiers
Fernández, F., & Isasi, P. (2004) · Journal of Heuristics · doi:10.1023/b:heur.0000034715.70386.5b · Cited by 62
A divide-and-conquer approach to the pairwise opposite class-nearest neighbor (POC-NN) algorithm
Raicharoen, T., & Lursinsap, C. (2005) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.01.003 · Cited by 62
Enhancing prototype reduction schemes with LVQ3-type algorithms
Kim, S., & Oommen, B. J. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00115-2 · Cited by 58
On the Design and Applicability of Distance Functions in High-Dimensional Data Space
Hsu, C.-M., & Chen⋆, M.-S. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.178 · Cited by 57
Evaluation of k-Nearest Neighbor classifier performance for direct marketing
Govindarajan, M., & Chandrasekaran, R. (2010) · Expert systems with applications · doi:10.1016/j.eswa.2009.04.055 · Cited by 52
Beyond Traditional Kernels: Classification in Two Dissimilarity-Based Representation Spaces
Pękalska, E., & Duin, R. P. W. (2008) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/tsmcc.2008.2001687 · Cited by 36
DIAGNOSE EFFECTIVE EVOLUTIONARY PROTOTYPE SELECTION USING AN OVERLAPPING MEASURE
García, S., Cano, J.-R., Bernadó-Mansilla, E., & Herrera, F. (2009) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001409007727 · Cited by 26
Self-citationPROTOTYPE CLASSIFIER DESIGN WITH PRUNING
Jiang, L., MANRY, M. T., Yu, C., & WILSON, D. R. (2005) · International Journal of Artificial Intelligence Tools · doi:10.1142/s0218213005002090 · Cited by 24
COEVOLUTION OF NEAREST NEIGHBOR CLASSIFIERS
Gagné, C., & Parizeau, M. (2007) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001407005752 · Cited by 23
A vector quantization method for nearest neighbor classifier design
Yen, C., Young, C.-N., & Nagurka, M. L. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.01.012 · Cited by 14
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-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
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-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
Ramírez-Gallego, S., Fernández, A., García, S., Chen, M., & Herrera, F. (2018) · Information Fusion · doi:10.1016/j.inffus.2017.10.001 · Cited by 140
Self-citation
Metadata
- Authors
- Triguero, I., Derrac, J., Garcia, S., & Herrera, F.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
- Published
- 2012-01
- Volume
- 42
- Issue
- 1
- Pages
- 86-100
- ISSN
- 1094-6977 (ISSN-L)
- 1558-2442
- OpenAlex
- W2068514419
- Cited by
- 269
- References
- 70
- FWCI
- 21.29
- 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.