The DOI matches its Crossref record; 68 of the 68 references it cites were found in a registry or an index.
Efficient kNN Classification With Different Numbers of Nearest Neighbors
Open accessAbstract
nearest neighbor (kNN) method is a popular classification method in data mining and statistics because of its simple implementation and significant classification performance. However, it is impractical for traditional kNN methods to assign a fixed value (even though set by experts) to all test samples. Previous solutions assign different values to different test samples by the cross validation method but are usually time-consuming. This paper proposes a kTree method to learn different optimal values for different test/new samples, by involving a training stage in the kNN classification. Specifically, in the training stage, kTree method first learns optimal values for all training samples by a new sparse reconstruction model, and then constructs a decision tree (namely, kTree) using training samples and the learned optimal values. In the test stage, the kTree fast outputs the optimal value for each test sample, and then, the kNN classification can be conducted using the learned optimal value and all training samples. As a result, the proposed kTree method has a similar running cost but higher classification accuracy, compared with traditional kNN methods, which assign a fixed value to all test samples. Moreover, the proposed kTree method needs less running cost but achieves similar classification accuracy, compared with the newly kNN methods, which assign different values to different test samples. This paper further proposes an improvement version of kTree method (namely, k*Tree method) to speed its test stage by extra storing the information of the training samples in the leaf nodes of kTree, such as the training samples located in the leaf nodes, their kNNs, and the nearest neighbor of these kNNs. We call the resulting decision tree as k*Tree, which enables to conduct kNN classification using a subset of the training samples in the leaf nodes rather than all training samples used in the newly kNN methods. This actually reduces running cost of test stage. Finally, the experimental results on 20 real data sets showed that our proposed methods (i.e., kTree and k*Tree) are much more efficient than the compared methods in terms of classification tasks.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The machine learning-based QC algorithm enables the establishment of non-linear relationships between multi-source data and QC outcomes, facilitating the identification of potentially effective features [24,32,33].”
From A Machine Learning-Based Quality Control Algorithm for Heavy Rainfall Using Multi-Source Data (2025) · cites this paper as [33]
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
Locality Preserving Projections
He, X., & Niyogi, P. (2003) · Cited by 4,119
A survey of decision tree classifier methodology
Safavian, S. R., & Landgrebe, D. (1991) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.97458 · Cited by 3,808
Face recognition using Laplacianfaces
He, X., Yan, S., Hu, Y., Niyogi, P., & Zhang, H.-J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.55 · Cited by 3,264
Ensemble Methods: Foundations and Algorithms
Zhou, Z.-H. (2012) · doi:10.1201/b12207 · Cited by 2,534
KNN Model-Based Approach in Classification
Guo, G., Wang, H., Bell, D., Bi, Y., & Greer, K. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39964-3_62 · Cited by 2,099
Ensemble Methods: Foundations and Algorithms
Zhou, Z. (2012) · Cited by 2,051
Tao, D., Tang, X., Li, X., & Wu, X. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.134 · Cited by 879
Self-citationA Nearest Neighbor Bootstrap For Resampling Hydrologic Time Series
Lall, U., & Sharma, A. (1996) · Water Resources Research · doi:10.1029/95wr02966 · Cited by 774
Research works printed but not linked: 1
- bahety, 2014, Extension and Evaluation of ID3—Decision Tree Algorithm, Entropy, 2, 1
Cited by
Investigating the impact of data normalization on classification performance
Singh, D., & Singh, B. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2019.105524 · Cited by 1,726
Halder, R. K., Uddin, M. N., Uddin, M. A., Aryal, S., & Khraisat, A. (2024) · Journal of Big Data · doi:10.1186/s40537-024-00973-y · Cited by 520
Ağbulut, Ü., Gürel, A. E., & Biçen, Y. (2021) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2020.110114 · Cited by 424
Belete, D. M., & Huchaiah, M. D. (2022) · International Journal of Computers and Applications · doi:10.1080/1206212x.2021.1974663 · Cited by 423
Deep Learning: A Rapid and Efficient Route to Automatic Metasurface Design
Qiu, T., Shi, X., Wang, J., Li, Y., Qu, S., Cheng, Q., Cui, T., & Sui, S. (2019) · Advanced Science · doi:10.1002/advs.201900128 · Cited by 421
Metadata
- Authors
- Zhang, S., Li, X., Zong, M., Zhu, X., & Wang, R.
- Affiliations
- Guangxi Normal University (CN)
- Chinese Academy of Sciences (CN)
- Massey University (NZ)
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2018-05
- Volume
- 29
- Issue
- 5
- Pages
- 1774-1785
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2606436201
- Cited by
- 1,378
- References
- 68
- Citations by year
- 2026: 91 · 2025: 176 · 2024: 208 · 2023: 216 · 2022: 204 · 2021: 157 · 2020: 132 · 2019: 103 · 2018: 69
- FWCI
- 52.12
- Type
- journal article
- Language
- en
- Open access
- green
- ir.opt.ac.cn
- Locations
- IEEE Transactions on Neural Networks and Learning Systems (publishedVersion)
- PubMed (publishedVersion)
- Institutional Repository of Xi'an Institute of Optics and Fine Mechanics, Chinese Academy of Sciences (Xian Institute of Optics and Precision Mechanics) (submittedVersion, cc-by-nc-sa)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
- Keywords
- k-nearest neighbors, sparse reconstruction, decision tree, k-trees
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: Efficient kNN Classification With Different Numbers of Nearest Neighbors. https://app.cochat.ai/papers/10.1109/tnnls.2017.2673241
- The paper
- Zhang, S., Li, X., Zong, M., Zhu, X., & Wang, R. (2018). Efficient kNN Classification With Different Numbers of Nearest Neighbors. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2017.2673241
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.