An Application of Improved Gap-BIDE Algorithm for Discovering Access Patterns. (15th August 2012)

• Record Type: Journal Article
• Authors: Yu, Xiuming; Li, Meijing; Kim, Taewook; Jeong, Seon-phil; Ryu, Keun Ho
• Other Names: Zhao Qiangfu Academic Editor.
• Is Part Of: Applied computational intelligence and soft computing. Volume 2012(2012)
• Publication Date: 2012-08-15
• Subjects: Computational intelligence -- Periodicals; Soft computing -- Periodicals; 006.305
• DOI: 10.1155/2012/593147
• Languages: English
• ISSNs: 1687-9724

Abstract

Abstract : 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.