The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Discriminant adaptive nearest neighbor classification
Abstract
Nearest neighbour classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions. We propose a locally adaptive form of nearest neighbour classification to try to ameliorate this curse of dimensionality. We use a local linear discriminant analysis to estimate an effective metric for computing neighbourhoods. We determine the local decision boundaries from centroid information, and then shrink neighbourhoods in directions orthogonal to these local decision boundaries, and elongate them parallel to the boundaries. Thereafter, any neighbourhood-based classifier can be employed, using the modified neighbourhoods. The posterior probabilities tend to be more homogeneous in the modified neighbourhoods. We also propose a method for global dimension reduction, that combines local dimension information. In a number of examples, the methods demonstrate the potential for substantial improvements over nearest neighbour classification.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Robust Locally Weighted Regression and Smoothing Scatterplots
Cleveland, W. S. (1979) · Journal of the American Statistical Association · doi:10.1080/01621459.1979.10481038 · Cited by 11,594
Discriminant Analysis and Statistical Pattern Recognition.
Hawkins, D. M., & McLachlan, G. J. (1993) · Journal of the American Statistical Association · doi:10.2307/2290355 · Cited by 2,633
Discriminant Analysis and Statistical Pattern Recognition
McLachlan, G. J. (1992) · Wiley Series in Probability and Statistics · doi:10.1002/0471725293 · Cited by 1,267
Penalized Discriminant Analysis
Hastie, T., Buja, A., & Tibshirani, R. (1995) · The Annals of Statistics · doi:10.1214/aos/1176324456 · Cited by 849
Self-citationNeural Networks and Related Methods for Classification
Ripley, B. D. (1994) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1994.tb01990.x · Cited by 627
(1992) · neural information processing systems · Cited by 460
Slicing Regression: A Link-Free Regression Method
Duan, N., & Li, K.-C. (1991) · The Annals of Statistics · doi:10.1214/aos/1176348109 · Cited by 307
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
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
The multi-class metric problem in nearest neighbour discrimination rules
Myles, J. P., & Hand, D. J. (1990) · Pattern Recognition · doi:10.1016/0031-3203(90)90123-3 · Cited by 69
Cited by
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
Top 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Distance Metric Learning for Large Margin Nearest Neighbor Classification
Weinberger, K. Q., & Saul, L. K. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1577078 · Cited by 4,044
(1999) · Cited by 3,186
Metadata
- Authors
- Hastie, T., & Tibshirani, R.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1996-06
- Volume
- 18
- Issue
- 6
- Pages
- 607-616
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W1545745930
- Cited by
- 833
- References
- 12
- FWCI
- 16.23
- 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.