摘要
指出求粗集的最简规则是一个二维极简化的粒(G)逻辑问题.将行分辩和列组合具有最大强度的属性值定义为粒极值,对其逐级进行粒运算,得最简粒解集.从理论上统一了求解粗集的算法并用实例以证明.
Pointing out that method for solving the rough sets is a minimization problem of two-dimensional for on Granular-logic.The attribute value that the dfiniting on row and compositing on column intensity is maxima was defined as extreme value of granular,logic operation of granular comput with it stage by stage,finally minimization granular sets is got.Unifies the algorithm soluting for the rough sets on theory and the experiments show that it is efficienal.
出处
《微电子学与计算机》
CSCD
北大核心
2010年第10期91-95,共5页
Microelectronics & Computer
关键词
粒极值
粒计算
不可分辩关系
决策规则
extreme valued of granular
granular computing
indefinite relation
decision rules
