Method presented for finding Frequent Itemsets in web data streams

Continual data checking is considered as one of the most common search tools for frequent itemsets which requires storage on memory. On the other hand, according to properties of data stream which are unlimited productions with a high-speed, it is not possible saving these data on memory and we need for techniques which enables online processing and finding repetitive standards. One of the most popular techniques in this case is using sliding windows. The benefits of these windows can be reducing memory usage and also search acceleration. In this article, a new vertical display and an algorithm is provided based on the pins in order to find frequent itemsets in data streams. Since this new display has a compressed format itself so, the proposed algorithm in terms of memory consumption and processing is more efficient than any other similar algorithms.

[1]  Suh-Yin Lee,et al.  An Efficient Algorithm for Mining Frequent Itemests over the Entire History of Data Streams , 2004 .

[2]  Ming-Syan Chen,et al.  Sliding window filtering: an efficient method for incremental mining on a time-variant database , 2005, Inf. Syst..

[3]  Albert Bifet,et al.  Adaptive learning and mining for data streams and frequent patterns , 2009, SKDD.

[4]  Xin Li,et al.  Mining frequent patterns from network flows for monitoring network , 2010, Expert Syst. Appl..

[5]  Mohammed J. Zaki,et al.  Fast vertical mining using diffsets , 2003, KDD '03.

[6]  Suh-Yin Lee,et al.  Mining frequent itemsets over data streams using efficient window sliding techniques , 2009, Expert Syst. Appl..

[7]  Won Suk Lee,et al.  estWin: Online data stream mining of recent frequent itemsets by sliding window method , 2005, J. Inf. Sci..

[8]  Abdul Rauf Baig,et al.  Ramp: Fast Frequent Itemset Mining with Efficient Bit-Vector Projection Technique , 2009, ArXiv.

[9]  Carson Kai-Sang Leung,et al.  A landmark-model based system for mining frequent patterns from uncertain data streams , 2011, IDEAS '11.

[10]  Srinivasan Parthasarathy,et al.  New Algorithms for Fast Discovery of Association Rules , 1997, KDD.

[11]  O. P. Vyas,et al.  Survey on Frequent Item set Mining Algorithms , 2010 .

[12]  Young-Koo Lee,et al.  Sliding window-based frequent pattern mining over data streams , 2009, Inf. Sci..

[13]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[14]  Yu Ge,et al.  An Efficient Frequent Pattern Mining Algorithm for Data Stream , 2008, 2008 International Conference on Intelligent Computation Technology and Automation (ICICTA).

[15]  J. V. R. Murthy,et al.  Estimating Correlation Dimension Using Multi Layered Grid and Damped Window Model Over Data Streams , 2013 .

[16]  Josep-Lluís Larriba-Pey,et al.  Dynamic adaptive data structures for monitoring data streams , 2008, Data Knowl. Eng..

[17]  Felix Klaedtke,et al.  Greedily computing associative aggregations on sliding windows , 2015, Inf. Process. Lett..