An adaptive learning paradigm: event detection through a novel dynamic arithmetic optimization-based ensemble SVM for data stream classification

Data stream mining is the process of generating continuous data stream records such as internet search, phone conversations, sensor data, etc. However it performs huge tasks such as frequency counting, clustering, analysis as well as classification. Mining information from data streams is often cons...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of information technology (Singapore. Online) Jg. 16; H. 5; S. 3049 - 3055
Hauptverfasser: Vidya, R. Mary, Ramakrishna, M.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Singapore Springer Nature Singapore 01.06.2024
Springer Nature B.V
Schlagworte:
ISSN:2511-2104, 2511-2112
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Data stream mining is the process of generating continuous data stream records such as internet search, phone conversations, sensor data, etc. However it performs huge tasks such as frequency counting, clustering, analysis as well as classification. Mining information from data streams is often considered as a complicated process due to the rapid change in the underlying concept which is often referred to as concept drift and the high speed of data arrival. Moreover the data stream classification process is not stationary where each transmission is evolved with time. In addition to this, it cannot able to handle imbalanced data and is not able to accommodate new classes. To overcome this problem, an Ensemble Learning model based Support Vector Machine (ESVM) is proposed to perform the data stream classification. To achieve higher diversity, each base SVM is trained with different feature subsets and updated during the presence of new data instances. However, the selection of optimal feature subsets from high dimensional data streams is complex due to the increase in size and computational cost. Hence Dynamic Accelerated Function (DAF) and Dynamic Candidate Solution (DCS) approaches are developed that diminish the classification error and improve the performance with the best fitness value. The performances of the proposed methods is validated based on accuracy, precision, F-score, kappa, and relative error. The experimental result demonstrates that the proposed model is efficient when evaluated in terms of classification accuracy, rapid training, processing time, kappa score and attained an accuracy of 91.45%.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2511-2104
2511-2112
DOI:10.1007/s41870-024-01832-y