首页 | 本学科首页   官方微博 | 高级检索  
     

分布式数据库项约束多层关联规则挖掘
引用本文:周明,李宏.分布式数据库项约束多层关联规则挖掘[J].计算技术与自动化,2006,25(1):61-63.
作者姓名:周明  李宏
作者单位:中南大学信息科学与工程学院,湖南,长沙,410083;中南大学信息科学与工程学院,湖南,长沙,410083
摘    要:由于分布环境的日益普遍并且需要结合使用者的实际要求对数据集按层次挖掘关联规则,故本文针对在分布式环境下基于项约束的关联规则挖掘和多层关联规则挖掘的特点,将交易表按概念层次进行编码。使用逐层迭代挖掘蓑略,结合CD算法和Direct算法提出一种在分布式环境下挖掘约束性多层关联规则的有效算法:MLACD算法。并通过实验验证该算法是正确有效的。

关 键 词:数据挖掘  分布式数据挖掘  约束性多层关联规则
文章编号:1003-6199(2006)01-0061-03
收稿时间:2005-08-29
修稿时间:2005年8月29日

Mining Multiple- level Association Rules with Item Constraints in Distributed Database
ZHOU Ming,LI Hong.Mining Multiple- level Association Rules with Item Constraints in Distributed Database[J].Computing Technology and Automation,2006,25(1):61-63.
Authors:ZHOU Ming  LI Hong
Affiliation:School of Information Science and Engineering,Central South University,ChangSha 410083,China
Abstract:With the development of distribute environment,to mine multiple-level association rules by layers according to users'actual demands,we proposed a new algorithm.According to the characteristics of mining association with item constraints and mining multiple-level association under distributed computing environment,this algorithm based on CD algorithm and Direct algorithm for distributed mining multiple-level association rules with item constraints is called MLACD,in which transaction tables are coded in terms of layers,and iterative mining strategy by layers is adopted.It is proved to be true and effective by experiments.
Keywords:data mining  distributed data mining(DDM)  multiple-level association rules with item constraints
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号