| 基于频繁模式树的分布式关联规则挖掘算法 |
| |
| 引用本文： | 何波.基于频繁模式树的分布式关联规则挖掘算法[J].控制与决策,2012,27(4):618-622. |
| |
| 作者姓名： | 何波 |
| |
| 作者单位： | 重庆理工大学计算机科学与工程学院 |
| |
| 基金项目： | 教育部人文社会科学研究项目(09yjc870032) |
| |
| 摘 要： | 提出一种基于频繁模式树的分布式关联规则挖掘算法(DMARF).DMARF算法设置了中心结点,利用局部频繁模式树让各计算机结点快速获取局部频繁项集,然后与中心结点交互实现数据汇总,最终获得全局频繁项集.DMARF算法采用顶部和底部策略,能大幅减少候选项集,降低通信量.理论分析和实验结果均表明了DMARF算法是快速而有效的.
|
| 关 键 词： | 数据挖掘 频繁模式树 全局频繁项集 关联规则 |
| 收稿时间： | 2010/12/16 0:00:00 |
| 修稿时间： | 2011/3/18 0:00:00 |
Distributed algorithm for mining association rules based on FP-tree |
| |
| HE Bo.Distributed algorithm for mining association rules based on FP-tree[J].Control and Decision,2012,27(4):618-622. |
| |
| Authors: | HE Bo |
| |
| Affiliation: | HE Bo(School of Computer Science and Engineering,Chongqing University of Technology,Chongqing 400054,China.) |
| |
| Abstract: | The paper proposes a distributed algorithm for mining association rules based on frequent pattern tree(FP-tree),named distributed algorithm for mining association rules based on FP-tree(DMARF) algorithm,which sets center node.DMARF algorithm makes computer nodes compute local frequent itemsets independently from the local FP-tree.Then the center node exchanges data with other computer nodes.Finally,global frequent itemsets are gained.DMARF can decrease candidate itemsets and communication traffic by using the strategies of top and bottom.Theoretical analysis and experimental results show that DMARF algorithm is fast and effective. |
| |
| Keywords: | data mining frequent pattern tree global frequent itemsets association rules |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《控制与决策》浏览原始摘要信息 |
|
点击此处可从《控制与决策》下载全文 |
