The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Locally adaptive metric nearest-neighbor classification
Abstract
Nearest-neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with finite samples due to the curse of dimensionality. Severe bias can be introduced under these conditions when using the nearest-neighbor rule. We propose a locally adaptive nearest-neighbor classification method to try to minimize bias. We use a chi-squared distance analysis to compute a flexible metric for producing neighborhoods that are highly adaptive to query locations. Neighborhoods are elongated along less relevant feature dimensions and constricted along most influential ones. As a result, the class conditional probabilities are smoother in the modified neighborhoods, whereby better classification performance can be achieved. The efficacy of our method is validated and compared against other techniques using both simulated and real-world data.
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
(1992) · Cited by 23,431
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Locally Weighted Regression: An Approach to Regression Analysis by Local Fitting
Cleveland, W. S., & Devlin, S. J. (1988) · Journal of the American Statistical Association · doi:10.1080/01621459.1988.10478639 · Cited by 5,742
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Wiley Series in Probability and Statistics
(2008) · Wiley series in probability and statistics · doi:10.1002/series1345 · Cited by 4,217
Adaptive Control Processes: A Guided Tour
Bellman, R. E. (1961) · doi:10.1515/9781400874668 · Cited by 2,802
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
Consistent Nonparametric Regression
Stone, C. J. (1977) · The Annals of Statistics · doi:10.1214/aos/1176343886 · Cited by 1,792
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006559212014 · Cited by 1,671
Cited by
Prototype Selection for Nearest Neighbor Classification: Taxonomy and Empirical Study
Garcia, S., Derrac, J., Cano, J. R., & Herrera, F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.142 · Cited by 695
Human–Agent Teaming for Multirobot Control: A Review of Human Factors Issues
Chen, J. Y. C., & Barnes, M. J. (2014) · IEEE Transactions on Human-Machine Systems · doi:10.1109/thms.2013.2293535 · Cited by 522
Random Forests and Adaptive Nearest Neighbors
Lin, Y., & Jeon, Y. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000001230 · Cited by 507
Metadata
- Authors
- Domeniconi, C., Peng, J., & Gunopulos, D.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2002-09
- Volume
- 24
- Issue
- 9
- Pages
- 1281-1285
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2116596942
- Cited by
- 307
- References
- 19
- FWCI
- 11.71
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Locally adaptive metric nearest-neighbor classification. https://app.cochat.ai/papers/10.1109/tpami.2002.1033219
- The paper
- Domeniconi, C., Peng, J., & Gunopulos, D. (2002). Locally adaptive metric nearest-neighbor classification. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2002.1033219
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.