Mining Frequent Itemsets (MFI) over Data Streams: Variable Window Size (VWS) by Context Variation Analysis (CVA) of the Streaming Transactions

The challenges with respect to mining frequent items over data streaming engaging variable window size and low memory space are addressed in this research paper. To check the varying point of context change in streaming transaction we have developed a window structure which will be in two levels and supports in fixing the window size instantly and controls the heterogeneities and assures homogeneities among transactions added to the window. To minimize the memory utilization, computational cost and improve the process scalability, this design will allow fixing the coverage or support at window level. Here in this document, an incremental mining of frequent item-sets from the window and a context variation analysis approach are being introduced. The complete technology that we are presenting in this document is named as Mining Frequent Item-sets using Variable Window Size fixed by Context Variation Analysis (MFI-VWS-CVA). There are clear boundaries among frequent and infrequent item-sets in specific item-sets. In this design we have used window size change to represent the conceptual drift in an information stream. As it were, whenever there is a problem in setting window size effectively the item-set will be infrequent. The experiments that we have executed and documented proved that the algorithm that we have designed is much efficient than that of existing.

[1]  Younghee Kim,et al.  Mining Frequent Itemsets with Normalized Weight in Continuous Data Streams , 2010, J. Inf. Process. Syst..

[2]  Li Guo,et al.  Mining frequent patterns across multiple data streams , 2011, CIKM '11.

[3]  V. Sidda Reddy,et al.  Knowledge Discovery from Static Datasets to Evolving Data Streams and Challenges , 2014 .

[4]  A. Govardhan,et al.  TIFIM: Tree based Incremental Frequent Itemset Mining over Streaming Data , 2013, BIOINFORMATICS 2013.

[5]  Pauray S. M. Tsai,et al.  Mining frequent itemsets in data streams using the weighted sliding window model , 2009, Expert Syst. Appl..

[6]  Nan Jiang,et al.  CFI-Stream: mining closed frequent itemsets in data streams , 2006, KDD '06.

[7]  Ramakrishnan Srikant,et al.  The Quest Data Mining System , 1996, KDD.

[8]  Moses Charikar,et al.  Finding frequent items in data streams , 2002, Theor. Comput. Sci..

[9]  Byeong-Soo Jeong,et al.  Efficient Mining of High Utility Patterns over Data Streams with a Sliding Window Method , 2010 .

[10]  Durga Toshniwal,et al.  Compression and Privacy Preservation of Data Streamsusing Moments , 2011 .

[11]  Fan Guidan,et al.  A Frequent Itemsets Mining Algorithm Based on Matrix in Sliding Window over Data Streams , 2013, 2013 Third International Conference on Intelligent System Design and Engineering Applications.

[12]  Shonali Krishnaswamy,et al.  Mining data streams: a review , 2005, SGMD.

[13]  Young-Koo Lee,et al.  Efficient frequent pattern mining over data streams , 2008, CIKM '08.