An efficient data mining algorithm for discovering web access patterns

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a data mining technology to find non-simple frequent traversal patterns in a web environment where users can travel from one object to another through the corresponding hyperlinks. We keep track and remain the original user traversal paths in a web log, and apply the proposed data mining techniques to discover the complete traversal path which is traversed by a sufficient number of users, that is, non-simple frequent traversal patterns, from web logs. The non-simple frequent traversal patterns include forward and backward references, which are used to suggest potentially interesting traversal path to the users. The experimental results show that the discovered patterns can present the complete browsing paths traversed by most of the users and our algorithm outperforms other algorithms in discovered information and execution times. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Yen, S. J., & Lee, Y. S. (2003). An efficient data mining algorithm for discovering web access patterns. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2642, 187–192. https://doi.org/10.1007/3-540-36901-5_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free