Research Article Open Access

Mining Sequential Access Pattern with Low Support From Large Pre-Processed Web Logs

S. Vijayalakshmi1 and V. Mohan1
  • 1 ,
Journal of Computer Science
Volume 6 No. 11, 2010, 1293-1300

DOI: https://doi.org/10.3844/jcssp.2010.1293.1300

Submitted On: 21 August 2010
Published On: 23 October 2010

How to Cite: Vijayalakshmi, S. & Mohan, V. (2010). Mining Sequential Access Pattern with Low Support From Large Pre-Processed Web Logs. Journal of Computer Science, 6(11), 1293-1300. https://doi.org/10.3844/jcssp.2010.1293.1300

Abstract

Problem statement: To find frequently occurring Sequential patterns from web log file on the basis of minimum support provided. We introduced an efficient strategy for discovering Web usage mining is the application of sequential pattern mining techniques to discover usage patterns from Web data, in order to understand and better serve the needs of Web-based applications. Approach: The approaches adopt a divide-and conquer pattern-growth principle. Our proposed method combined tree projection and prefix growth features from pattern-growth category with position coded feature from early-pruning category, all of these features are key characteristics of their respective categories, so we consider our proposed method as a pattern growth, early-pruning hybrid algorithm. Results: Our proposed Hybrid algorithm eliminated the need to store numerous intermediate WAP trees during mining. Since only the original tree was stored, it drastically cuts off huge memory access costs, which may include disk I/O cost in a virtual memory environment, especially when mining very long sequences with millions of records. Conclusion: An attempt had been made to our approach for improving efficiency. Our proposed method totally eliminates reconstructions of intermediate WAP-trees during mining and considerably reduces execution time.

Download

Keywords

  • Data mining
  • sequential pattern mining
  • frequent pattern mining
  • web usage mining
  • hybrid algorithm
  • WAP-tree