%0 Conference Paper %1 Pei00miningaccess %A Pei, Jian %A Han, Jiawei %A Mortazavi-asl, Behzad %A Zhu, Hua %B Proc. 2000 Paci c-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD'00 %D 2000 %K WAP WebLog WebUsageMining %P 396--407 %T Mining Access Patterns Efficiently from Web Logs %X With the explosive growth of data available on the World Wide Web, discovery and analysis of useful information from the World Wide Web becomes a practical necessity.Web access pattern, which is the sequence of accesses pursued by users frequently, is a kind of interesting and useful knowledge in practice. In this paper, we study the problem of mining access patterns from Web logs efficiently. A novel data structure, called Web access pattern tree, or WAP-tree in short, is developed for efficient mining of access patterns from pieces of logs. The Web access pattern tree stores highly compressed, critical information for access pattern mining and facilitates the developmentofnovel algorithms for mining access patterns in large set of log pieces. Our algorithm can find access patterns from Web logs quite efficiently. The experimental and performance studies show that our method is in general an order of magnitude faster than conventional methods.

@inproceedings{Pei00miningaccess, abstract = {With the explosive growth of data available on the World Wide Web, discovery and analysis of useful information from the World Wide Web becomes a practical necessity.Web access pattern, which is the sequence of accesses pursued by users frequently, is a kind of interesting and useful knowledge in practice. In this paper, we study the problem of mining access patterns from Web logs efficiently. A novel data structure, called Web access pattern tree, or WAP-tree in short, is developed for efficient mining of access patterns from pieces of logs. The Web access pattern tree stores highly compressed, critical information for access pattern mining and facilitates the developmentofnovel algorithms for mining access patterns in large set of log pieces. Our algorithm can find access patterns from Web logs quite efficiently. The experimental and performance studies show that our method is in general an order of magnitude faster than conventional methods.}, added-at = {2009-06-18T14:09:02.000+0200}, author = {Pei, Jian and Han, Jiawei and Mortazavi-asl, Behzad and Zhu, Hua}, biburl = {https://www.bibsonomy.org/bibtex/24eb301242322c99c2d2353dba680246d/lemmi}, booktitle = {Proc. 2000 Paci c-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD'00}, description = {CiteSeerX — Mining Access Patterns Efficiently from Web Logs}, interhash = {d5d08e950d436ef96843ae916e43452a}, intrahash = {4eb301242322c99c2d2353dba680246d}, keywords = {WAP WebLog WebUsageMining}, pages = {396--407}, timestamp = {2009-06-18T14:09:02.000+0200}, title = {Mining Access Patterns Efficiently from Web Logs}, year = 2000 }