期刊文献+

一种事务识别算法的研究与改进

下载PDF
导出
摘要 本文介绍了一种基于最大向前引用路径MFP事务识别算法,通过对源日志文件、用户访问网站等特点的分析,发现了交叉性日志的存在,使得算法所识别出的事务集存在事务冗余。为此提出MFP算法的改进,以减少后续模式识别的输入量,提高整个挖掘算法的效率。
作者 陈荣旺
出处 《福建电脑》 2007年第10期26-27,共2页 Journal of Fujian Computer
基金 武夷学院青年学术研究支持计划(项目编号:XQL06017)
  • 相关文献

参考文献5

二级参考文献19

  • 1R Cooley, B Mobasher and J rivastava. Web Mining: Information and Pattern discovery on the World Wide Web[C]. Proc. IEEE Intl. Conf. Tools with AI, Newport Beach, CA, 1997. 558-567.
  • 2M S Chen, J S Park and P S Yu. Data mining for path traversal patterns in a web environment[C]. In International Conference on Distributed Computing Systems, 1996.
  • 3R Cooley, B Mobasher and J Srivastava. Data preparation for mining world wide web browsing patterns[J]. Knowledge and Information Systems, 1999, 1(1):5-32.
  • 4J Borges and M Levene. Data mining of user navigation patterns[C]. In Proceedings of the Workshop on Web Usage Analysis and User Profiling (WEBKDD'99) , 1999. 92-111.
  • 5AGRAWAL R,SRIKANT R.Fast algorithms for mining association rules[A].Proceedings of the VLDB Conference[C].Santiago,Chile,1994.
  • 6AGRAWAL R,SRIKANT R.Mining sequential patterns[A].Proceedings International Conference on Data Engineering(ICDE' 95)[C].Taipei,1995.
  • 7PARK J S,CHEN M S,YU P S.An effective hash-based algorithm for mining association rules[A].Proc 1995 ACM-SIGMOD Int Conf Management of Data[C].San Jose,USA,1995.
  • 8CHEN J S,PARK M S,YU P S.Efficient data mining for path traversal patterns[J].IEEE Transactions on Knowledge and Data Engineering,1998,10(2):209-221.
  • 9COOLEY R,MOBASHER B,SRIVASTAVA J.Gruoping Webpage references into transactions for mining world wide Webbrowsing patterns[A].1997 IEEE knowledge and data engineering Exchange Workshop[C].Newport Beach,USA,1997.
  • 10HAN J,PEI J,YIN Y.Mining frequent patterns without candidate generation[A].Proc 2000 ACM-SIGMOD Int Conf Management of Data(SIGMOD' 00)[C].Dallas,USA,2000.

共引文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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