FIAST: A Novel Algorithm for Mining Frequent Itemsets

An efficient algorithm to mine frequent item sets is crucial for mining association rules. Most of the previously used algorithms have generally been developed for using the computational time effectively, reducing the number of candidate itemsets and decreasing the number of scan in the database. However, the time can be reduced by aggregate transactions having similar itemsets. This paper, then proposes an efficient algorithm for mining frequent item sets without generating candidate itemsets called FIAST (Frequent Itemsets Algorithm for Similar Transactions). The algorithm uses a divide-and-conquer method to reduce the task into the bitwise AND operation for finding itemsets and uses a depth-first search strategy to generate all frequent itemsets. The time complexity is analyzed by mathematical proof.

[1]  Peng Gong,et al.  The Application of Improved Association Rules Data Mining Algorithm Apriori in CRM , 2007, 2007 2nd International Conference on Pervasive Computing and Applications.

[2]  Raj P. Gopalan,et al.  CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure , 2004, FIMI.

[3]  Ramasamy Uthurusamy,et al.  Data mining and knowledge discovery in databases , 1996, CACM.

[4]  David C. Yen,et al.  Data mining techniques for customer relationship management , 2002 .

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

[6]  Dimitris Kanellopoulos,et al.  Association Rules Mining: A Recent Overview , 2006 .

[7]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery in Databases , 1996, AI Mag..

[8]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[9]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[10]  Shu-Hsien Liao,et al.  Mining product maps for new product development , 2008, Expert Syst. Appl..

[11]  Jie Dong,et al.  BitTableFI: An efficient mining frequent itemsets algorithm , 2007, Knowl. Based Syst..

[12]  Johannes Gehrke,et al.  MAFIA: a maximal frequent itemset algorithm , 2005, IEEE Transactions on Knowledge and Data Engineering.

[13]  Bingru Yang,et al.  Index-BitTableFI: An improved algorithm for mining frequent itemsets , 2008, Knowl. Based Syst..

[14]  A. Omari,et al.  Designing a Well-Structured E-Shop Using Association Rule Mining , 2007, 2007 Innovations in Information Technologies (IIT).

[15]  Chabane Djeraba,et al.  Mathematical Tools for Data Mining: Set Theory, Partial Orders, Combinatorics , 2008, Advanced Information and Knowledge Processing.