Classification of Imbalanced Data Stream: Techniques and Challenges

2021 ◽  
Vol 9 (2) ◽  
pp. 36-52
Author(s):  
Mashaal A. Alfhaid ◽  
Manal Abdullah
Keyword(s):  
Data Mining ◽  
Data Stream ◽  
Concept Drift ◽  
Class Imbalance ◽  
Imbalanced Data ◽  
Predictive Performance ◽  
Knowledge Extraction ◽  
Streaming Data ◽  
Stream Data ◽  
Stream Data Mining

As the number of generated data increases every day, this has brought the importance of data mining and knowledge extraction. In traditional data mining, offline status can be used for knowledge extraction. Nevertheless, dealing with stream data mining is different due to continuously arriving data that can be processed at a single scan besides the appearance of concept drift. As the pre-processing stage is critical in knowledge extraction, imbalanced stream data gain significant popularity in the last few years among researchers. Many real-world applications suffer from class imbalance including medical, business, fraud detection and etc. Learning from the supervised model includes classes whether it is binary- or multi-classes. These classes are often imbalance where it is divided into the majority (negative) class and minority (positive) class, which can cause a bias toward the majority class that leads to skew in predictive performance models. Handles imbalance streaming data is mandatory for more accurate and reliable learning models. In this paper, we will present an overview of data stream mining and its tools. Besides, summarize the problem of class imbalance and its different approaches. In addition, researchers will present the popular evaluation metrics and challenges prone from imbalanced streaming data.

Comparative Analysis of Drift Detection Based Adaptive Ensemble Model with Different Drift Detection Techniques

2021 ◽  
Vol 23 (06) ◽  
pp. 49-55
Author(s):  
Sanjeev Kumar ◽  
◽  
Ravendra Singh ◽  
Keyword(s):  
Data Mining ◽  
Comparative Analysis ◽  
False Positive ◽  
Opinion Mining ◽  
Concept Drift ◽  
Ensemble Classifier ◽  
Stream Data ◽  
Detection Techniques ◽  
Stream Data Mining ◽  
Detection Algorithms

Stream data mining is a popular research area these days. The concept drift detection and drift handling are the biggest challenges of stream data mining. Several drift detection algorithms have been developed which can accurately detect various drifts but have the problem of false-positive drift detection. The false-positive drift detection leads to the performance degradation of the classifier because of unnecessary training in between analyses. Classifier ensemble has shown its efficiency for drift detection, drift handling, and classification. But the ensemble classifiers could not detect the exact position of drift occurrence, so it has to update itself at some fixed interval, which leads to an unnecessary computational burden on the system. Combining the drift detection algorithm with an ensemble classifier can improve the performance and also solve the problems of false-positive drift detection and unnecessary updating of the ensemble classifier. In this paper, a model is proposed that creates a weighted adaptive ensemble classifier by updating it only when a drift detection signal is given by the used drift detection method. The proposed model is evaluated on text-based stream data for sentiment analysis and opinion mining with multiple drift detection algorithms and with multiple classification algorithms as base classifiers for the ensemble. A comparative analysis has been done, and the results have shown the efficiency of the proposed models.

Novel Class Detection with Concept Drift in Data Stream - AhtNODE

2020 ◽  
Vol 11 (1) ◽  
pp. 15-26
Author(s):  
Jay Gandhi ◽  
Vaibhav Gandhi
Keyword(s):  
Data Stream ◽  
Concept Drift ◽  
Ensemble Classifier ◽  
Streaming Data ◽  
Classification Model ◽  
Infinite Length ◽  
The Novel ◽  
Stream Data ◽  
Hoeffding Tree ◽  
Discovery Method

Data stream mining has become an interesting analysis topic and it is a growing interest in data discovery method. There are several applications supporting stream data processing like device network, electronic network, etc. Our approach AhtNODE (Adaptive Hoeffding Tree based NOvel class DEtection) detects novel class in the presence of concept drift in streaming data. It addresses there are three challenges of streaming data: infinite length, concept drift, and concept evolution. This approach automatically detects the novel class whenever it arrives in the data stream. It is a multi-class approach that distinguishes novel class from existing classes. The authors tend to apply the Adaptive Hoeffding Tree as a classification model that is also used to handle the concept drift situation. Previous approaches used the ensemble model to handle concept drift. In AHT, classification is done in the single pass. The experiment result proves the effectiveness of AhtNODE compared to existing ensemble classifier in terms of classification accuracy, speed and use of memory.

EFFICIENTLY MINING RECENT FREQUENT PATTERNS OVER ONLINE TRANSACTIONAL DATA STREAMS

2009 ◽  
Vol 19 (05) ◽  
pp. 707-725 ◽  
Author(s):  
HUI CHEN
Keyword(s):  
Data Mining ◽  
Data Stream ◽  
Frequent Patterns ◽  
Stream Data ◽  
Data Stream Management ◽  
Online Data ◽  
Stream Data Mining ◽  
Network Traffic Analysis ◽  
Stream Management ◽  
Performance Results

Recent emerging applications, such as network traffic analysis, web click stream mining, power consumption measurement, sensor network data analysis, and dynamic tracing of stock fluctuation, call for study of a new kind of data, stream data. Many data stream management systems, prototype systems and software components have been developed to manage the streams or extract knowledge from stream data. Mining frequent patterns is a foundational job for the methods of data mining and knowledge discovery. This paper proposes an algorithm for mining the recent frequent patterns over an online data stream. This method uses RFP-tree to store compactly the recent frequent patterns of a stream. The content of each transaction is incrementally updated into the pattern tree upon its arrival by scanning the stream only once. Moreover, the strategy of conservative computation and time decaying model are used to ensure the correctness of the mining results. Finally, the performance results of extensive simulation show that our work can reduce the average processing time of stream data element and it is superior to other analogous algorithms.

scholarly journals Deep learning framework for handling concept drift and class imbalanced complex decision-making on streaming data

2021 ◽  
Author(s):  
S. Priya ◽  
R. Annie Uthra
Keyword(s):  
Decision Making ◽  
Deep Learning ◽  
Concept Drift ◽  
Class Imbalance ◽  
Streaming Data ◽  
Superior Performance ◽  
Data Streaming ◽  
Minority Class ◽  
Concept Drift Detection

AbstractIn present times, data science become popular to support and improve decision-making process. Due to the accessibility of a wide application perspective of data streaming, class imbalance and concept drifting become crucial learning problems. The advent of deep learning (DL) models finds useful for the classification of concept drift in data streaming applications. This paper presents an effective class imbalance with concept drift detection (CIDD) using Adadelta optimizer-based deep neural networks (ADODNN), named CIDD-ADODNN model for the classification of highly imbalanced streaming data. The presented model involves four processes namely preprocessing, class imbalance handling, concept drift detection, and classification. The proposed model uses adaptive synthetic (ADASYN) technique for handling class imbalance data, which utilizes a weighted distribution for diverse minority class examples based on the level of difficulty in learning. Next, a drift detection technique called adaptive sliding window (ADWIN) is employed to detect the existence of the concept drift. Besides, ADODNN model is utilized for the classification processes. For increasing the classifier performance of the DNN model, ADO-based hyperparameter tuning process takes place to determine the optimal parameters of the DNN model. The performance of the presented model is evaluated using three streaming datasets namely intrusion detection (NSL KDDCup) dataset, Spam dataset, and Chess dataset. A detailed comparative results analysis takes place and the simulation results verified the superior performance of the presented model by obtaining a maximum accuracy of 0.9592, 0.9320, and 0.7646 on the applied KDDCup, Spam, and Chess dataset, respectively.

A Clustering Algorithm in Stream Data Using Strong Coreset

2021 ◽  
Author(s):  
Manmohan Singh ◽  
Rajendra Pamula ◽  
Alok Kumar
Keyword(s):  
Data Mining ◽  
Clustering Algorithm ◽  
Local Optimum ◽  
Reduction Algorithm ◽  
Stream Data ◽  
Stream Data Mining ◽  
Clustering Approach ◽  
Approximation Guarantee ◽  
Competitive Algorithms ◽  
Learning Data

There are various applications of clustering in the fields of machine learning, data mining, data compression along with pattern recognition. The existent techniques like the Llyods algorithm (sometimes called k-means) were affected by the issue of the algorithm which converges to a local optimum along with no approximation guarantee. For overcoming these shortcomings, an efficient k-means clustering approach is offered by this paper for stream data mining. Coreset is a popular and fundamental concept for k-means clustering in stream data. In each step, reduction determines a coreset of inputs, and represents the error, where P represents number of input points according to nested property of coreset. Hence, a bit reduction in error of final coreset gets n times more accurate. Therefore, this motivated the author to propose a new coreset-reduction algorithm. The proposed algorithm executed on the Covertype dataset, Spambase dataset, Census 1990 dataset, Bigcross dataset, and Tower dataset. Our algorithm outperforms with competitive algorithms like Streamkm[Formula: see text], BICO (BIRCH meets Coresets for k-means clustering), and BIRCH (Balance Iterative Reducing and Clustering using Hierarchies.

Evolving clustering algorithm based on mixture of typicalities for stream data mining

2020 ◽  
Vol 106 ◽  
pp. 672-684 ◽  
Author(s):  
José Maia ◽  
Carlos Alberto Severiano ◽  
Frederico Gadelha Guimarães ◽  
Cristiano Leite de Castro ◽  
André Paim Lemos ◽  
...  
Keyword(s):  
Data Mining ◽  
Clustering Algorithm ◽  
Stream Data ◽  
Stream Data Mining
Sign in / Sign up

Export Citation Format

Share Document