Show simple item record

dc.contributor.authorAl-Dawsari, Amal
dc.contributor.authorAl-Turaiki, Isra
dc.contributor.authorKurdi, Heba
dc.date.accessioned2022-04-04T19:49:13Z
dc.date.available2022-03-24T19:01:38Z
dc.date.available2022-04-04T19:49:13Z
dc.date.issued2022-03
dc.date.submitted2022-02
dc.identifier.issn1424-8220
dc.identifier.urihttps://hdl.handle.net/1721.1/141367.2
dc.description.abstractInternet 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.en_US
dc.publisherMDPI AGen_US
dc.relation.isversionofhttp://dx.doi.org/10.3390/s22062223en_US
dc.rightsCreative Commons Attributionen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceMultidisciplinary Digital Publishing Instituteen_US
dc.titleIncremental Ant-Miner Classifier for Online Big Data Analyticsen_US
dc.typeArticleen_US
dc.identifier.citationSensors 22 (6): 2223 (2022)en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mechanical Engineering
dc.relation.journalSensorsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2022-03-24T14:46:51Z
dspace.date.submission2022-03-24T14:46:51Z
mit.journal.volume22en_US
mit.journal.issue6en_US
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

VersionItemDateSummary

*Selected version