ENHANCED RECONFIGURABLE WEIGHTED ASSOCIATION RULE MINING FOR FREQUENT PATTERNS OF WEB LOGS
DOI:
https://doi.org/10.47839/ijc.13.2.624Keywords:
Frequent pattern mining, FPGA, reconfigurable architecture, systolic tree, Automatic weight estimation, WARM, Web logs.Abstract
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.References
J. Han, J. Pei, Y. Yin and R. Mao, Mining frequent patterns without candidate generation: a frequent-pattern tree approach, Data Mining and Knowledge Discovery, (8) 1 (2004), pp. 53-87.
S. Sun and J. Zambreno, Mining association rules with systolic trees, Proceedings of the International Conference on Field-Programmable Logic and Applications (FPL’08), September 2008.
S. Sun and J. Zambreno, Design and analysis of a reconfigurable platform for frequent pattern mining, IEEE Transactions on Parallel and Distributed Systems, (22) 9 (2011), pp. 1497-1505.
F. Tao, F. Murtagh, M. Farid, Weighted association rule mining using weighted support and significance framework, Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD’03, Washington DC, USA, 24 - 27 Aug 2003, pp. 661-666.
Z. K. Baker and V. K. Prasanna, Efficient hardware data mining with the apriori algorithm on FPGAs, Proceedings of the 13th Annual IEEE Symposium on Custom Field-Programmable Custom Computing Machines (FCCM’05), 2005, pp. 3-12.
Z. K. Baker and V. K. Prasanna, An architecture for efficient hardware data mining using reconfigurable computing systems, Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’06), 2006, pp. 67-75.
Y.-H. Wen, J.-W. Huang, and M.-S. Chen, Hardware-enhanced association rule mining with hashing and pipelining, IEEE Transactions on Knowledge and Data Engineering, (20) 6 (2008), pp. 784-795.
R. Narayanan, D. Honbo, G. Memik, A. Choudhary, and J. Zambreno, An FPGA implementation of decision tree classification, Procideengs of the Conference on Design, Automation, and Test in Europe (DATE), April 2007, pp. 189-194.
Ke Sun and Fengshan Bai, Mining weighted association rules without preassigned weights, IEEE Transactions on Knowledge and Data Engineering, (20) 4 (2008), pp. 489-495.
Mamatha Nadikota, Satya P. Kumar Somayajula and C. P. V. N. J. Mohan Rao, Hashing and pipelining techniques for association rule mining, International Journal of Computer Science and Information Technologies, (2) 4 (2011), pp. 1448-1452.
J. Han, J. Pei and Y. Yin, Mining frequent patterns without candidate generation, Proceeding Proceedings of the ACM SIGMOD International Conference on Management of Data SIGMOD'00, 2000, Paper ID: 196, pp. 1-12.
W. Wang, J. Yang and P. Yu, Efficient mining of weighted association rules (WAR), Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2000, pp. 270-274.
R. Iváncsy and I. Vajk, Frequent pattern mining in web log data, Acta Polytechnica Hungarica, (3) 1 (2006), pp. 77-90.
L. Sun and X. Zhang, Efficient frequent pattern mining on web logs”, J. X. Yu, X. Lin, H. Lu, and Y. Zhang (Eds.): APWeb 2004, Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg, Vol. 3007, 2004, pp. 533-542, 2004.
F. Bonchi and B. Goethals, FP-Bonsai, the art of growing and pruning small FP-trees, Proceedings of the 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining PAKDD’04, Sydney, Australia, Springer-Verlag, Heidelberg, Germany, 2004, pp. 155-160.
J. Gao, Realization of new association rule mining algorithm, Proceedings of the IEEE International Conference on Computational Intelligence and Security CIS’07, 15-19 December 2007, pp. 201-204.
R. Mishra and A. Choubey, Discovery of frequent patterns from web log data by using FP-growth algorithm for web usage mining, International Journal of Advanced Research in Computer Science and Software Engineering, (2) 9 (2012), pp. 311-318.
Downloads
Published
How to Cite
Issue
Section
License
International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:• Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
• Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
• Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
