首页> 外文期刊>Information Sciences: An International Journal >Domain-wise approaches for updating approximations with multi-dimensional variation of ordered information systems
【24h】

Domain-wise approaches for updating approximations with multi-dimensional variation of ordered information systems

机译:用于更新近似的域方法,以利用有序信息系统的多维变化更新近似

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

摘要

Dominance-based Rough Set Approach (DRSA) is widely applied in processing the information and data with a preference-order relation. In many real-life Ordered Information Systems (OIS), the attribute values and objects may vary simultaneously with time. Existing incremental updating algorithms in OIS are all single-dimensional, i.e., they only consider the individual variation of attribute values or objects. In addition, all the objects need to be compared with each other during updating. In this paper, we focus on designing specific multi-dimensional algorithms to efficiently update approximations on the simultaneous variation of attribute values and objects in OIS. The properties of the P-generalized decision in DRSA are firstly presented. Then two novel notions e.g., the P-generalized decision lower and upper domains, are defined, respectively. These two notions indicate the practical dominance dependence between different objects in OIS, and provide a simplified definition of the P-generalized decision. The approach based on these two notions can greatly reduce the comparisons between different objects, as well as provide novel strategies which can efficiently obtain the updated P-generalized decision to obtain the updated approximations. Furthermore, we develop two domain-wise algorithms which correspond to two cases of the multi-dimensional variation of attribute values and objects in OIS, respectively. Moreover, in implementing the algorithms, the sorting strategies are integrated to solve the problem of time-consuming traversals. A series of experimental results illustrate that our proposed domain-wise algorithms are not only more efficient than both of the traditional static algorithm and the integrated single-dimensional algorithms for dealing with the multi-dimensional variation of attribute values and objects, but also more efficient than the single-dimensional algorithms for dealing with the individual variation of objects in OIS. (C) 2018 Elsevier Inc.
机译:基于优势的粗糙集方法(DRSA)广泛应用于使用优先顺序关系处理信息和数据。在许多现实生活中的信息系统(OIS)中,属性值和对象可能随时间同时变化。 OIS中的现有增量更新算法是全部的,即,它们仅考虑属性值或对象的各个变型。此外,在更新期间需要相互比较所有对象。在本文中,我们专注于设计特定的多维算法,以有效更新关于OIS中的属性值和对象的同时变化的近似。首先介绍了DRSA中的P-Generalized决定的性质。然后,分别定义了两种新颖的概念。这两个概念表示OIS中不同对象之间的实际优势依赖性,并提供了对P-Generalized决策的简化定义。基于这两个概念的方法可以大大减少不同对象之间的比较,并提供了可以有效地获得更新的P-Generalization决定以获得更新的近似的新策略。此外,我们开发了两个域 - 明智的算法,其分别对应于OI中的属性值和对象的两个案例。此外,在实现算法中,集成了分拣策略以解决耗时的遍历问题。一系列实验结果表明,我们提出的域名算法不仅比传统的静态算法和集成的单维算法都更有效,用于处理属性值和对象的多维变化,而且更有效比用于处理OIS中对象的各个变型的单维算法。 (c)2018 Elsevier Inc.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号