An Empirical Comparison of Supervised Machine Learning Algorithms for Internet of Things Data
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.
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
An empirical comparison of supervised learning algorithms
Caruana, R., & Niculescu-Mizil, A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143865 · Cited by 2,780
Machine learning with big data: challenges and approaches.
L'Heureux, A., Grolinger, K., Elyamany, H. F., & Capretz, M. A. M. (2017) · IEEE Access · doi:10.1109/access.2017.2696365 · Cited by 1,023
Big IoT data analytics: Architecture, opportunities, and open research challenges
(2017) · IEEE Access · doi:10.1109/access.2017.2689040 · Cited by 980
Machine learning for internet of things data analysis: a survey
Mahdavinejad, M. S., Rezvan, M., Barekatain, M., Adibi, P., Barnaghi, P., & Sheth, A. P. (2018) · Digital Communications and Networks · doi:10.1016/j.dcan.2017.10.002 · Cited by 921
Data Mining for Internet of Things: A Survey
Tsai, C.-W., Lai, C.-F., Chiang, M.-C., & Yang, L. T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.103013.00206 · Cited by 620 · cited 1×
“In [10] authors propose a survey to counter the challenges faced in preparing and preprocessing of data in IoT by using data mining techniques, this study divided the research into three major parts.”
Method
Research works printed but not linked: 33
- jacobs, 1963, Fine particles, thin films and exchange anisotropy, Magnetism, iii, 271
- maxwell, 1892, A Treatise on Electricity and Magnetism, 2, 68
- rennie, 2003, Tackling the poor assumptions of Naive Bayes classifiers (PDF), ICML
- russell, 2003, Artificial Intelligence A Modern Approach
- 10.1007/s11390-011-1189-5 · DOI · Paper page
- 10.1016/j.comnet.2010.05.010 · DOI · Paper page
- 1955, Trans Roy Soc London, a247, 599
- nordrum, 2016, Popular Internet of Things Forecast of 50 Billion Devices by 2020 Is Outdated, IEEE Spectrum
- kaminski, 2017, A framework for sensitivity analysis of decision trees, Central European Journal of Operations Research
- elissa, 0, Title of Paper if Known
- 10.1109/JIOT.2014.2306328 · DOI · Paper page
- lichman, 2013, UCI Machine Learning Repository
- john, 1995, Estimating Continuous Distributions in Bayesian Classifiers, Proc Eleventh Conf on Uncertainty in Artificial Intelligence, 338
- ho, 1995, Random Decision Forests, Proceedings of the 3rd International Conference on Document Analysis and Recognition, 278
- 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
- 10.1037/h0071325 · DOI · Paper page
- pearson, 1901, On Lines and Planes of Closest Fit to Systems of Points in Space, Philosopical Magazine, 2, 572
- 10.5120/2619-3544 · DOI
- 10.1023/A:1007608224229 · DOI · Paper page
- 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
- 10.5120/ijca2015907120 · doi:10.5120/ijca2015907120
- 10.1155/2015/431047 · DOI · Paper page
- 10.1016/j.procs.2016.09.068 · DOI · Paper page
- hastie, 2008, The Elements of Statistical Learning
- 10.2307/2685209 · DOI
- 10.1017/CBO9780511815867 · DOI · Paper page
- 10.1109/TJMJ.1987.4549593 · DOI · Paper page
- 10.1109/ICICES.2017.8070723 · DOI
- nicole, 0, Title of paper with only first word capitalized, J Name Stand Abbrev
- 10.1080/01431161.2011.552923 · DOI · Paper page
- simon, 0, Descriptive statistics, Archived 2010–07-30 at the Wayback Machine
- young, 1989, The Technical Writer's Handbook
- weisstein, 0, Media Statistics
Cited by
Machine learning: Algorithms, real-world applications and research directions
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00592-x · Cited by 5,583
“…such as phone call logs [84] [101], SMS Log [29], mobile application usages logs [137] [117], mobile phone notification logs [73] etc., IoT data [57] [62] [16], agri-culture and e-commerce data [138] [120], health data such as heart disease [92], diabetes mellitus [134] [83], COVID-19 [43]…”
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00765-8 · Cited by 570
Encrypted Network Traffic Analysis and Classification Utilizing Machine Learning
Alwhbi, I. A., Zou, C. C., & Alharbi, R. N. (2024) · Sensors · doi:10.3390/s24113509 · Cited by 81
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
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.