首页> 外文期刊>Information Sciences: An International Journal >Local logical disjunction double-quantitative rough sets
【24h】

Local logical disjunction double-quantitative rough sets

机译:本地逻辑分离双定量粗糙集

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Local rough sets as a generalization of classical rough sets not only inherit the advantages of classical rough sets which can handle imprecise, fuzzy and uncertain data, but also break through the limitation of classical rough sets requiring large amount of labeled data. The existing researches on local rough sets mainly use the relative quantitative information between a target concept and equivalence classes of those objects contained in the target concept to approximate the target concept. This ignores the information differences of equivalence classes concerned containing the relevant concept, namely the absolute quantitative information. We propose Local Logical Disjunction Double-quantitative Rough Sets (LLDDRS) model based on the importance, completeness and complementary nature of the relative and absolute quantitative information to describe an approximation space. This provides an effective tool for discovering knowledge and making decisions in relation to large data sets. In this paper we first study the important properties, optimal computing of rough regions and decision rules of the LLDDRS model. Then we explore the relationships of the proposed LLDDRS model and other representative models. Finally, we present experimental comparisons showing the computational efficiency and approximate accuracy of the LLDDRS model in concept approximation. (C) 2019 Elsevier Inc. All rights reserved.
机译:本地粗糙集作为经典粗糙集的概括不仅继承了经典粗糙集的优势,可以处理不精确,模糊和不确定的数据,而且还突破了需要大量标记数据的经典粗糙集的限制。对本地粗糙集的现有研究主要使用目标概念中包含的那些对象的目标概念和等同类之间的相对定量信息来近似目标概念。这忽略了有关包含相关概念的等同类的信息差异,即绝对的定量信息。我们提出了基于相对的重要性,完整性和互补性的本地逻辑分离双定量粗糙集(LLDDRS)模型来描述近似空间。这提供了一种有效的工具,用于发现关于大数据集相关的知识和做出决策。在本文中,我们首先研究了LLDDRS模型的粗糙区域和决策规则的重要特性,最佳计算。然后我们探索所提出的LLDDRS模型和其他代表模型的关系。最后,我们提出了显示概念近似值模型的计算效率和近似准确性的实验比较。 (c)2019 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号