| 基于EMFP-树的频繁模式挖掘算法 |
| |
| 引用本文： | 陈勇.基于EMFP-树的频繁模式挖掘算法[J].陕西工学院学报,2009(2):40-44. |
| |
| 作者姓名： | 陈勇 |
| |
| 作者单位： | 陕西理工学院计算机科学与技术系,陕西汉中723001 |
| |
| 摘 要： | 针对MFP-tree挖掘算法的不足,给出了一个频繁模式挖掘算法EMFP。算法通过将事务数据库的每条事务支持度进行裁剪以及为EMFP-树的节点添加子树个数计数器等措施来提高EMFP-树的挖掘算法的效率。实验结果表明,EMFP-树的挖掘算法是一个高效的频繁模式挖掘算法,其性能优于MFP算法。
|
| 关 键 词： | MFP-树 EMFP-树 路径组合 子树计数器 |
A mining algorithm for frequent patterns based on EMFP -tree |
| |
| CHEN Yong.A mining algorithm for frequent patterns based on EMFP -tree[J].Journal of Shaanxi Institute of Technology,2009(2):40-44. |
| |
| Authors: | CHEN Yong |
| |
| Affiliation: | CHEN Yong (Department of Computer Science,Shaanxi University of Technology, Hanzhong 723001, China) |
| |
| Abstract: | In this paper,an improved algorithm,EMFP,is presented based on the MFP-tree＇s shortage.The algorithm adopts all transactions pruned in transaction database based on support,and every node of EMFP-tree is added by a subtree counter.The experimental result shows that EMFP-Tree mining algorithm is efficient algorithm and outperforms MFP. |
| |
| Keywords: | MFP - tree EMFP - tree route combination subtree counter |
| 本文献已被 维普 等数据库收录！ |
