期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2014
卷号：5
期号：6
页码：7961-7964
出版社：TechScience Publications
摘要：Explosion is the major challenge which our information industry is facing everyday. As World Wide Web has lots of data there is a need for discovery & analysis of useful information over the web. For this, we use web access pattern which is sequence of accesses followed by users frequently. Finding Web access pattern comes under sequential pattern mining which is the process of applying data mining technique to sequential database in order to discover co-relation relationship that exist among ordered list of events. Web access pattern tree (WAP) can be used to analyze web log access sequences, which first store the original web access sequences database on a pre-fix tree then WAP tree algorithm mine the frequent sequences from the WAPtree in recursive manner by reconstructing intermediate tree starting with suffix sequences & ends with prefix sequences . We have an attempt to improve the efficiency of WAP tree approach. In Binate code WAP , We totally eliminate the need to reconstruct number of intermediate WAP-tree so that we can reduces execution time considerably.
关键词：WAP tree; data mining; sequential data mining;frequent pattern tree
