The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Advances in Instance Selection for Instance-Based Learning Algorithms
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
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Kolodner, J. L. (2005) · The Cambridge Handbook of the Learning Sciences · doi:10.1017/cbo9780511816833.015 · Cited by 4,247
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Instance-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
Nearest neighbor (NN) norms: NN pattern classification techniques
Dasarathy, B. V. (1991) · Medical Entomology and Zoology · Cited by 1,654
The reduced nearest neighbor rule (Corresp.)
Gates, G. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054809 · Cited by 566
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
The Reduced Nearest Neighbor Rule
Gates, G. W. (1998) · Cited by 416
A nearest hyperrectangle learning method
Salzberg, S. (1991) · Machine Learning · doi:10.1007/bf00114779 · Cited by 384
Concept learning and the problem of small disjuncts
Holte, R. C., Acker, L., & Porter, B. (1989) · Cited by 351
Finding 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
StatLog: Comparison of classification algorithms on large real-world problems
KING, R. D., FENG, C., & SUTHERLAND, A. (1995) · Applied Artificial Intelligence · doi:10.1080/08839519508945477 · Cited by 320
Remembering to forget: a competence-preserving case deletion policy for case-based reasoning systems
Smyth, B., & Keane, M. T. (1995) · Cited by 234
Forgetting Exceptions is Harmful in Language Learning
Daelemans, W., Van Den Bosch, A., & Zavrel, J. (1999) · Machine Learning · doi:10.1023/a:1007585615670 · Cited by 231
Wilson, D. R., & Martinez, T. R. (1997) · Cited by 185
The Role of Forgetting in Learning
MARKOVITCH, S., & SCOTT, P. D. (1988) · Machine Learning Proceedings 1988 · doi:10.1016/b978-0-934613-64-4.50052-9 · Cited by 167
Addressing the Selective Superiority Problem: Automatic Algorithm/Model Class Selection
Brodley, C. E. (1993) · Elsevier eBooks · doi:10.1016/b978-1-55860-307-3.50009-5 · Cited by 151
Information Filtering: Selection Mechanisms in Learning Systems
Markovitch, S., & Scott, P. D. (1993) · Machine Learning · doi:10.1023/a:1022614725002 · Cited by 79
Density-Adaptive Learning and Forgetting
Salganicoff, M. (1993) · Elsevier eBooks · doi:10.1016/b978-1-55860-307-3.50042-3 · Cited by 65
Cited by
Toward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
Review of Deep Learning Algorithms and Architectures
Shrestha, A., & Mahmood, A. (2019) · IEEE Access · doi:10.1109/access.2019.2912200 · Cited by 1,883
“Instead of training the network with all the data set, we can preselect a smaller but representative data set from the full training distribution set using instance selection methods [95] or Monte Carlo sampling [48].”
MethodMachine learning: a review of classification and combining techniques
Kotsiantis, S. B., Zaharakis, I. D., & Pintelas, P. E. (2006) · Artificial Intelligence Review · doi:10.1007/s10462-007-9052-3 · Cited by 1,582
k-Nearest Neighbour Classifiers - A Tutorial
Cunningham, P., & Delany, S. J. (2022) · ACM Computing Surveys · doi:10.1145/3459665 · Cited by 942
Metadata
- Authors
- Brighton, H., & Mellish, C.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2002-04
- Volume
- 6
- Issue
- 2
- Pages
- 153-172
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2158724449
- Cited by
- 532
- References
- 23
- FWCI
- 13.38
- 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.