期刊文献+

关联规则算法在Web个性化服务中的研究与应用 被引量:1

下载PDF
导出
摘要 重点研究了Web日志挖掘,提出了一个Web个性化信息挖掘模型,设计了某高校图书馆个性化服务系统My Library。系统采用关联规则挖掘算法,从服务器日志中得到用户感兴趣的隐式模式,并将该隐式兴趣集推荐给用户,从而在一定程度上实现了个性化服务。
出处 《计算机时代》 2008年第10期55-57,共3页 Computer Era
  • 相关文献

参考文献4

二级参考文献15

  • 1[1]C C Aggarwal,P S Yu. Mining Large Itemsets for Association Rules[J].Data Engineering Bulletin, 1998 ;21 ( 1 ) :23~31
  • 2[2]Eui-Hong Han,George Karypis,Vipin Kumar. Scalable Parallel Data Mining for Association Rules[J],IEEE Transactions on Knowledge and Data Engineering,2000; 12(3) :377~352
  • 3[3]R Agrawal,S Srikant.Fast Algorithms for Mining Association Rules[C].Proc.20th Int Conf on VLDB,Santiago,Chile,1994:487~499
  • 4[4]J S Park,M S Chen,P S Yu. An Effective Hash-Based Algorithm for Mining Association Rules[C].Proc ACM SIGMOD Int Conf Management of Data,San Jose,CA, 1995:175~186
  • 5[5]J Liu,J Yin. Towards Efficient Data Re-mining(DRM)[C].Proc PAKDD,5th Pacific-Asia Conf. Hong Kong,China,2001:406~412
  • 6[6]S D Lee,D W Cheung,B Kao.Is Sampling Useful in Data Mining?A Case in the Maintenance of Discovered Association Rules[J].Data Mining and Knowledge Discovery,Kluwer Academic Publishers,1998;2 (3): 233~262
  • 7[1]Cooley R, Mobasher B, Srivastava J. Data preparation for mining world wide web browsing patterns. Journal of Knowledge and Information Systems, 1999 (1): 230-241
  • 8[2]Agrawal, Srikant R. Fast algorithms for mining association rules.In proceedings of the 20th VLDB conference, 1994: 487-499
  • 9[3]Karypis H P. Clustering based on association rule hypergraphs.In Proccedings of SIGMOD'97 Workshop on Research Issues in DMKD'97, 1997: 331-352
  • 10[4]Karypis H P. Hypergraph based clustering in high-dimensional data sets:a summary of results. IEEE Bulletin of Technical Committee on Data Engineering, 1998, (21)1: 105-140

共引文献49

同被引文献3

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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