期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

WebLog访问序列模式挖掘 被引量：4

Mining Access Sequential Pattern from WebLog
下载PDF
导出
摘要 WebLog挖掘的基本思想是将数据挖掘技术应用于Web服务器的日志文件。通过WebLog的序列模式挖掘可以改善Web的信息服务。该文介绍了传统的WebLog中访问序列模式挖掘的方法,并在此基础上提出了一种对WAP-tree的改进构造方法。 WebLog mining is the application of data mining technology on web server log files.Sequential patterns mined from web logs can be used to improve the quality of information service on web.In this paper,traditional method of access sequential pattern mining from web log is introduced.Based on it,authors propose a new structure PFP-tree to improve the original structure WAP-tree.
作者 何炎祥 孔维强 向剑文 朱骁峰
机构地区 武汉大学计算机学院软件工程国家重点实验室
出处 《计算机工程与应用》 CSCD 北大核心 2003年第27期206-209,共4页 Computer Engineering and Applications
关键词 数据挖掘 WEBLOG 序列模式 PFP-tree WAP-tree Data mining,WebLog,Sequential pattern,PFP-tree,WAP-tree
分类号 TP311.13 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献6

  • 1J Graham-Cumming.Hits and misses:A year watching the Web[C].In: Proc 6th Int'l World Wide Web Conf,Santa Clara,California,1997--04.
  • 2J Pei,J Han,B Mortazavi-Asl et al.Mining Access Patterns Efficiently from Web Log[C].In:Proc 2000 Pacific-Asia Conf on Knowledge Discovery and Data Mining(PAKDD'00),Kyoto,Japan,2000-04.
  • 3J Han,J Pei,Y Yin.Mining Frequent Patterns without Candidate Genemtion[C].In:Proc 2000 CM-SIGMOD Int Conf on Management of Data(SIGMOD'00), Dallas, TX, 2000-05.
  • 4R Agrawal,R Sfikant.Fast algorithms for mining association rules[C]. In:Proc 1994 Int Conf Very Large Data Bases,Santiago,Chile,1994-09: 487-499
  • 5JiaweiHan MichelineKamber(加).数据挖掘概念与技术【M】.机械工业出版社,2001.283-284.
  • 6何炎祥,向剑文,朱骁峰,孔维强.不产生候选的快速投影频繁模式树挖掘算法[J].计算机科学,2002,29(11):71-75. 被引量：11

二级参考文献14

  • 1Hah J, Pei J, Yin Y. Mining partial periodicity using frequent pattern trees: [CS Tech. Rep. 99-10]. Simon Fraser University, July 1999
  • 2Savasere A,Omiecinski E,Navathe S. An efficient algorithm for mining association rules in large database. In VLDB'1995. 432～ 443
  • 3Srikant R,Vu Q,Agrawal R. Mining association rules with item constraints. In KDD'1997. 594～605
  • 4Han Jiawei,Pei Jian, Yin Yiwen. Mining Frequent Patterns without Candidate Generation. http://www. cs. sfu. ca/～peijian/personal/publications
  • 5Agrawal R, Srikant S. Fast algorithms for mining association rules. In VLDB'1994. 487～499
  • 6Bayardo R J. Efficiently mining long patterns from databases. In SIGMOD'1998. 85～93
  • 7Agrawal R, Srikant B. Fast algorithms for mining association rules. In VLDB'1994. 487～499
  • 8Grahne G, Lakshmanan L, Wang X. Efficient mining of constrained correlated sets. In ICDE'2000
  • 9Klemettinen M,et al. Finding interesting rules from large sets of discovered association rules. In CIKM'1994. 401～408
  • 10Lent B, Swami A, Widom J. Clustering association rules. In ICDE'1997. 220～231

共引文献10

同被引文献17

  • 1战立强,刘大昕.一种在连续MFR中快速挖掘频繁访问路径的新算法[J].计算机工程与应用,2005,41(9):180-181. 被引量：8
  • 2闫永权,张大方.基于频繁的Markov链预测模型[J].计算机应用研究,2007,24(3):41-43. 被引量：10
  • 3Balamash A,Krunz M.An overview of web caching replacement algorithms [J]. IEEE Communications Surveys and Tutorials, 2004,6(2):44-56.
  • 4Shi Lei,Ding Xiaoguang,Wei Lin,et al An adaptive PPM prediction model [J]. Journal of Computational Information Systems, 2006,2(2):633-638.
  • 5Web caching and content devivery resources [EB/OL]. http:// www.web-caching.com/,2006-12-10.
  • 6Agrawal R,Srikant R.Mining Sequential Pattems[J].In:Proc of the 11st Int Conf.On Data Engineering.TaiPei,1995,3-14.
  • 7Zaki M J,SPADE.An Efficient Algorithm for Mining Frequent Sequences[J] ,Machine Learning42(1),2001:31-60.
  • 8Pei J,Hart J W,Pinto H,et al.Prefix Span:Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth[J].Proceedings of IEEE Conference on Data Engineering,2001:215-224.
  • 9Bonfield J W,Steden R.ZTR:A'New Format NA Sequence Trace Data[J] ,2002:3-10.
  • 10石磊,孟彩霞,韩英杰.基于预测的Web缓存替换策略[J].计算机应用,2007,27(8):1842-1845. 被引量：6

引证文献4

二级引证文献17

计算机工程与应用
2003年 第27期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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