通用的多概念层关联规则发现方法的改进  

The Improvement of the Approach to Discovery General Multiple-Level Association Rules in all Concept Hierachies

作　　者：施润身[1] 赵青[2] 

机构地区：[1]同济大学研究生院,上海200092 [2]同济大学计算机科学与工程系,上海200092

出　　处：《计算机工程与应用》2003年第31期188-190,共3页Computer Engineering and Applications

摘　　要：文章全面分析现有的多概念层关联规则的发现算法,结合多概念层的生成方法,提出通用的多概念层关联规则发现的新方法,以研究生入学考试数据集为实例进行验证,并将该算法和现有的算法进行比较,结果表明该算法在搜索空间和计算复杂度等方面更为有效。The existing algorithm is analyzed for discoverying multiple-level association rules in all concept hierachies.The improved approach is created based on the way to develop multiple concept level and verified with graduate entrance exam datasets.The two algorithms are compared on the chart.It is made clear that the improved algorithm is more effective than the other in searching space and calculation complexity.

关 键 词：多概念层 关联规则 搜索空间 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]