The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Neighborhood classifiers
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
(1992) · Cited by 23,431
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
Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
Fix, E., & Hodges, J. L. (1989) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403797 · Cited by 2,516
The condensed nearest neighbor rule (Corresp.)
Hart, P. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054155 · Cited by 1,733
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
Relational interpretations of neighborhood operators and rough set approximation operators
Yao, Y. Y. (1998) · Information Sciences · doi:10.1016/s0020-0255(98)10006-3 · Cited by 1,050
Rough set methods in feature selection and recognition
Świniarski, R. W., & Skowron, A. (2002) · Pattern Recognition Letters · doi:10.1016/s0167-8655(02)00196-4 · Cited by 816
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
Fukunaga, K., & Narendra, P. M. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224297 · Cited by 736
Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches
Jensen, R., & Shen, Q. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.96 · Cited by 667
Information-preserving hybrid data reduction based on fuzzy-rough techniques
Hu, Q., Yu, D., & Xie, Z. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.09.004 · Cited by 462
Self-citationA nearest hyperrectangle learning method
Salzberg, S. (1991) · Machine Learning · doi:10.1007/bf00114779 · Cited by 384
Genetic programming for simultaneous feature selection and classifier design
Muni, D. P., Pal, N. R., & Das, J. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2005.854499 · Cited by 357
Neighbor-weighted K-nearest neighbor for unbalanced text corpus
TAN, S. (2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.12.023 · Cited by 345
Combined SVM-Based Feature Selection and Classification
Neumann, J., Schnörr, C., & Steidl, G. (2005) · Machine Learning · doi:10.1007/s10994-005-1505-9 · Cited by 248
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
Kushilevitz, E., Ostrovsky, R., & Rabani, Y. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539798347177 · Cited by 245
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
Probability density estimation from optimally condensed data samples
Girolami, M., & He, C. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1233899 · Cited by 208
Selective Sampling for Nearest Neighbor Classifiers
Lindenbaum, M., Markovitch, S., & Rusakov, D. (2004) · Machine Learning · doi:10.1023/b:mach.0000011805.60520.fe · Cited by 186
Fast k-nearest neighbor classification using cluster-based trees
Zhang, B., & Srihari, S. N. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1265868 · Cited by 161
Nearest neighbors by neighborhood counting
Wang, H. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.126 · Cited by 151
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
Improving nearest neighbor classification with cam weighted distance
Zhou, C. Y., & Chen, Y. Q. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.09.004 · Cited by 62
Cited by
Neighborhood rough set based heterogeneous feature subset selection
Hu, Q., Yu, D., Liu, J., & Wu, C. (2008) · Information Sciences · doi:10.1016/j.ins.2008.05.024 · Cited by 1,085
Self-citationSelecting Discrete and Continuous Features Based on Neighborhood Decision Error Minimization
Hu, Q., Pedrycz, W., Yu, D., & Lang, J. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2024166 · Cited by 265
Self-citationA multidimensional hybrid intelligent method for gear fault diagnosis
Lei, Y., Zuo, M. J., He, Z., & Zi, Y. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.06.060 · Cited by 240
Measures of uncertainty for neighborhood rough sets
Chen, Y., Xue, Y., Ma, Y., & Xu, F. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.01.008 · Cited by 87
Metadata
- Authors
- HU, Q., YU, D., & XIE, Z.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2008-02
- Volume
- 34
- Issue
- 2
- Pages
- 866-876
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2912707296
- Cited by
- 513
- References
- 24
- FWCI
- 11.62
- 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.