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-citationInstance-based learning algorithms
Aha, D. W., Kibler, D., & Albert, M. K. (1991) · Machine Learning · doi:10.1007/bf00153759 · Cited by 2,163
Asymptotic 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
The condensed nearest neighbor rule (Corresp.)
Hart, P. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054155 · Cited by 1,733
KEEL: 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-citationNear-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437
Improved Heterogeneous Distance Functions
Wilson, D. R., & Martinez, T. R. (1997) · Journal of Artificial Intelligence Research · doi:10.1613/jair.346 · Cited by 1,344
García, S., & Herrera, F. (2008) · Cited by 1,277
Self-citationReduction Techniques for Instance-Based Learning Algorithms
Wilson, D. R., & Martinez, T. R. (2000) · Machine Learning · doi:10.1023/a:1007626913721 · Cited by 1,182
(1976) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1976.4309452 · Cited by 1,078
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
Discriminant adaptive nearest neighbor classification
Hastie, T., & Tibshirani, R. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.506411 · Cited by 833
MILES: Multiple-Instance Learning via Embedded Instance Selection
Chen, Y., Bi, J., & Wang, J. Z. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.248 · Cited by 752
Wettschereck, D., Aha, D. W., & Mohri, T. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006593614256 · Cited by 717
The Top Ten Algorithms in Data Mining
(2009) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420089653 · Cited by 670
The reduced nearest neighbor rule (Corresp.)
Gates, G. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054809 · Cited by 566
Advances 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
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
Skalak, D. B. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50043-x · Cited by 486
An Experiment with the Edited Nearest-Neighbor Rule
(1976) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1976.4309523 · Cited by 470
Nearest-Neighbor Methods in Learning and Vision: Theory and Practice
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/4908.001.0001 · Cited by 440
The Reduced Nearest Neighbor Rule
Gates, G. W. (1998) · Cited by 416
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
Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study
Cano, J. R., Herrera, F., & Lozano, M. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819265 · Cited by 332
Self-citationFinding Prototypes For Nearest Neighbor Classifiers
Chang, C.-L. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223827 · Cited by 324
An algorithm for a selective nearest neighbor decision rule (Corresp.)
Ritter, G., Woodruff, H., Lowry, S., & Isenhour, T. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055464 · Cited by 323
A simple algorithm for nearest neighbor search in high dimensions
Nene, S. A., & Nayar, S. K. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.615448 · Cited by 311
Locally adaptive metric nearest-neighbor classification
Domeniconi, C., Peng, J., & Gunopulos, D. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1033219 · Cited by 307
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 Metric Learning for a Variable-Kernel Classifier
Lowe, D. G. (1995) · Neural Computation · doi:10.1162/neco.1995.7.1.72 · Cited by 267
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
Machine learning and data mining: introduction to principles and algorithms
(2008) · Choice Reviews Online · doi:10.5860/choice.45-3834 · Cited by 233
(1997) · Springer eBooks · doi:10.1007/978-94-017-2053-3 · Cited by 220
Nearest prototype classifier designs: An experimental study
Bezdek, J. C., & Kuncheva, L. I. (2001) · International Journal of Intelligent Systems · doi:10.1002/int.1068 · Cited by 205
Improved k-nearest neighbor classification
Wu, Y., Ianakiev, K., & Govindaraju, V. (2002) · Pattern Recognition · doi:10.1016/s0031-3203(01)00132-7 · Cited by 200
Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design
Dasarathy, B. V. (1994) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.278999 · Cited by 187
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-citationMILIS: Multiple Instance Learning with Instance Selection
Fu, Z., Robles-Kelly, A., & Zhou, J. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.155 · Cited by 181
Fast Nearest Neighbor Condensation for Large Data Sets Classification
Angiulli, F. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190645 · Cited by 177
Analysis 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
Editing for the k-nearest neighbors rule by a genetic algorithm
Kuncheva, L. I. (1995) · Pattern Recognition Letters · doi:10.1016/0167-8655(95)00047-k · Cited by 172
K-Nearest Neighbor Finding Using MaxNearestDist
Samet, H. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1182 · Cited by 165
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
Learning Representative Exemplars of Concepts: An Initial Case Study
Kibler, D. F., & Aha, D. W. (1987) · Elsevier eBooks · doi:10.1016/b978-0-934613-41-5.50006-4 · Cited by 157
Prototype selection for the nearest neighbour rule through proximity graphs
Sánchez, J. S., Pla, F., & Ferri, F. J. (1997) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)00035-4 · Cited by 156
The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.)
Gowda, K., & Krishna, G. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056066 · Cited by 150
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 150
Comparison of Instances Seletion Algorithms I. Algorithms Survey
Jankowski, N., & Grochowski, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24844-6_90 · Cited by 134
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
On optimum choice of k in nearest neighbor classification
Ghosh, A. K. (2005) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2005.06.007 · Cited by 125
Recursive Automatic Bias Selection for Classifier Construction
Brodley, C. E. (1995) · Machine Learning · doi:10.1007/bf00993475 · Cited by 125
Triguero, I., García, S., & Herrera, F. (2010) · Pattern Recognition · doi:10.1016/j.patcog.2010.10.020 · Cited by 122
Self-citationStratification for scaling up evolutionary prototype selection
Cano, J.-R., Herrera, F., & Lozano, M. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.09.043 · Cited by 116
Self-citationA 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 111
A new fast prototype selection method based on clustering
Olvera-López, J. A., Carrasco-Ochoa, J. A., & Martínez-Trinidad, J. F. (2009) · Pattern Analysis and Applications · doi:10.1007/s10044-008-0142-x · Cited by 110
A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
Kim, B. S., & Park, S. B. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767859 · Cited by 110
Cano, J.-R., Herrera, F., & Lozano, M. (2006) · Data & Knowledge Engineering · doi:10.1016/j.datak.2006.01.008 · Cited by 105
Self-citationConstructing 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 103
Voting over Multiple Condensed Nearest Neighbors
Alpaydın, E. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006563312922 · Cited by 99
Distance Learning for Similarity Estimation
Yu, J., Amores, J., Sebe, N., et al. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70714 · Cited by 93
García‐Osorio, C., de Haro-García, A., & García‐Pedrajas, N. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2010.01.001 · Cited by 92
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
An incremental prototype set building technique
Devi, V. S., & Murty, M. N. (2002) · Pattern Recognition · doi:10.1016/s0031-3203(00)00184-9 · Cited by 90
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
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 88
Self-citationParedes, R., & Vidal, E. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.06.001 · Cited by 88
Finding representative patterns with ordered projections
Riquelme, J. C., Aguilar–Ruiz, J. S., & Toro, M. (2002) · Pattern Recognition · doi:10.1016/s0031-3203(02)00119-x · Cited by 84
Hit Miss Networks with Applications to Instance Selection
Marchiori, E. (2008) · Journal of Machine Learning Research · doi:10.5555/1390681.1390715 · Cited by 82
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
A new edited k-nearest neighbor rule in the pattern classification problem
Hattori, K., & Takahashi, M. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00068-0 · Cited by 77
A cooperative coevolutionary algorithm for instance selection for instance-based learning
García‐Pedrajas, N., Romero-del-Castillo, J. A., & Ortíz-Boyer, D. (2009) · Machine Learning · doi:10.1007/s10994-009-5161-3 · Cited by 75
Fast implementations of nearest neighbor classifiers
Grother, P. J., Candela, G. T., & Blue, J. L. (1997) · Pattern Recognition · doi:10.1016/s0031-3203(96)00098-2 · Cited by 70
DECISION BOUNDARY PRESERVING PROTOTYPE SELECTION FOR NEAREST NEIGHBOR CLASSIFICATION
Barandela, R., Ferri, F. J., & Sánchez, J. S. (2005) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001405004332 · 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
Cerverón-Lleó, V., & Ferri, F. J. (2001) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/3477.931531 · Cited by 56
Optimal reference subset selection for nearest neighbor classification by tabu search
Zhang, H., & Sun, G. (2002) · Pattern Recognition · doi:10.1016/s0031-3203(01)00137-6 · Cited by 53
A divide-and-conquer recursive approach for scaling up instance selection algorithms
de Haro-García, A., & García‐Pedrajas, N. (2008) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-008-0121-2 · Cited by 52
Sierra, B., Lazkano, E., Inza, I., Merino, M., Larrañaga, P., & Quiroga, J. A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48229-6_3 · Cited by 47
Adaptive Prototype Learning Algorithms: Theoretical and Experimental Studies
Chang, F., Lin, C.-C., & Lu, C.-J. (2006) · Cited by 32
Distributed Nearest Neighbor-Based Condensation of Very Large Data Sets
Angiulli, F., & Folino, G. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190665 · Cited by 32
Cano, J.-R., García, S., & Herrera, F. (2008) · Pattern Recognition Letters · doi:10.1016/j.patrec.2008.08.001 · Cited by 30
Self-citationOn Nearest Neighbor Classification Using Adaptive Choice of k
Ghosh, A. K. (2007) · Journal of Computational and Graphical Statistics · doi:10.1198/106186007x208380 · Cited by 28
C-pruner: an improved instance pruning algorithm
Zhao, K., Zhou, S., Guan, J., & Zhou, A. (2004) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2003.1264449 · Cited by 28
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-citationUllmann, J. R. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055252 · Cited by 25
Support Vector Based Prototype Selection Method for Nearest Neighbor Rules
Li, Y., Hu, Z., Cai, Y., & Zhang, W. (2005) · Lecture notes in computer science · doi:10.1007/11539087_68 · Cited by 23
COEVOLUTION OF NEAREST NEIGHBOR CLASSIFIERS
Gagné, C., & Parizeau, M. (2007) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001407005752 · Cited by 20
Using the Geometrical Distribution of Prototypes for Training Set Condensing
Lozano, M. T., Sánchez, J. S., & Pla, F. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25945-9_61 · Cited by 13
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-citation
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.