The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
A nearest hyperrectangle learning method
Open accessOverview
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,355
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Context theory of classification learning
Medin, D. L., & Schaffer, M. M. (1978) · Psychological Review · doi:10.1037/0033-295x.85.3.207 · Cited by 3,061
Instance-based learning algorithms
Aha, D. W., Kibler, D., & Albert, M. K. (1991) · Machine Learning · doi:10.1007/bf00153759 · Cited by 2,163
Cited by
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
(1998) · Cited by 3,476
Carpenter, G. A., Grossberg, S., Markuzon, N., Reynolds, J. H., & Rosen, D. B. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.159059 · Cited by 1,975
Very Simple Classification Rules Perform Well on Most Commonly Used Datasets
Holte, R. C. (1993) · Machine Learning · doi:10.1023/a:1022631118932 · Cited by 1,791
Learning in the Presence of Concept Drift and Hidden Contexts
Widmer, G., & Kubat, M. (1996) · Machine Learning · doi:10.1023/a:1018046501280 · Cited by 1,857
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
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
Fuzzy min-max neural networks. I. Classification
Simpson, P. K. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.159066 · Cited by 782
A weighted nearest neighbor algorithm for learning with symbolic features
Cost, S., & Salzberg, S. (1993) · Machine Learning · doi:10.1007/bf00993481 · Cited by 764
Self-citationWettschereck, D., Aha, D. W., & Mohri, T. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006593614256 · Cited by 717
A System for Induction of Oblique Decision Trees
Murthy, S. K., Kasif, S., & Salzberg, S. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.63 · Cited by 590
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
HU, Q., YU, D., & XIE, Z. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2006.10.043 · Cited by 513
Temporal sequence learning and data reduction for anomaly detection
Lane, T., & Brodley, C. E. (1999) · ACM Transactions on Information and System Security · doi:10.1145/322510.322526 · Cited by 386
Challenges in KNN Classification
Zhang, S. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3049250 · Cited by 362
MBT: A Memory-Based Part of Speech Tagger-Generator
Daelemans, W. M. P., Zavrel, J., Berck, P., & Gillis, S. A. (1996) · Research portal (Tilburg University) · doi:10.48550/arxiv.cmp-lg/9607012 · Cited by 256
Metadata
- Authors
- Salzberg, S.
- Venue
- Machine Learning
- Published
- 1991-05
- Volume
- 6
- Issue
- 3
- Pages
- 251-276
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2146257637
- Cited by
- 384
- References
- 33
- FWCI
- 38.21
- Type
- journal article
- Language
- en
- Open access
- bronze
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.