Online Mining of Data Streams: Applications, Techniques and Progress

Author(s):  
Haixun Wang ◽  
Jian Pei ◽  
P.S. Yu
Keyword(s):  
2012 ◽  
Vol 256-259 ◽  
pp. 2910-2913
Author(s):  
Jun Tan

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.


2007 ◽  
Vol 16 (2) ◽  
pp. 245-258 ◽  
Author(s):  
Xuan Hong Dang ◽  
Wee-Keong Ng ◽  
Kok-Leong Ong

Author(s):  
Albert Bifet ◽  
Ricard Gavaldà

Nowadays, advanced analysis of data streams is quickly becoming a key area of data mining research, as the number of applications demanding such processing increases. Online mining when such data streams evolve over time, that is, when concepts drift or change completely, is becoming one of the core issues. At the same time, closure-based mining on relational data has recently provided some interesting algorithmic developments as well as practical uses. In this chapter we show how to use closure-based mining to reduce drastically the number of attributes in XML tree classification tasks. Moreover, using maximal frequent trees, we reduce even more the number of attributes needed in tree classification, in many cases without losing accuracy. We show a general framework to classify XML trees using subtree occurrence, composing a Tree XML Closed Frequent Miner with a classifier algorithm. We present specific methods that can adaptively mining closed patterns from data streams that change over time.


2012 ◽  
Vol 263-266 ◽  
pp. 231-240
Author(s):  
Yi Min Mao ◽  
Zhi Gang Chen ◽  
Li Xin Liu

With the emergence of large-volume and high-speed streaming data, traditional techniques for mining closed frequent itemsets has become inefficient. Online mining of closed frequent itemsets over streaming data is one of the most important issues in mining data streams. In this paper, a combinative data structure is designed by using an effective bit-victor to represent items and an extended dictionary frequent item list to record the current closed frequent information in streams. For tremendous reduction of search space, some new search strategies are proposed to avoid a large number of intermediate itemsets generated. Meanwhile, some new pruning strategies are also proposed for the purpose of efficiently and dynamically maintaining of all the closure check operations. Experimental results show that the method proposed is efficient in time, with sound scalability as the number of transactions processed increases and adapts rapidly to the changes in data streams.


Author(s):  
Shaaban Abbady ◽  
Cheng-Yuan Ke ◽  
Jennifer Lavergne ◽  
Jian Chen ◽  
Vijay Raghavan ◽  
...  

2013 ◽  
Vol 17 (4) ◽  
pp. 569-587 ◽  
Author(s):  
Guangyan Huang ◽  
Yanchun Zhang ◽  
Jie Cao ◽  
Michael Steyn ◽  
Kersi Taraporewalla

Sign in / Sign up

Export Citation Format

Share Document