计算机技术与发展Issue(6)：24-27,31,5.DOI:10.3969/j.issn.1673-629X.2014.06.006
一种基于生成树的分类去除关联规则冗余方法
A Method of Removing Redundant Association Rules by Classification Based on Spanning Tree
摘要
Abstract
In the information and data explosion era,redundant rules problem has become a major obstacle to gain knowledge for data miners,but the current solution may lead to the incompleteness of association rules. For the issues above,introduce the directed hyperg-raph to express association rules,redefine the adjacency matrix,propose the categorical thinking for removing redundant rules,dividing re-dundant rules into slave rules and repeated-path-rules,the algorithm of removing the dependency rule by VB programming and the span-ning tree algorithm to remove the redundancy of repeated-path-rules. The result of experiments show that this method is effective,fast and to maintain the integrity and accuracy of association rules which links directed hypergraph,spanning tree of graph theory and associa-tion rules innovatively. At the same time it removes all redundant rules.关键词
关联规则/有向超图/邻接矩阵/生成树/冗余/去除从属规则Key words
association rules/directed hypergraph/adjacency matrix/spanning tree/redundancy/removing slave rules分类
信息技术与安全科学引用本文复制引用
楼巍,邓柳燕,严利民,郭丽媛..一种基于生成树的分类去除关联规则冗余方法[J].计算机技术与发展,2014,(6):24-27,31,5.基金项目
教育部人文社会科学研究专项课题(10JDSZ1015) （10JDSZ1015）
上海学校德育创新发展课题(2012-dycx-105) （2012-dycx-105）
