摘要
数据挖掘是计算机科学研究的重要领域之一。文章从主从关系数据集的角度开展关联规则挖掘研究,首先构建了主从关系数据库模型,在此基础上提出一种基于元组ID逆传输的关联规则挖掘算法(TIDRP),避免了挖掘过程中数据的集成过程,减少了资源的消耗,并使挖掘出的规则更符合实际情况。
Data mining is one of the important areas of computer science, and how to mine ettecuve mformation directly from a relational database which contains multi-relational data has been an important subject. In this paper, the mining of association rules is studied from the view of master-slave relationship data set. First, the model of master-slave relationship database is constructed. Then an algorithm for mining multi-relational association rules based on tuple ID retrorse propagation, which is called TIDRP, is proposed. The process of data integration is avoided, the consumption of resources is reduced, and the mining rules are more accorded with the practical situation.
出处
《合肥工业大学学报(自然科学版)》
CAS
CSCD
北大核心
2009年第5期663-666,共4页
Journal of Hefei University of Technology:Natural Science
关键词
数据挖掘
主从关系
关联规则
元组ID传输
data mining master-slave relation association rule
tuple ID propagation