模糊Horn子句规则及其发现算法  

Fuzzy Horn Clause Rules and Its Discovery Algorithm

作　　者：刘东波[1,2] 卢正鼎[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,武汉430074 [2]中国电子设备系统工程研究所,北京100039

出　　处：《计算机工程》2009年第2期184-186,共3页Computer Engineering

摘　　要：模糊Horn子句规则可以用自然语言来表达人类知识。但是,发现模糊Horn子句规则及其蕴含度是比较困难的。该文从逻辑的观点出发,定义模糊Horn子句规则、支持度、蕴含度及其相关概念,分析模糊Horn子句规则发现的步骤,并给出发现算法的形式化描述。该算法结合了模糊Horn子句逻辑概念和Apriori发现算法,从给定的数量型数据库中发现模糊Horn子句规则。Fuzzy Horn clause rules can be used to represent human knowledge in terms of natural language. However, it is more difficult to discover fuzzy Horn clause rules and its implication degree. From the logical point of view, in this paper, fuzzy Horn clause rules, support degree, implication degree and related concepts are defined. The processes of mining fuzzy Horn clause rules are analyzed, and the formal algorithm is proposed. This algorithm integrates the concepts of fuzzy Horn clause logic and the Apriori algorithm to find fuzzy Horn clause rules from quantitative databases.

关 键 词：模糊Horn子句规则 支持度 蕴含度 定量数据库 

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