CoChat

An Empirical Comparison of Supervised Machine Learning Algorithms for Internet of Things Data

Khadse, Vijay, Mahalle, Parikshit N., Biraris, Swapnil V · 2018 · 2018 Fourth International Conference on Computing Communication Control and Automation (ICCUBEA)
Cited by 39

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

Internet of Things(IoT) is one of the rapidly growing fields andn has a wide range of applications such as smart cities, smart homes, connected wearable, connected health-care, and connected automobiles, etc. These IoT applications generate tremendous amounts of data which needs to be analyzed to draw useful inferences required to optimize the performance of IoT applications. The artificial intelligence(AI) and machine learning (ML) play the significant role in building the smart IoT systems. The main objective of the paper is a comprehensive analysis of five well-known supervised machine learning algorithms on IoT datasets. The five classifiers are K-Nearest Neighbors (KNN), Naive Bayes (NB), Decision Tree (DT), Random Forest (RF) and Logistic Regression (LR). The feature reduction is performed using PCA algorithm. The performance of these five classifiers has been compared on the basis of six characteristics of IoT dataset such as size, number of features, number of classes, class imbalance, missing values and execution time. The classifiers have also been compared on various performance metrics such as precision, recall, f1-score, kappa, and accuracy. As per our results, the DT classifier gives the best accuracy of 99% among all the algorithms for all datasets. The results also show the performance of RF and KNN as almost similar and the NB and LR perform the worst among all the 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/iccubea.2018.8697476

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 5 references

Research works printed but not linked: 33

  1. jacobs, 1963, Fine particles, thin films and exchange anisotropy, Magnetism, iii, 271
  2. maxwell, 1892, A Treatise on Electricity and Magnetism, 2, 68
  3. rennie, 2003, Tackling the poor assumptions of Naive Bayes classifiers (PDF), ICML
  4. russell, 2003, Artificial Intelligence A Modern Approach
  5. 10.1007/s11390-011-1189-5 · DOI · Paper page
  6. 10.1016/j.comnet.2010.05.010 · DOI · Paper page
  7. 1955, Trans Roy Soc London, a247, 599
  8. nordrum, 2016, Popular Internet of Things Forecast of 50 Billion Devices by 2020 Is Outdated, IEEE Spectrum
  9. kaminski, 2017, A framework for sensitivity analysis of decision trees, Central European Journal of Operations Research
  10. elissa, 0, Title of Paper if Known
  11. 10.1109/JIOT.2014.2306328 · DOI · Paper page
  12. lichman, 2013, UCI Machine Learning Repository
  13. john, 1995, Estimating Continuous Distributions in Bayesian Classifiers, Proc Eleventh Conf on Uncertainty in Artificial Intelligence, 338
  14. ho, 1995, Random Decision Forests, Proceedings of the 3rd International Conference on Document Analysis and Recognition, 278
  15. ho, 1998, The Random Subspace Method for Constructing Decision Forests, IEEE Transactions on Pattern Analysis and Machine Intelligence, 20, 832, 10.1109/34.709601 · DOI · Paper page
  16. 10.1037/h0071325 · DOI · Paper page
  17. pearson, 1901, On Lines and Planes of Closest Fit to Systems of Points in Space, Philosopical Magazine, 2, 572
  18. 10.5120/2619-3544 · DOI
  19. 10.1023/A:1007608224229 · DOI · Paper page
  20. adil, 2014, A Survey of Clustering Algorithms for Big Data: Taxonomy and Empirical Analysis, IEEE Transactions on Emerging Topics in Computing, 2, 267, 10.1109/TETC.2014.2330519 · DOI · Paper page
  21. 10.5120/ijca2015907120 · doi:10.5120/ijca2015907120
  22. 10.1155/2015/431047 · DOI · Paper page
  23. 10.1016/j.procs.2016.09.068 · DOI · Paper page
  24. hastie, 2008, The Elements of Statistical Learning
  25. 10.2307/2685209 · DOI
  26. 10.1017/CBO9780511815867 · DOI · Paper page
  27. 10.1109/TJMJ.1987.4549593 · DOI · Paper page
  28. 10.1109/ICICES.2017.8070723 · DOI
  29. nicole, 0, Title of paper with only first word capitalized, J Name Stand Abbrev
  30. 10.1080/01431161.2011.552923 · DOI · Paper page
  31. simon, 0, Descriptive statistics, Archived 2010–07-30 at the Wayback Machine
  32. young, 1989, The Technical Writer's Handbook
  33. weisstein, 0, Media Statistics

Cited by

See all 39

Metadata

Authors
Khadse, V., Mahalle, P. N., & Biraris, S. V.
Venue
2018 Fourth International Conference on Computing Communication Control and Automation (ICCUBEA)
Publisher
IEEE
Published
2018-08
Pages
1-6
OpenAlex
W2940523548
Cited by
39
References
5
FWCI
1.99
Type
conference paper
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: An Empirical Comparison of Supervised Machine Learning Algorithms for Internet of Things Data. https://app.cochat.ai/papers/10.1109/iccubea.2018.8697476
The paper
Khadse, V., Mahalle, P. N., & Biraris, S. V. (2018). An Empirical Comparison of Supervised Machine Learning Algorithms for Internet of Things Data. 2018 Fourth International Conference on Computing Communication Control and Automation (ICCUBEA). https://doi.org/10.1109/iccubea.2018.8697476

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.