期刊文献+

基于闭相关页面集实现网站自适应

Realizing Adaptive Web Cites Based on Correlative Page Set
下载PDF
导出
摘要 自适应网站能够根据用户需要快速灵活地改变自身,动态适应不断变化的用户需求和应用环境。本文基于图的频繁闭项集从站点一定时期内的日志中挖掘出闭相关页面集,据此提供在线动态推荐为用户导航,改善了传统的合作推荐存在的稀疏性和扩展性问题,在不增大网站服务器负荷的情况下提高对所有用户的信息服务质量。最后,分析了两种测量推荐系统性能的方法并对系统进行评价。 Adaptive web cites can automatically and flexibly improve their organization to fit users' requirements and application environments that are always changing continually. According to concept of frequent-close-item set based on graph, this paper provides method of on-line dynamic recommendation based on close correlative page set mined from websites' logs of a period. This method improves problems of sparsity and expansibility of traditional collaborative recommendation and enhances quality of service without increasing servers' load. Finally this paper analyzes two methods of measuring performance of recommendation system and evaluates the system.
出处 《计算机科学》 CSCD 北大核心 2006年第3期75-79,共5页 Computer Science
关键词 网站自适应 相关页面集 闭相关页面集 动态推荐 Adaptive web cite, Correlative page set, Close correlative page set, Dynamic recommendation
  • 相关文献

参考文献13

  • 1Perkowitz M,Etzioni O.Towards Adaptive Web Sites-Conceptual Framework and Case Study.Artificial Intelligence,2000,118:245~2751.
  • 2Perkowitz M,Etzioni O.Adaptive Web Sites:An AI challenge.In:Proc.of the IJCAI-97,1997.
  • 3Koutri M,Daskalaki S,Avouris N.Adaptive Interaction with Web Sites:An Overview of Methods and Techniques.
  • 4Sher B M,et al.Automatic personalization based in web usage mining [J].Communications of the ACM,2000,43(8) :142~151.
  • 5Demiriz A,Zaki M J.webSPADE:A Parallel Sequence Mining Algorithm to Analyze the Web Log Data,2002.
  • 6PaCquier N,BaCtide Y,Taouil R,et al.Discovering frequent closed item sets for association rules [A] ,In:The 7th Intl.Conf.on Database Theorv [C],1999.
  • 7李力,翟东海,靳蕃.基于图的频繁闭项集挖掘算法[J].西南交通大学学报,2004,39(3):385-389. 被引量:7
  • 8Rucher J,Polanco M J.SiteSeer:personalized navigation for the web [J].Communications of the ACM,1997,40.
  • 9Balabanovicm.An adaptive Web page recommendation service [A].In:Proc.of the 1st Intl.Conf.on Autonomous Agents [C].New York:ACM Press,1997.378~385.
  • 10Joachim S T,Freita G D,Mitchell T.WebWatch:a tour guide for the World Wide Web [A].In:Proc.of the Intl.Joint Conf.on Artificial Intelligence [C],1997.770~ 777.

二级参考文献8

  • 1Agrawl R,Srikant R.Fast algorithm for mining association rules[A].1994 Int Conf Very Large Data Base (VLDB'94)[C].Santiage,Chile,1994.487-499.
  • 2Han J,Dong G,Yin Y.Efficient mining of partial periodic patterns in time series database[A].1999 Int Conf Data Engineering (ICDE 99)[C].Sydney:IEEE Press,1999.106-115.
  • 3Mannila H,Toivonen H,Verkamo A I.Discovery of frequent episodes in event sequences[J].Data Mining and Knowledge Discovery,1997(1):259-289.
  • 4Li L,Jin F.A new algorithm for mining frequent pattern[J].Journal of Southwest Jiaotong University (English Version),2002,10(1):10-21.
  • 5Pasquier N,Bastide Y,Taouil R,et al.Discovering frequent closed itemsets for association rules[A].The 7th International Conference on Database Theory[C].Jerusalem,Israel:Springer,1999.398-416.
  • 6Pei J,Han J,Mao R.Closet:An efficient algorithm for mining frequent closed itemsets[A].ACM-SIGMOD Int.Workshop on Data Mining and Knowledge Discovery(DMKD 00)[C].Dallas,TX,2000.21-30.
  • 7Mannila H.Toivonen H,Verkamo A I.Efficient algorithms for discovering association rules[A].AAAI94 Workshop Knowledge Discovery in Database (KDD94)[C].Seattle:AAAI Press,1994.181-192.
  • 8李天瑞,徐扬,潘无名.φ频繁闭项目挖掘问题及其算法[J].西南交通大学学报,2001,36(3):225-228. 被引量:3

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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