首页> 外文期刊>Information Sciences: An International Journal >Positive approximation and converse approximation in interval-valued fuzzy rough sets
【24h】

Positive approximation and converse approximation in interval-valued fuzzy rough sets

机译:区间值模糊粗糙集的正逼近和逆逼近

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

摘要

Methods of fuzzy rule extraction based on rough set theory are rarely reported in incomplete interval-valued fuzzy information systems. Thus, this paper deals with such systems. Instead of obtaining rules by attribute reduction, which may have a negative effect on inducting good rules, the objective of this paper is to extract rules without computing attribute reducts. The data completeness of missing attribute values is first presented. Positive and converse approximations in interval-valued fuzzy rough sets are then defined, and their important properties are discussed. Two algorithms based on positive and converse approximations, namely, mine rules based on the positive approximation (MRBPA) and mine rules based on the converse approximation (MRBCA), are proposed for rule extraction. The two algorithms are evaluated by several data sets from the UC Irvine Machine Learning Repository. The experimental results show that MRBPA and MRBCA achieve better classification performances than the method based on attribute reduction.
机译:在不完整区间值模糊信息系统中很少有基于粗糙集理论的模糊规则提取方法的报道。因此,本文涉及此类系统。本文的目的不是在不通过属性约简的情况下获得规则的情况下对引入好的规则产生负面影响,而是在不计算属性约简的情况下提取规则。首先介绍缺少属性值的数据完整性。然后定义了区间值模糊粗糙集的正和逆近似,并讨论了它们的重要性质。提出了两种基于正反近似的算法,分别是基于正近似的挖掘规则(MRBPA)和基于反近似的挖掘规则(MRBCA)。 UC Irvine机器学习存储库中的几个数据集对这两种算法进行了评估。实验结果表明,与基于属性约简的方法相比,MRBPA和MRBCA具有更好的分类性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号