• Home
  • Search
  • Mining Sequential Access Pattern with Low Support From Large Pre-Processed Web Logs
  • Cite Icon6
  • https://doi.org/10.3844/jcssp.2010.1293.1300Copy DOI Icon

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

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Problem statement: To find frequently occurring Sequential patterns f rom 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 min ing techniques to discover usage patterns from Web data, in order to understand and better serve the n eeds 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 k ey 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 st ore 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 e liminates reconstructions of intermediate WAP- trees during mining and considerably reduces execut ion time.

Loading PDF

Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.