首页> 外文期刊>高分子論文集 >Monotonic uncertainty measures for attribute reduction in probabilistic rough set model
【24h】

Monotonic uncertainty measures for attribute reduction in probabilistic rough set model

机译:概率粗糙集模型中属性约简的单调不确定性度量

获取原文
获取原文并翻译 | 示例
       

摘要

Attribute reduction is one of the most fundamental and important topics in rough set theory. Uncertainty measures play an important role in attribute reduction. In the classical rough set model, uncertainty measures have the monotonicity with respect to the granularity of partition. However, the monotonicity of uncertainty measures does not hold when uncertainty measures in classical rough set model are directly extended into probabilistic rough set model, which makes it not so reasonable to use them to evaluate the uncertainty in probabilistic rough set model. Moreover, the monotonicity is very important for constructing attribute reduction algorithms because the monotonicity of uncertainty measures can simplify the algorithm design. This paper focuses on constructing monotonic uncertainty measures in probabilistic rough set model. Firstly, we analyze the non-monotonicity problem of uncertainty measures in probabilistic rough set model. Secondly, we propose three basic uncertainty measures and three expected granularity-based uncertainty measures, the monotonicity of these measures is proved to be held and the relationship between these measures and corresponding uncertainty measures in classical rough set model is also obtained. Finally, a new attribute reduct is defined based on the proposed monotonic uncertainty measure, and the corresponding heuristic reduction algorithms are developed. The results of experimental analysis are included to validate the effectiveness of the proposed uncertainty measures and new reduct definition. (C) 2015 Elsevier Inc. All rights reserved.
机译:属性约简是粗糙集理论中最基本,最重要的主题之一。不确定性度量在属性减少中起重要作用。在经典粗糙集模型中,不确定性度量在分区粒度方面具有单调性。然而,将经典粗糙集模型中的不确定性度量直接扩展到概率粗糙集模型中时,不确定性度量的单调性并不成立,这使得使用它们来评估概率粗糙集模型中的不确定性并不那么合理。此外,单调性对于构造属性约简算法非常重要,因为不确定性度量的单调性可以简化算法设计。本文着重在概率粗糙集模型中构造单调不确定性度量。首先,我们分析了概率粗糙集模型中不确定性度量的非单调性问题。其次,我们提出了三种基本的不确定性度量和三种基于期望粒度的不确定性度量,证明了这些度量的单调性,并获得了这些度量与经典粗糙集模型中的相应不确定性度量之间的关系。最后,基于提出的单调不确定性度量,定义了一种新的属性约简,并开发了相应的启发式约简算法。实验分析的结果包括在内,以验证所提出的不确定性措施和新的还原定义的有效性。 (C)2015 Elsevier Inc.保留所有权利。

著录项

  • 来源
    《高分子論文集》 |2015年第4期|41-67|共27页
  • 作者

    Wang Guoyin; Ma Xiao; Yu Hong;

  • 作者单位

    Chongqing Univ Posts & Telecommun, Chongqing Key Lab Computat Intelligence, Chongqing 400065, Peoples R China;

    Chongqing Univ Posts & Telecommun, Chongqing Key Lab Computat Intelligence, Chongqing 400065, Peoples R China|Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 610031, Peoples R China;

    Chongqing Univ Posts & Telecommun, Chongqing Key Lab Computat Intelligence, Chongqing 400065, Peoples R China;

  • 收录信息 美国《科学引文索引》(SCI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Uncertainty measure; Approximation accuracy; Attribute reduction; Probabilistic rough set model; Pawlak rough set model;

    机译:不确定性度量逼近精度属性约简概率粗糙集模型Pawlak粗糙集模型;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号