一个新的基于扩张矩阵的规则抽取覆盖算法

A new covering algorithm for rule extraction based on extension matrix

提出一种新的基于扩张矩阵的覆盖算法 ,用于抽取例子中的规则 .该算法有以下两个特点 :第一 ,算法执行后得到的选择子数目较少 ;第二 ,按照人们习惯 ,利用等号“ =”作为选择子的关系运算符 ,而代替其它系统采用的不等号“≠” .该算法在实际应用中取得了较好的效果 .

A new covering algorithm ( NCA ) based on extension matrix is used to extract rules from examples. It features fewer number of selectors resulting from NCA, symbol “=” used as relation operation symbol in NCA instead of symbol “≠” in other algorithms and tests show that NCA runs better.