期刊文献+

基于s-Tree算法的个性化推荐服务研究 被引量:2

Study on s-Tree Algorithm for Personalized Recommendation
下载PDF
导出
摘要 本文提出了基于关联规则的挖掘最大频繁访问的新算法——s-Tree算法,并以此去分析用户的访问模式,挖掘出特定用户访问模式和浏览偏爱路径信息,进而优化站点结构,为用户提供“一对一”个性化的Web页面访问预测及内容推荐。 This article proposes a new algorithm based on the connection rule excavation most greatly frequent visit—— s-Tree algorithm, and analyzes the user by this visit pattern, excavates the specific user visit pattern and the browsing is partial to routing information, then optimizes the stand structure, provides "one to one" the personalized Web page visit forecast and the content recommendation.
机构地区 浙江师范大学
出处 《计算机科学》 CSCD 北大核心 2007年第4期217-221,共5页 Computer Science
基金 2006年度浙江省教育厅科研项目立项:"基于Web使用挖掘的个性化推荐系统的研发" 项目编号20060440
关键词 WEB使用挖掘 个性化服务 推荐 Web Usage Mining(WUM),Personalization, Recommend
  • 相关文献

参考文献10

  • 1Aggarwal C,Yu P.Data Mining Techniques for Personalization[J].IEEE Data Engineering Bulletin,2000,23(1):4~9
  • 2Cooley R,Mobasher B,Srivastava J.Data preparation for mining world wide Web browsing patterns.Journal of Knowledge and Information Systems,1999(1):230~241
  • 3Srivastava J,Cooley R,Deshpande M,et al.Web Usage Mining:Discovery and App lications of Usage Patterns from Web Data[J].SIGKDD Exp lorations,Newsletter of SIGKDD,2000(1):12~23
  • 4Pierrakos D,Paliouras G.Web Usage Mining as a Tool for Personalization:A Survey[J].Kluwer Academic Publishers,2003.311~372
  • 5张慧颖,焦霖楠.用户访问模式聚类分析在网页推荐中的应用[J].计算机工程,2006,32(15):64-66. 被引量:5
  • 6Han Jiawei,Kamber M.Data Mining:Concepts and Technlques[M].Morgan Kaufmann Publishers.inc,2001
  • 7Wu Song,Jin Hai,Tan Guang.Symmetrical Declustering:A Load Balancing and Fault To lerant Strategy for Clustered Video Servers[C].In:International Conference on Computational Science and Its Applications,2003.199~208
  • 8詹宇斌,殷建平,张玲,龙军,程杰仁.一种基于有向树挖掘Web日志中最大频繁访问模式的方法[J].计算机应用,2006,26(7):1662-1665. 被引量:9
  • 9Han J,Kamber M.Data mining:concepts and techniques[M].San Francisco:Morgan Kaufmann Publishers Inc,2001
  • 10Scime A.Web mining:application and techniques[M].Hershey:Idea Group Publishing,2004

二级参考文献17

  • 1汪卫,周皓峰,袁晴晴,楼宇波,施伯乐.基于图论的频繁模式挖掘[J].计算机研究与发展,2005,42(2):230-235. 被引量:17
  • 2EZEIFE C, LU Y. Mining Web Log Sequential Patterns with Position Coded Pre-Order Linked WAP-Tree [ J]. Data Mining and Knowledge Discovery, 2005, 10( 1 ) : 5 - 38.
  • 3INOKUCHI A, WASHIO T, MOTODA H. An apriori-based algorithm for mining frequent substructures from graph data[ A]. PKDD2000[C]. Lyon, France, 2000.
  • 4KURAMOCHI M, KARYPIS G. Frequent subgraph discovery[ A].ICDM2001 [ C]. San Jose, USA, 2001.
  • 5SRIVASTAVA J, COOLEY R, DESHPANDE M, et al. Web usage mining: Discovery and applications of usage patterns from Web data[J]. SIGKDD Explorations, 2000, 1(2): 12 -23.
  • 6KOSALA R, BLOCKEEL H. Web mining research: a survey[ J].ACM SIGKDD Explorations, 2000, 2(1).
  • 7PEI J, HAN J, MORTAZAVI-ASL B, et al. Mining access patterns efficiently from Web logs[ A]. Proceedings of 4th Pacific Asia Conference on Knowledge Discovery and Data Mining[ C]. Tokyo, Japan, 2000.
  • 8HAN J, PEI, J, YIN Y. Mining frequent patterns without candidate generation[ A]. SIGMOD2000[ C].2000.
  • 9SUN L, ZHANG X. Efficient Frequent Pattern Mining on Web Logs[ A]. APWeb 2004[ C].2004. 533 -542.
  • 10AGRAWAL R, SRIKANT R. Fast algorithms for mining association rules in large database[ A]. VLDB1994[C].1994. 487 -499.

共引文献12

同被引文献5

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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