首页> 外文会议>2010 2nd International Conference on Future Computer and Communication >Applied granular matrix to attribute reduction algorithm
【24h】

Applied granular matrix to attribute reduction algorithm

机译:将粒度矩阵应用于属性约简算法

获取原文

摘要

Attribute reduction is an important research area of rough set theory. Based on rough set theory, this paper established the granular matrix with the idea of granular computing, proposed and defined the AND operation of granular computing, established the knowledge granulation method based on granular matrix, and puts forward the attribute reduction algorithm based on granular matrix. The attribute reduction, using granular matrix to select the minimal attribute set, is different from the traditional attribute reduction which acquires the attribute core at first and then selects the best attribute set. Theoretical analysis shows that the new algorithm is reliable and valid. The new algorithm could provide a new paradigm for the attribute reduction of granular computing and a feasible method for further research on granular computing.
机译:属性约简是粗糙集理论的重要研究领域。本文基于粗糙集理论,以粒计算的思想建立了粒矩阵,提出并定义了粒计算的AND运算,建立了基于粒矩阵的知识粒化方法,提出了基于粒矩阵的属性约简算法。 。使用粒状矩阵选择最小属性集的属性约简与传统的属性约简不同,传统的属性约简首先获取属性核心,然后选择最佳属性集。理论分析表明,该算法是可靠有效的。新算法可以为粒度计算的属性约简提供新的范例,为进一步研究粒度计算提供一种可行的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号