Results 221 to 230 of about 24,695,904 (268)
Some of the next articles are maybe not open access.

Dominance-Based N-Soft Rough Sets

Lecture Notes in Computer Science, 2021
In the present paper, a new approach dominance-based N-soft rough sets is being introduced to study roughness through dominance relation and N-soft sets. Moreover, approximation operators and some useful properties with respect to dominance-based N-soft rough approximation space are introduced.
Di Zhang, Qian Wu, Shengnan Cao, Piyu Li
exaly   +3 more sources

Double-Quantitative Generalized Multi-Granulation Set-Pair Dominance Rough Sets in Incomplete Ordered Information System

open access: yesSymmetry, 2020
Since the rough sets theory based on the double quantification method was proposed, it has attracted wide attention in decision-making. This paper studies the decision-making approach in Incomplete Ordered Information System (IOIS).
Zhanao Xue
exaly   +2 more sources

Variable-Precision Dominance-Based Rough Set Approach

Information Sciences, 2006
In order to treat the ordinality and the monotonicity between condition and decision attributes in decision tables, the dominance-based rough set approach (DRSA) has been developed. Moreover, to treat the hesitation in evaluation, the variable-consistency dominance-based rough set approach (VC-DRSA) has been proposed. However, the VC-DRSA is not always
Masahiro Inuiguchi, Yukihiro Yoshioka
  +6 more sources

Dominance-Based Rough Sets Using Indexed Blocks as Granules

Lecture Notes in Computer Science, 2008
Dominance-based rough set introduced by Greco et al. is an extension of Pawlak¡¯s classical rough set theory by using dominance relations in place of equivalence relations for approximating sets of preference ordered decision classes satisfying upward and downward union properties. This paper introduces the concept of indexed blocks for
Gwo-Hshiung Tzeng, Chien-Chung Chan
exaly   +4 more sources

Parallel Computing of Approximations in Dominance-Based Rough Sets Approach

Knowledge-Based Systems, 2015
Computation of approximation is a critical step for applying rough sets methodologies in knowledge discovery and data mining. As an extension of classic rough sets theory, Dominance-based Rough Sets Approach (DRSA) can process information with preference-ordered attribute domain and then can be applied in multi-criteria decision analysis and other ...
Junbo Zhang, Tianrui Li, Hongmei Chen
exaly   +2 more sources

On Topological Dominance-based Rough Set Approach

2010
In this article, we characterize the Dominance-based Rough Set Approach (DRSA) from the point of view of its topological properties. Using the concept of a bitopological space, we extend to DRSA the classical results known for the original rough set approach. Moreover, we introduce a topological approach to ordinal classification.
Salvatore Greco   +2 more
openaire   +3 more sources

Reducts and Constructs in Classic and Dominance-Based Rough Sets Approach

Information Sciences, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Susmaga
exaly   +2 more sources

Generalizing Rough Set Theory Through Dominance-Based Rough Set Approach

2005
Ordinal properties of data related to preferences have been taken into account in the Dominance-based Rough Set Approach (DRSA). We show that DRSA is also relevant in case where preferences are not considered but a kind of monotonicity relating attribute values is meaningful for the analysis of data at hand.
GRECO, Salvatore   +2 more
openaire   +4 more sources

Algebraic Structures for Dominance-Based Rough Set Approach

2008
Dominance-based Rough Set Approach (DRSA) has been proposed to generalize classical rough set approach when monotonicity between memberships to considered concepts has to be taken into account. This is typical for data describing various phenomena, e.g., "the larger the mass and the smaller the distance, the larger the gravity".
Salvatore Greco   +2 more
openaire   +2 more sources

On Variable Consistency Dominance-Based Rough Set Approaches

2006
We consider different variants of Variable Consistency Dominance-based Rough Set Approach (VC-DRSA). These variants produce more general (extended) lower approximations than those computed by Dominance-based Rough Set Approach (DRSA), (i.e., lower approximations that are supersets of those computed by DRSA).
Jerzy Blaszczynski   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy