A directed tree based approach for mining maximum frequent access patterns in Web logs
一种基于有向树挖掘Web日志中最大频繁访问模式的方法

A novel Apriori-based algorithm named s-Tree was proposed for mining maximum frequent access patterns in Web logs.The main contributions of the novel algorithm were as follows.Firstly,the directed tree was used to represent the user session,which enabled us to mine the maximum forward reference transaction and the users' preferred access path.Secondly,a novel method for counting supporting degree based on content first,which helped us to discover some more important and interesting patterns than normal methods.Thirdly,two special strategies were adopted to reduce the overhead of jointing frequent patterns.Experiment results show that the s-Tree algorithm is scalable,and is more efficient than previous graph-based structure pattern mining algorithms such as AGM(Apriori-based Graph Mining) and FSG(Frequent Subgraph Discovery).