摘要
关联规则的挖掘往往会产生大量的关联规则,"规则爆炸"的问题会使用户很难得到自己所需要的重要信息.极大布尔关联规则集因其包含的规则数量少且不丢失规则信息的优点提高了用户分析关联规则结果的效率,且节省了规则存储空间.在分析频繁闭项集、频繁基项集和极大布尔关联规则性质的基础上提出了一种挖掘极大布尔关联规则的算法,利用此算法可以得到极大布尔关联规则集,还通过实例验证了算法的正确性.
A lot of association rules may be generated in the process of association rules mining, and the problem of the rules explosion may hardly let the user get the important information out of the association rules. The maximal Boolean association rule sets contain fewer association rules and don＇t lose the information of the rules, so this enables the user to improve the analysis of the result of the rules and save the memory of the rules. An algorithm is presented based on the analysis of the property of the frequent closed itemset, frequent key itemset and the maximal Boolean association rules. Through the algorithm the maximal Boolean association rule set is obtained. In addition, an example is used to prove its validation.
出处
《郑州大学学报（理学版）》
CAS
2008年第4期39-43,共5页
Journal of Zhengzhou University:Natural Science Edition
基金
河南省高校杰出科研人才创新工程项目
编号2007KYCX018
关键词
频繁闭项集
频繁基项集
极大布尔关联规则集
下集
frequent closed itemset
frequent key itemset
maximal Boolean association rule set
downset
