ENHANCED RECONFIGURABLE WEIGHTED ASSOCIATION RULE MINING FOR FREQUENT PATTERNS OF WEB LOGS

Systolic tree structure is a reconfigurable architecture in Field-programmable gate arrays (FPGA) which provide performance advantages. It is used for frequent pattern mining operations. High throughput and cost effective performance are the highlights of the systolic tree based reconfigurable architecture. Frequent pattern mining algorithms are used to find frequently occurring item sets in databases. However, space and computational time requirements are very high in frequent pattern mining algorithms. In the proposed system, systolic tree based hardware mechanism is employed with Weighted Association Rule Mining (WARM) for frequent item set extraction process of the Web access logs. Weighted rule mining is to mine the items which are assigned with weights based on user’s interest and the importance of the items. In the proposed system, weights are assigned automatically to Web pages that are visited by the users. Hence, systolic tree based rule mining scheme is enhanced for WARM process, which fetches the frequently accessed Web pages with weight values. The dynamic Web page weight assignment scheme uses the page request count and span time values. The proposed system improves the weight estimation process with span time, request count and access sequence details. The user interest based page weight is used to extract the frequent item sets. The proposed system will also improve the mining efficiency on sparse patterns. The goal is to drive the mining focus to those significant relationships involving items with significant weights.

[1]  Alok N. Choudhary,et al.  An FPGA Implementation of Decision Tree Classification , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[2]  Jun Gao.  Realization of a New Association Rule Mining Algorithm , 2007, 2007 International Conference on Computational Intelligence and Security (CIS 2007).

[3]  Satya P Kumar Somayajula,et al.  Hashing and Pipelining Techniques for Association Rule Mining , 2011 .

[4]  Bart Goethals,et al.  FP-Bonsai: The Art of Growing and Pruning Small FP-Trees , 2004, PAKDD.

[5]  Fionn Murtagh,et al.  Weighted Association Rule Mining using weighted support and significance framework , 2003, KDD '03.

[6]  Liping Sun,et al.  Efficient Frequent Pattern Mining on Web Logs , 2004, APWeb.

[7]  Philip S. Yu,et al.  Efficient mining of weighted association rules (WAR) , 2000, KDD '00.

[8]  Ke Sun,et al.  Mining Weighted Association Rules without Preassigned Weights , 2008, IEEE Transactions on Knowledge and Data Engineering.

[9]  Joseph Zambreno,et al.  Design and Analysis of a Reconfigurable Platform for Frequent Pattern Mining , 2011, IEEE Transactions on Parallel and Distributed Systems.

[10]  Ming-Syan Chen,et al.  Hardware-Enhanced Association Rule Mining with Hashing and Pipelining , 2008, IEEE Transactions on Knowledge and Data Engineering.

[11]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[12]  Viktor K. Prasanna,et al.  Efficient hardware data mining with the Apriori algorithm on FPGAs , 2005, 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'05).

[13]  Viktor K. Prasanna,et al.  An Architecture for Efficient Hardware Data Mining using Reconfigurable Computing Systems , 2006, 2006 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.

[14]  István Vajk,et al.  Frequent Pattern Mining in Web Log Data , 2006 .

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

[16]  Abha Choubey,et al.  Discovery of Frequent Patterns from Web Log Data by using FP-Growth algorithm for Web Usage Mining , 2012 .

[17]  Joseph Zambreno,et al.  Mining Association Rules with systolic trees , 2008, 2008 International Conference on Field Programmable Logic and Applications.