摘要
针对分布式数据挖掘需要节点间进行大量数据交换的缺点,根据张春生,宋琳琳提出的关联规则局部性原理,不进行数据交换,通过节点挖掘,直接得到局部性全局关联规则,通过各节点间规则的合并,直接得到非局部全局关联规则,该算法简单易行,不需要节点间的数据交换,提高了数据挖掘效率,不仅挖掘出其他分布式数据挖掘算法挖掘出的全局关联规则,还能够发现其他算法不能发现的局部全局规则。
In connection with the weak point that distributed data mining needs a great amount of data switching between nodes,according to the principle of locality of association rules proposed by Zhang Chunsheng,Song Linlin,this method doesn’t make any data switching.By means of node mining,the locally global association rules can be directly obtained.Through merging rules of the nodes,the nonlocally global association rules can also be directly obtained.This algorithm is easy,has no needs of data switching between nodes,and the result is close to other ways.
出处
《计算机工程与应用》
CSCD
2012年第21期143-145,190,共4页
Computer Engineering and Applications
基金
内蒙古人才基金资助项目
内蒙古教育科研项目资助(No.NJZY07140)
关键词
局部性
分布式
关联规则
数据挖掘
locality
distribute
association rule
data mining