This is not the latest version of this item. The latest version can be found here.
Incremental Ant-Miner Classifier for Online Big Data Analytics
Name
sensors-22-02223-v2.pdf
Size
519.51 KB
Format
Adobe PDF
Checksum (MD5)
e4055fc5d656f5d57b5f44238c3149bf
Author(s)
Al-Dawsari, Amal
Al-Turaiki, Isra
Kurdi, Heba
Date Issued
March 13, 2022
Publisher
Multidisciplinary Digital Publishing Institute
Citation
Sensors 22 (6): 2223 (2022)
Version
Final published version
Abstract
Internet of Things (IoT) environments produce large amounts of data that are challenging to analyze. The most challenging aspect is reducing the quantity of consumed resources and time required to retrain a machine learning model as new data records arrive. Therefore, for big data analytics in IoT environments where datasets are highly dynamic, evolving over time, it is highly advised to adopt an online (also called incremental) machine learning model that can analyze incoming data instantaneously, rather than an offline model (also called static), that should be retrained on the entire dataset as new records arrive. The main contribution of this paper is to introduce the Incremental Ant-Miner (IAM), a machine learning algorithm for online prediction based on one of the most well-established machine learning algorithms, Ant-Miner. IAM classifier tackles the challenge of reducing the time and space overheads associated with the classic offline classifiers, when used for online prediction. IAM can be exploited in managing dynamic environments to ensure timely and space-efficient prediction, achieving high accuracy, precision, recall, and F-measure scores. To show its effectiveness, the proposed IAM was run on six different datasets from different domains, namely horse colic, credit cards, flags, ionosphere, and two breast cancer datasets. The performance of the proposed model was compared to ten state-of-the-art classifiers: naive Bayes, logistic regression, multilayer perceptron, support vector machine, K*, adaptive boosting (AdaBoost), bagging, Projective Adaptive Resonance Theory (PART), decision tree (C4.5), and random forest. The experimental results illustrate the superiority of IAM as it outperformed all the benchmarks in nearly all performance measures. Additionally, IAM only needs to be rerun on the new data increment rather than the entire big dataset on the arrival of new data records, which makes IAM better in time- and resource-saving. These results demonstrate the strong potential and efficiency of the IAM classifier for big data analytics in various areas.
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.3390/s22062223
