Comparative Study of K-NN, Naive Bayes and Decision Tree Classification Techniques
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Classification is a data mining technique used to predict group membership for data instances within a given dataset.It is used for classifying data into different classes by considering some constrains.The problem of data classification has many applications in various fields of data mining.This is because the problem aims at learning the relationship between a set of feature variables and a target variable of interest.Classification is considered as an example of supervised learning as training data associated with class labels is given as input.Classification algorithms have a wide range of applications like Customer Target Marketing, Medical Disease Diagnosis, Social Network Analysis, Credit Card Rating, Artificial Intelligence, and Document Categorization etc. Several major kinds of classification techniques are K-Nearest Neighbor classifier, Naive Bayes, and Decision Trees.This paper focuses on study of various classification techniques, their advantages and disadvantages.
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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531 · cited 1×
“Instance based classifiers are also called lazy learners as they store all of the training samples and do not build a classifier until a new, unlabeled sample needs to be classified [7].”
BackgroundNearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936 · cited 1×
“It is based on the principle that the samples that are similar, generally lies in close vicinity [6].”
BackgroundSupervised Machine Learning: A Review of Classification Techniques
Kotsiantis, S. B. (2007) · Informatica · Cited by 6,141
Data Mining - Concepts and Techniques.
Perner, P. (2002) · Künstliche Intell. · Cited by 4,886
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495 · cited 1×
“Naive Bayes Classifier is the simple Statistical Bayesian Classifier [11].”
MethodGoldszmidt, M. (2011) · Wiley Encyclopedia of Operations Research and Management Science · doi:10.1002/9780470400531.eorms0099 · Cited by 351
A Comparative Study of Training Algorithms for Supervised Machine Learning
Bhavsar, H., & Ganatra, A. P. (2012) · Cited by 234
A Survey on Decision Tree Algorithm for Classification
nbspPatel Brijain, R., & Rana, N. K. (2014) · International Journal of Engineering Development and Research · Cited by 186
Survey on Classification Techniques for Data Mining
Agarwal, V., Thakare, S., & Jaiswal, A. K. (2015) · International Journal of Computer Applications · doi:10.5120/ijca2015907374 · Cited by 141 · cited 1×
“Euclidian distanceor Hamming distance is used according to the data type of data classes used[10].”
MethodSurvey of Classification Techniques in Data Mining
Singh, A., & Elangovan, K. (2014) · Cited by 132
Cited by
Park, S.-J., & Lee, D.-K. (2020) · Environmental Research Letters · doi:10.1088/1748-9326/aba5b3 · Cited by 100
Akasheh, M. A., Malik, E. F., Hujran, O., & Zaki, N. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.121794 · Cited by 78
Bałdyga, M., Barański, K., Belter, J., Kalinowski, M., & Weichbroth, P. (2024) · Sensors · doi:10.3390/s24082633 · Cited by 40
“Another limitation is the potential for a more convoluted representation of certain concepts due to the replication problem [64].”
Background
Metadata
- Venue
- International Journal of Science and Research (IJSR)
- Published
- 2016-01-05
- Volume
- 5
- Issue
- 1
- Pages
- 1842-1845
- ISSN
- 2319-7064 (ISSN-L)
- OpenAlex
- W4241699496
- Cited by
- 240
- References
- 10
- FWCI
- 19.32
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Comparative Study of K-NN, Naive Bayes and Decision Tree Classification Techniques. https://app.cochat.ai/papers/10.21275/v5i1.nov153131
- The paper
- Comparative Study of K-NN, Naive Bayes and Decision Tree Classification Techniques. (2016). International Journal of Science and Research (IJSR). https://doi.org/10.21275/v5i1.nov153131
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.