期刊名称：Applied Computational Intelligence and Soft Computing
印刷版ISSN：1687-9724
电子版ISSN：1687-9732
出版年度：2012
卷号：2012
DOI：10.1155/2012/593147
出版社：Hindawi Publishing Corporation
摘要：Discovering access patterns from web log data is a typical sequential pattern mining application, and a lot of access pattern mining algorithms have been proposed. In this paper, we propose an improved approach of Gap-BIDE algorithm to extract user access patterns from web log data. Compared with the previous Gap-BIDE algorithm, a process of getting a large event set is proposed in the provided algorithm; the proposed approach can find out the frequent events by discarding the infrequent events which do not occur continuously in an accessing time before generating candidate patterns. In the experiment, we compare the previous access pattern mining algorithm with the proposed one, which shows that our approach is very efficient in discovering access patterns in large database.
