@article {10.3844/jcssp.2010.1293.1300,
article_type = {journal},
title = {Mining Sequential Access Pattern with Low Support From Large Pre-Processed Web Logs},
author = {Vijayalakshmi, S. and Mohan, V.},
volume = {6},
number = {11},
year = {2010},
month = {Oct},
pages = {1293-1300},
doi = {10.3844/jcssp.2010.1293.1300},
url = {https://thescipub.com/abstract/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.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}