摘要
在分布式系统中如何挖掘关联规则是数据挖掘领域研究的一个重要课题.对关联规则分布式挖掘问题进行了深入探讨.基于以P2P网络模式构建的分布式事务数据库,对Apriori算法进行了推广.改进后的算法具有扩展性好、效率高、通信代价小和实现简单等优点.最后,还提出了一种由频繁项集高效产生强关联规则的算法.
It's a very important subject in the domain of data mining of how to mine association rules in distributed database system. The paper makes a thorough research on this subject. Based on distributed transactional database system constructed by P2P, the paper extends the most classical algorithm Apriori. This improved algorithm has sound extension, simple time complexity, small communication cost and simplicity. At last, the paper puts forward an efficient algorithm of getting association rules from frequent itemsets.
出处
《温州师范学院学报》
2006年第2期72-76,共5页
Journal of Wenzhou Teachers College(Philosophy and Social Science Edition)
关键词
P2P
关联规则
数据挖掘
分布式
事务数据库
P2P
association rules
data mining
distribution
transactional database