Bit Representation for Candidate Itemset Generation

In association rule mining, storing the itemsets in the memory is one of the main challenges. If the database is very large, storing the generated itemsets in the memory becomes infeasible. Sometimes, an additional storage or a secondary memory is required for such database. This not only increases the cost but also the time to retrieve the itemsets from the main memory to secondary memory and vice versa. To overcome this problem, a representation using bit is used. It is one of the most promising and efficient ways to represent the itemsets especially when we are dealing with large memory requirement. This paper will represent the itemsets for the candidate generation using bit representation.

[1]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[2]  V. Umarani,et al.  A Bitmap Approach for Closed and Maximal Frequent Itemset Mining , 2012 .

[3]  Ramakrishnan Srikant,et al.  Mining generalized association rules , 1995, Future Gener. Comput. Syst..

[4]  G. Antoshenkov,et al.  Byte-aligned bitmap compression , 1995, Proceedings DCC '95 Data Compression Conference.

[5]  Nick Koudas.  Space efficient bitmap indexing , 2000, CIKM '00.

[6]  Daniel Serrano,et al.  Condensed representation of frequent itemsets , 2014, IDEAS.

[7]  Victor I. Chang,et al.  Neutrosophic Association Rule Mining Algorithm for Big Data Analysis , 2018, Symmetry.

[8]  Gösta Grahne,et al.  Efficiently Using Prefix-trees in Mining Frequent Itemsets , 2003, FIMI.

[9]  Alistair Moffat,et al.  Parameterised compression for sparse bitmaps , 1992, SIGIR '92.

[10]  Devavrat Shah,et al.  Turbo-charging vertical mining of large databases , 2000, SIGMOD 2000.

[11]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[12]  Sanguthevar Rajasekaran,et al.  A transaction mapping algorithm for frequent itemsets mining , 2006 .

[13]  Johannes Gehrke,et al.  Sequential PAttern mining using a bitmap representation , 2002, KDD.

[14]  Thanh-Trung Nguyen,et al.  Mining incrementally closed item sets with constructive pattern set , 2018, Expert Syst. Appl..

[15]  Ramakrishnan Srikant,et al.  Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.

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

[17]  Yannis E. Ioannidis,et al.  Bitmap index design and evaluation , 1998, SIGMOD '98.

[18]  Arie Shoshani,et al.  Optimizing bitmap indices with efficient compression , 2006, TODS.

[19]  Carynthia Kharkongor,et al.  Set Representation for Itemsets in Association Rule Mining , 2018, 2018 Second International Conference on Intelligent Computing and Control Systems (ICICCS).