一种基于概念格的决策规则挖掘算法  

An Algorithm of Extracting Decision Rules based on Concept Lattice

作　　者：姜广[1,2] 王俊红[1,2] 梁吉业[1,2] 

机构地区：[1]山西大学计算机与信息技术学院,太原030006 [2]计算智能与中文信息处理省部共建教育部重点实验室,太原030006

出　　处：《电脑开发与应用》2006年第7期24-25,共2页Computer Development & Applications

基　　金：国家自然科学基金(70471003);高等学校博士学科点专项科研基金(20050108004);山西省自然科学基金(20031036);山西省高校拔尖创新人才基金资助。

摘　　要：概念格作为形式概念分析理论中的一种核心数据结构已经在众多的领域取得了广泛而成功的应用。从概念格上可以提取各种类型的知识,如蕴含规则、关联规则、分类规则等。利用概念格的所有节点的完备性特点,提出了一种基于概念格的新的决策规则挖掘算法,同时给出了规则的支持度。最后通过实例验证了算法的有效性。ACT The concept lattice which is a kernel data structure in the formal concept analysis has been applied widely and successfully in many fields. Kinds of knowledge can be extracted based on concept lattice such as implication rule, association rule and classification rule. In this paper, a new algorithm of extracting decision rules based on concept lattice is given according to the character which all the nodes are complete, Moreover, the support measurement is established, The validity of the algorithm is illustrated by the example.

关 键 词：概念格 决策规则 知识发现 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]