Mining Data Streams: Systems and Algorithms

2016 ◽  
pp. 3-37
Author(s):  
Charu C. Aggarwal ◽  
Deepak S. Turaga
Keyword(s):  
Data Streams ◽  
Mining Data Streams

Mining Data Streams

2014 ◽  
pp. 123-153
Author(s):  
Jure Leskovec ◽  
Anand Rajaraman ◽  
Jeffrey David Ullman
Keyword(s):  
Data Streams ◽  
Mining Data Streams

Mining Data Streams

2006 ◽  
pp. 777-792 ◽  
Author(s):  
Haixun Wang ◽  
Philip S. Yu ◽  
Jiawei Han
Keyword(s):  
Data Streams ◽  
Mining Data Streams

Knowledge Discovery From Evolving Data Streams

2019 ◽  
pp. 19-39
Author(s):  
Prasanna Lakshmi Kompalli
Keyword(s):  
Real Time ◽  
Data Streams ◽  
Data Stream ◽  
Concept Drift ◽  
Data Stream Mining ◽  
Time Data ◽  
Stream Mining ◽  
New Challenges ◽  
Mining Data Streams ◽  
Different Sources

Data coming from different sources is referred to as data streams. Data stream mining is an online learning technique where each data point must be processed as the data arrives and discarded as the processing is completed. Progress of technologies has resulted in the monitoring these data streams in real time. Data streams has created many new challenges to the researchers in real time. The main features of this type of data are they are fast flowing, large amounts of data which are continuous and growing in nature, and characteristics of data might change in course of time which is termed as concept drift. This chapter addresses the problems in mining data streams with concept drift. Due to which, isolating the correct literature would be a grueling task for researchers and practitioners. This chapter tries to provide a solution as it would be an amalgamation of all techniques used for data stream mining with concept drift.

Mining Data Streams

2012 ◽  
pp. 108-138
Author(s):  
Anand Rajaraman ◽  
Jeffrey David Ullman
Keyword(s):  
Data Streams ◽  
Mining Data Streams

Efficient Data Streams Based Closed Frequent Itemsets Mining Algorithm

2012 ◽  
Vol 256-259 ◽  
pp. 2910-2913
Author(s):  
Jun Tan
Keyword(s):  
Data Streams ◽  
Sliding Window ◽  
Frequent Itemsets ◽  
Streaming Data ◽  
Efficient Data ◽  
Closed Itemsets ◽  
Frequent Itemsets Mining ◽  
Synthetic Datasets ◽  
Online Mining ◽  
Mining Data Streams

Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we proposed a novel sliding window based algorithm. The algorithm exploits lattice properties to limit the search to frequent close itemsets which share at least one item with the new transaction. Experiments results on synthetic datasets show that our proposed algorithm is both time and space efficient.

Mining data streams

2005 ◽  
Vol 34 (2) ◽  
pp. 18-26 ◽  
Author(s):  
Mohamed Medhat Gaber ◽  
Arkady Zaslavsky ◽  
Shonali Krishnaswamy
Keyword(s):  
Data Streams ◽  
Mining Data Streams

Mining Data Streams

Data Mining ◽  
2015 ◽  
pp. 389-427
Author(s):  
Charu C. Aggarwal
Keyword(s):  
Data Streams ◽  
Mining Data Streams

Incremental Algorithm for Discovering Frequent Subsequences in Multiple Data Streams

2011 ◽  
Vol 7 (4) ◽  
pp. 1-20 ◽  
Author(s):  
Reem Al-Mulla ◽  
Zaher Al Aghbari
Keyword(s):  
Data Streams ◽  
Data Stream ◽  
Clustering Algorithms ◽  
Arrival Rate ◽  
Time Algorithm ◽  
Incremental Algorithm ◽  
Multiple Data ◽  
Multiple Data Streams ◽  
Mining Data Streams ◽  
New Applications

In recent years, new applications emerged that produce data streams, such as stock data and sensor networks. Therefore, finding frequent subsequences, or clusters of subsequences, in data streams is an essential task in data mining. Data streams are continuous in nature, unbounded in size and have a high arrival rate. Due to these characteristics, traditional clustering algorithms fail to effectively find clusters in data streams. Thus, an efficient incremental algorithm is proposed to find frequent subsequences in multiple data streams. The described approach for finding frequent subsequences is by clustering subsequences of a data stream. The proposed algorithm uses a window model to buffer the continuous data streams. Further, it does not recompute the clustering results for the whole data stream at every window, but rather it builds on clustering results of previous windows. The proposed approach also employs a decay value for each discovered cluster to determine when to remove old clusters and retain recent ones. In addition, the proposed algorithm is efficient as it scans the data streams once and it is considered an Any-time algorithm since the frequent subsequences are ready at the end of every window.

Incremental Algorithm for Discovering Frequent Subsequences in Multiple Data Streams

2013 ◽  
pp. 259-279
Author(s):  
Reem Al-Mulla ◽  
Zaher Al Aghbari
Keyword(s):  
Data Streams ◽  
Data Stream ◽  
Clustering Algorithms ◽  
Arrival Rate ◽  
Time Algorithm ◽  
Incremental Algorithm ◽  
Multiple Data ◽  
Multiple Data Streams ◽  
Mining Data Streams ◽  
New Applications

In recent years, new applications emerged that produce data streams, such as stock data and sensor networks. Therefore, finding frequent subsequences, or clusters of subsequences, in data streams is an essential task in data mining. Data streams are continuous in nature, unbounded in size and have a high arrival rate. Due to these characteristics, traditional clustering algorithms fail to effectively find clusters in data streams. Thus, an efficient incremental algorithm is proposed to find frequent subsequences in multiple data streams. The described approach for finding frequent subsequences is by clustering subsequences of a data stream. The proposed algorithm uses a window model to buffer the continuous data streams. Further, it does not recompute the clustering results for the whole data stream at every window, but rather it builds on clustering results of previous windows. The proposed approach also employs a decay value for each discovered cluster to determine when to remove old clusters and retain recent ones. In addition, the proposed algorithm is efficient as it scans the data streams once and it is considered an Any-time algorithm since the frequent subsequences are ready at the end of every window.

Sign in / Sign up

Export Citation Format

Share Document