作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (19): 102-103. doi: 10.3969/j.issn.1000-3428.2010.19.035

• 软件技术与数据库 • 上一篇    下一篇

基于粒极值的最简规则提取算法

何 群   

  1. (南京工业大学信息科学与工程学院,南京 210009)
  • 出版日期:2010-10-05 发布日期:2010-09-27
  • 作者简介:何 群(1955-),男,高级工程师,主研方向:数据挖掘,粗糙集,粒计算
  • 基金资助:
    江苏省建筑业科研计划基金资助项目(JGJH2008-17)

Minimization Rules Extraction Algorithm Based on Extreme Value of Granular

HE Qun   

  1. (College of Information Science and Engineering, Nanjing University of Technology, Nanjing 210009, China)
  • Online:2010-10-05 Published:2010-09-27

摘要: 应用粗糙集的分辨关系,分别从表的行、列2个方面求出每个属性值的分辨、组合能力,以此确定出粒极值,将含粒极值的粒定义为极值粒。应用粒计算理论,以极值粒集为主要运算对象进行粒逻辑运算,使最终的组合粒最简,即所提取的规则最简。实验验证了算法的有效性。

关键词: 粒计算, 粗糙集, 粒极值, 决策规则

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.

Key words: granular computing, rough sets, extreme value of granular, decision rules

中图分类号: