基于领域知识和聚类的关联规则深层知识发现研究  

Research on Algorithm of Post-processing Association Rules Based on Clustering and Domain Knowledge

作　　者：张玲玲[1,2,3] 周全亮 唐广文 李兴森[5] 石勇[1,2,3] 

机构地区：[1]中国科学院大学管理学院,北京100190 [2]中国科学院虚拟经济与数据科学研究中心,北京100190 [3]中国科学院大数据挖掘与知识管理重点实验室,北京100190 [4]英大泰和财产保险股份有限公司,北京10005 [5]浙江大学宁波学院,浙江宁波315100

出　　处：《中国管理科学》2015年第2期154-161,共8页Chinese Journal of Management Science

基　　金：国家自然科学基金资助项目(71471169;71071151)

摘　　要：本文针对传统关联规则挖掘算法产生大量冗余规则,提出了对关联规则结果进行二次挖掘,并设计了算法对挖掘出的关联规则进行聚类,然后基于已有领域知识对聚类后的关联规则进行新颖度评价,对于新颖度较高价值较大的关联规则可以存储于领域知识库用于决策使用或再次挖掘过程。该算法有效的减少的规则的数量,提高了规则的新颖性和精确度,对商业应用具有很高的价值。文章最后使用UCI开源数据进行了实验分析,并验证了该算法的有效性。Second mining of the result of association rule mining is proposed in solution of the large numbers of redundant rules in the traditional association rules mining algorithm,and the algorithm for clustering of association rules is designed,then the novelty of the association rules is assessed after clustering based on the existing domain knowledge.It is insited that the association rules with more novelty and higher value can be stored in the domain knowledge base,and can be used for the decision or mining again.The algorithm proposed in this paper is effective to reduce the number of rules and also help to improve the novelty and precision of rule,which has a very high value for business applications.Finally the open source data from UCI is used to carry on the experiment to verify the effectiveness of the algorithm.

关 键 词：关联规则 聚类 领域知识 深层知识发现 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论] F224[自动化与计算机技术—计算机科学与技术]