期刊文献+

新型用户访问模式挖掘方法研究

Research on the New Mining Method of User Access Patterns
下载PDF
导出
摘要 用户访问模式反映了用户浏览网站的规律,可从中发现用户的访问兴趣。常用的模式发现方法则是从用户的访问日志中挖掘用户的频繁遍历路径。由于基于Apriori算法的频繁遍历路径挖掘方法需频繁访问数据库和产生大量的候选项,提出了新型的遍历路径树的数据结构,用以挖掘用户的频繁遍历路径,通过与传统算法比较,提高了挖掘效率。 User access patterns reflect the laws of the user browsing the sites and the interest of user's access.The common pattern discovery method is mining frequent traversal paths of the user from the user's access logs.As the mining method of the frequent traversal path based on Apriori algorithm needs frequent access to the database and produce large amounts of candidate items,this paper presents a new data structure of the traverse path tree to mine user's frequent traversal paths.Results show that the mining efficiency is improved comparing with the traditional method.
出处 《电子科技大学学报》 EI CAS CSCD 北大核心 2012年第1期70-73,共4页 Journal of University of Electronic Science and Technology of China
基金 新世纪人才(NCET-10-0298) 四川省科技厅科技支撑计划(2011GZ0192)资助
关键词 访问模式 频繁遍历路径 支持度 access mode frequent traversal path support
  • 相关文献

参考文献13

  • 1FACCA F M, LANZI P L. Mining interesting knowledge from Web logs[J]. Data and Knowledge Engineering, 2005, 53(3): 225-241.
  • 2NINA S P, RAHMAN M, BHUIYAN K I, et al. Pattern discovery of Web usage mining[C]//Intemational Conference on Computer Technology and Development, Kota Kinabalu: IEEE Press, 2009.
  • 3SRIVASTAVA J, COOLEYZ R. Web usage mining: Discovery and applications of usage patterns from Web data[J]. SIGKDD Explorations, 2000, 1(2): 12-23.
  • 4CHEN M S, PARK J S, YU P S. Efficient data mining for path traversal patterns[J]. 1EEE Transactions on Knowledge and Data Engineering, 1998, 10: 209-221.
  • 5AGRAWAL R, IMIELINSKI T, SWAMI A. Database mining: a performance perspective[J]. IEEE Transactions on Knowledge and Data Engineering, 1993, 5(6): 914-925.
  • 6钱光超,贾瑞玉,张然,李龙澍.Apriori算法的一种优化方法[J].计算机工程,2008,34(23):196-198. 被引量:47
  • 7PEI Jia-wei, HAN J W, MORTAZAVI A B, et al. PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth[C]//Proceedings of IEEE Conference on Data Engineering, [S.I.]: IEEE Press, 2001: 215-224.
  • 8HAN Jia-wei, PEI Jian. Mining frequent patterns by pattem-growth: methodology and implications[C]//ACM SIGKDD Explorations. [S.I.]: [s.n.], 2000: 14-20.
  • 9MIZHER J, DUNHAM, M H, LU L, et al. Scalability of OAT[C]//The 3rd ACS/IEEE International Conference on Computer Systems and Applications. Dallas, TX, USA: IEEE Press, 2005: 48.
  • 10何丽,韩文秀.一种基于后缀树的Web访问模式挖掘算法[J].计算机应用,2004,24(11):68-70. 被引量:6

二级参考文献29

  • 1周焕银,张永,蔺鹏.一种不产生候选项挖掘频繁项集的新算法[J].计算机工程与应用,2004,40(15):182-185. 被引量:14
  • 2胡吉明,鲜学丰.挖掘关联规则中Apriori算法的研究与改进[J].计算机技术与发展,2006,16(4):99-101. 被引量:59
  • 3Witten I H.Frank E.Data Mining:Practical Machine Learning Tools and Techniques[M].北京:机械工业出版社,2006.
  • 4Tan Pangning, Steinbach M, Kumar V. Introduction to DataMining[M].北京:人民邮电出版社,2006.
  • 5[1]XIAO YQ,DNNHAM MH.Efficient mining of traversal patterns[ J].Data & Knowledge Engineering,2001,39:191-214.
  • 6[2]BUCHNER AG,BAUMGARTEN M,ANAND SS,et al.Navigation pattern discovery from intemet data[ Z].Workshop on Web Usage Analysis and user Profiling,August 1999.
  • 7[3]CHEN MS,PARK JS,YU PS.Efficient data mining for path traveral patterns[ J].IEEE Transactions Knowledge Data Eng,1998,10 (2):209-221.
  • 8[4]SPILIOPOULOU M.Web usage mining for Web site evaluation[ J].Communication ACM,2000,43(8):127-134.
  • 9[5]UKKONEN E.On-line construction of suffix trees[ J].Algorithmica,1995,14(3):249-260.
  • 10Agrawal R, Srikant R. Mining Sequential Patterns. In: Proceedings of 11th International Conference on Data Engineering Taipei, Taiwan,IEEEComputer Society press, Silver Spring, 1995-03

共引文献68

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部