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

一种基于MFP树的快速关联规则挖掘算法 被引量：6

A Fast Association Rule Mining Algorithm Based on MFP Tree
下载PDF
导出
摘要 在关联规则挖掘FP-Growth算法的基础上,提出一种基于MFP树的快速关联规则挖掘算法。文中给出了MFP算法的工作原理。MFP算法能在一次扫描事务数据库的过程中,把该数据库转换成MFP树,然后对MFP树进行关联规则挖掘。MFP算法比FP-Growth算法减少一次对事务数据的扫描,因此具有较高的时间效率。 Based on FP-Growth algorithm of association rule mining, this paper presents a new association rule mining algorithm called MFP Tree. The MFP algorithm ean convert a transaction database into an MFP tree through seanning the database only once,and then do the mining of the tree.Baeause the MFP algorithm scans a transaction database one time less the FP-growth algorithm,the MFP algorithm is more efficient with time.
作者 李志云 周国祥
机构地区 合肥工业大学计算机与信息学院
出处 《计算机技术与发展》 2007年第6期94-96,100,共4页 Computer Technology and Development
关键词 关联规则挖掘 MFP树 MFP算法 association rule mining MFP tree MFP algorithm
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献6

  • 1刘乃丽,李玉忱,马磊.一种基于FP-tree的最大频繁项目集挖掘算法[J].计算机应用,2005,25(5):998-1000. 被引量：8
  • 2Goebel M,Gruenwald L.A Survey of Data Mining and Knowledge Discovery Software Tools[J].SIGKDD Explorations,1999,1 (5):20-23.
  • 3蒋良孝.一种基于FP-增长的决策规则挖掘算法.计算机科学,2003,32(6):23-25.
  • 4Han J,Pei J.Freespan:Frequent pattern-projected Sequential pattern Mining[R].In Technical Report CMPT2000-06,Simon Fraser University,2000:6-12.
  • 5高俊,何守才.布尔型关联规则挖掘算法研究[J].计算机工程,2006,32(1):116-118. 被引量：5
  • 6Han Jiawei.Data Mining:Concepts and Techniques[D].Burnaby:Simon Fraser University,2000:155-163.

二级参考文献17

  • 1AGRAWA LR, IMIELINSKI T, SWAMI A.Mining association rules between sets of items in large databases[A]. BUNEMAN P, JAJODIA S, ed. Proc. Of the ACM SIGMOD Conf. On Management of Data (SIGMOD'93)[C]. New York: ACM Press, 1993. 207-216.
  • 2AGRAWA LR, SRIKANT R. Fast algorithms for mining association rules in large databases[A]. BOCCA JB, JARKE M, ZANIOLO C, ed. Proc.of the 20th Int'l Conf. On Very Large Data Bases[C]. Santiago: Morgan Kaufmann, 1994. 478-499.
  • 3ALY HH, TAHA Y, AMR AA. Fast mining of association rules in large-scale problems[A]. ABDEL-WAHAB H, JEFFAY K, ed. Proc. of the 6th IEEE Symp. on Computers and Communications (ISCC 2001)[C]. New York: IEEE Computer Society Press, 2001. 107-113.
  • 4TSAI CF, LIN YC, CHEN CP. A new fast algorithms for mining association rules in large databases[A].KAMEL AE, MELLOULI K, BORNE P, ed. Proc. Of the 2002 IEEE Int'l Conf. On Systems, Man and Cybernetics (SMC 2002)[C]. IEEE Computer Society Press, 2002.251-256.
  • 5HAN J, PEI J, YIN Y. Mining frequent patterns without candidate generation[A]. CHEN WD, NAUGHTON J, BERNSTEIN PA, ed. Proc. Of the 2000 ACM SIGMOD Int'l Conf. On Management of Data (SIGMOD 2000)[C]. New York: ACM Press, 2000. 1～12.
  • 6BAYARDO R.Efficiently mining long patterns from databases[A]. HAAS LM, ed. Proceedings of the ACM SIGMOD International Conference on Management of Data[C]. New York: ACM Press, 1998. 85-93.
  • 7LIN DI, KEDEM ZM.Pincer-Search: A new algorithm for discovering the maximum frequent set[A]. SCHEK HJ, ed. Proceedings of the 6th European Conference on Extending Database Technology[C]. Heidelberg: Springer-Verlag, 1998. 105-119.
  • 8Imielinski T, Virmani A. MSQL: Aquery Languang for Database Mining [J]. Data Mining and Knowledge Discovery, 1999,3(2):373-4(18.
  • 9Groth R. Data Mining: Building Competitive Advantage[M]. Prentice Hall, 1999.
  • 10Goebel M, Gruenwald L. A Survey of Data Mining and Knowledge Discovery Software Tools[J]. SIGKDD Explorations, 1999,1(5):20-33.

共引文献14

同被引文献53

引证文献6

二级引证文献32

计算机技术与发展
2007年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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