摘要
粒关联规则挖掘是一种关系数据挖掘的新方法,用于在多对多关系表中挖掘关联规则.本文对一个已有算法加以改进,利用信息表中属性所存在的包含和被包含关系建立格的数据结构,通过在格上对有关节点及其孩子节点进行遍历操作来减少比较次数,从而减少时间消耗.
Granular association rule mining is one of new relation data mining method,and it used to fine the association rules in a many-to-many entity-relationship system table.In this paper,we improve the algorithm,and make data structure of lattice by the way of using the including and included in the concept of relationship,to reduce the number of comparisons by traversing operation on node and its children nodes in the lattice structure,so as to reduce the time cost.
出处
《漳州师范学院学报（自然科学版）》
2013年第2期18-22,共5页
Journal of ZhangZhou Teachers College（Natural Science)
关键词
粒关联规则
时间代价
格结构
完全匹配
Granular association rule
time cost
lattice structure
Complete matching
