| 基于粒极值的最简规则提取算法 |
| |
| 引用本文： | 何群. 基于粒极值的最简规则提取算法[J]. 计算机工程, 2010, 36(19): 102-103 |
| |
| 作者姓名： | 何群 |
| |
| 作者单位： | 南京工业大学信息科学与工程学院,南京,210009 |
| |
| 基金项目： | 江苏省建筑业科研计划基金资助项目 |
| |
| 摘 要： | 应用粗糙集的分辨关系，分别从表的行、列2个方面求出每个属性值的分辨、组合能力，以此确定出粒极值，将含粒极值的粒定义为极值粒。应用粒计算理论，以极值粒集为主要运算对象进行粒逻辑运算，使最终的组合粒最简，即所提取的规则最简。实验验证了算法的有效性。
|
| 关 键 词： | 粒计算 粗糙集 粒极值 决策规则 |
Minimization Rules Extraction Algorithm Based on Extreme Value of Granular |
| |
| HE Qun. Minimization Rules Extraction Algorithm Based on Extreme Value of Granular[J]. Computer Engineering, 2010, 36(19): 102-103 |
| |
| Authors: | HE Qun |
| |
| Affiliation: | (College of Information Science and Engineering, Nanjing University of Technology, Nanjing 210009, China) |
| |
| Abstract: | The definiteness on row and compositeness on column factors of each attribute value in decision table are computed by applying to definite relation based on rough sets, an extreme value of granular is definited by the factors, the granular with extreme value is constructed to a set of extreme granular. An optimal granular is found by combination logic operation on extreme granular of the set, and the optimal granular is minimization rule. Experimental result shows that the algorithm is efficient. |
| |
| Keywords: | granular computing rough sets extreme value of granular decision rules |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
