IAPI QUAD-FILTER: AN INTERACTIVE AND ADAPTIVE PARTITIONED APPROACH FOR INCREMENTAL FREQUENT PATTERN MINING

Association rule mining has been proposed for market basket analysis and to predict customer purchasing/spending behaviour by analyzing the frequent itemsets in a large pool of transactions. Finding frequent itemsets from a very large and dynamic dataset is a time consuming process. Several sequential algorithms have contributed to frequent pattern generation. Most of them face problems of time and space complexities and do not support incremental mining to accommodate change in customer purchase behaviour. To reduce these complexities researchers propose partitioned and parallel approaches; but they are compromising on anyone of these. An interactive and adaptive partitioned incremental mining algorithm with four level filtering approaches for frequent pattern mining is proposed here. It prepares incremental frequent patterns, without generating local frequent itemsets in less time and space complexities and is efficiently applicable to both sequential and parallel mining.

[1]  Osmar R. Zaïane,et al.  COFI approach for mining frequent itemsets revisited , 2004, DMKD '04.

[2]  Shamkant B. Navathe,et al.  An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.

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

[4]  Chieh-Yuan Tsai,et al.  A Web services-based collaborative scheme for credit card fraud detection , 2004, IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004.

[5]  Zhan Li,et al.  Knowledge and Information Systems , 2007 .

[6]  Qingzhong Liu,et al.  Behaviour Mining for Fraud Detection , 2007, J. Res. Pract. Inf. Technol..

[7]  Qian Wan,et al.  Compact transaction database for efficient frequent pattern mining , 2005, 2005 IEEE International Conference on Granular Computing.

[8]  Mohammad Nadimi,et al.  An Efficient Prefix Tree for Incremental Frequent Pattern Mining , 2013 .

[9]  Bay Vo Fast Algorithm for Mining Generalized Association Rules , 2009 .

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

[11]  Rajeev Motwani,et al.  Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.

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

[13]  Christian Hidber,et al.  Association Rule Mining , 2017 .

[14]  Young-Koo Lee,et al.  Efficient single-pass frequent pattern mining using a prefix-tree , 2009, Inf. Sci..

[15]  Christian Borgelt,et al.  EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT , 2003 .

[16]  Mohammed J. Zaki Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..

[17]  David Wai-Lok Cheung,et al.  Efficient Mining of Association Rules in Distributed Databases , 1996, IEEE Trans. Knowl. Data Eng..