Extracting Weighted Frequent Patterns from Web Log Data

Authors

  • Priyanka Baraskar1, Supriya Chavan2, Dipshree Dhage3, Samruddhi Giri4, Jayshree Jha5 Information Technology, Atharva College of Engineering, Mumbai, India

Abstract

World Wide Web (WWW) today is growing into infinity and it has massive wealth of information. Mining the web is very essential in order to retrieve the necessary information for any user. Sequential Pattern Mining using weights involves applying data mining methods to large web log data to extract most weighted frequent patterns. In this paper, Sequential Pattern Mining is performed using weighted graph algorithm. This paper investigates algorithm, on the basis of various other algorithms which are designed to increase efficiency of mining. In this project we perform usage analysis which includes straightforward statistics, such as page access frequency, as well as more sophisticated forms of analysis, such as finding the common traversal paths through Website. The Weighted graph algorithm is used to find the frequent browsing patterns of the user. The experimental results show that the performance of the weighted graph algorithm is relatively better than GSP in spite of having complex calculations involving weights.
Key Words: Generalized Sequential Pattern, Graph Based Web, Sequential Pattern Mining, Weighted Graph Web Usage Mining

Downloads

Published

2015-04-28

How to Cite

Jayshree Jha5, P. B. S. C. D. D. S. G. (2015). Extracting Weighted Frequent Patterns from Web Log Data. International Journal of Engineering Technology and Computer Research, 3(2). Retrieved from https://ijetcr.org/index.php/ijetcr/article/view/155

Issue

Section

Articles