Dominance-based rough set approach

This article has multiple issues. Please help or discuss these issues on the talk page. (Learn how and when to remove these template messages) This article may be too technical for most readers to understand. Please to make it understandable to non-experts, without removing the technical details. (November 2011) (Learn how and when to remove this template message) This article may contain an excessive amount of intricate detail that may interest only a particular audience. Please help by spinning off or relocating any relevant information, and removing excessive detail that may be against Wikipedia's inclusion policy. (November 2011) (Learn how and when to remove this template message) (Learn how and when to remove this template message)

The dominance-based rough set approach (DRSA) is an extension of rough set theory for multi-criteria decision analysis (MCDA), introduced by Greco, Matarazzo and Słowiński.^[1][2][3] The main change compared to the classical rough sets is the substitution for the indiscernibility relation by a dominance relation, which permits one to deal with inconsistencies typical to consideration of criteria and preference-ordered decision classes.

Multicriteria classification (sorting)[]

Multicriteria classification () is one of the problems considered within MCDA and can be stated as follows: given a set of objects evaluated by a set of (attributes with preference-order domains), assign these objects to some pre-defined and preference-ordered decision classes, such that each object is assigned to exactly one class. Due to the preference ordering, improvement of evaluations of an object on the criteria should not worsen its class assignment. The sorting problem is very similar to the problem of classification, however, in the latter, the objects are evaluated by regular attributes and the decision classes are not necessarily preference ordered. The problem of multicriteria classification is also referred to as and often appears in real-life application when ordinal and monotone properties follow from the domain knowledge about the problem.

As an illustrative example, consider the problem of evaluation in a high school. The director of the school wants to assign students (objects) to three classes: bad, medium and good (notice that class good is preferred to medium and medium is preferred to bad). Each student is described by three criteria: level in Physics, Mathematics and Literature, each taking one of three possible values bad, medium and good. Criteria are preference-ordered and improving the level from one of the subjects should not result in worse global evaluation (class).

As a more serious example, consider classification of bank clients, from the viewpoint of bankruptcy risk, into classes safe and risky. This may involve such characteristics as "return on equity (ROE)", "return on investment (ROI)" and "return on sales (ROS)". The domains of these attributes are not simply ordered but involve a preference order since, from the viewpoint of bank managers, greater values of ROE, ROI or ROS are better for clients being analysed for bankruptcy risk . Thus, these attributes are criteria. Neglecting this information in knowledge discovery may lead to wrong conclusions.

Data representation[]

Decision table[]

In DRSA, data are often presented using a particular form of decision table. Formally, a DRSA decision table is a 4-tuple ${\displaystyle S=\langle U,Q,V,f\rangle }$, where ${\displaystyle U\,\!}$ is a finite set of objects, ${\displaystyle Q\,\!}$ is a finite set of criteria, ${\displaystyle V=\bigcup {}_{q\in Q}V_{q}}$ where ${\displaystyle V_{q}\,\!}$ is the domain of the criterion ${\displaystyle q\,\!}$ and ${\displaystyle f\colon U\times Q\to V}$ is an information function such that ${\displaystyle f(x,q)\in V_{q}}$ for every ${\displaystyle (x,q)\in U\times Q}$. The set ${\displaystyle Q\,\!}$ is divided into condition criteria (set ${\displaystyle C\neq \emptyset }$) and the decision criterion (class) ${\displaystyle d\,\!}$. Notice, that ${\displaystyle f(x,q)\,\!}$ is an evaluation of object ${\displaystyle x\,\!}$ on criterion ${\displaystyle q\in C}$, while ${\displaystyle f(x,d)\,\!}$ is the class assignment (decision value) of the object. An example of decision table is shown in Table 1 below.

Outranking relation[]

It is assumed that the domain of a criterion ${\displaystyle q\in Q}$ is completely preordered by an ${\displaystyle \succeq _{q}}$; ${\displaystyle x\succeq _{q}y}$ means that ${\displaystyle x\,\!}$ is at least as good as (outranks) ${\displaystyle y\,\!}$ with respect to the criterion ${\displaystyle q\,\!}$. Without loss of generality, we assume that the domain of ${\displaystyle q\,\!}$ is a subset of reals, ${\displaystyle V_{q}\subseteq \mathbb {R} }$, and that the outranking relation is a simple order between real numbers ${\displaystyle \geq \,\!}$ such that the following relation holds: ${\displaystyle x\succeq _{q}y\iff f(x,q)\geq f(y,q)}$. This relation is straightforward for gain-type ("the more, the better") criterion, e.g. company profit. For cost-type ("the less, the better") criterion, e.g. product price, this relation can be satisfied by negating the values from ${\displaystyle V_{q}\,\!}$.

Decision classes and class unions[]

Let ${\displaystyle T=\{1,\ldots ,n\}\,\!}$. The domain of decision criterion, ${\displaystyle V_{d}\,\!}$ consist of ${\displaystyle n\,\!}$ elements (without loss of generality we assume ${\displaystyle V_{d}=T\,\!}$) and induces a partition of ${\displaystyle U\,\!}$ into ${\displaystyle n\,\!}$ classes ${\displaystyle {\textbf {Cl}}=\{Cl_{t},t\in T\}}$, where ${\displaystyle Cl_{t}=\{x\in U\colon f(x,d)=t\}}$. Each object ${\displaystyle x\in U}$ is assigned to one and only one class ${\displaystyle Cl_{t},t\in T}$. The classes are preference-ordered according to an increasing order of class indices, i.e. for all ${\displaystyle r,s\in T}$ such that ${\displaystyle r\geq s\,\!}$, the objects from ${\displaystyle Cl_{r}\,\!}$ are strictly preferred to the objects from ${\displaystyle Cl_{s}\,\!}$. For this reason, we can consider the upward and downward unions of classes, defined respectively, as:

${\displaystyle Cl_{t}^{\geq }=\bigcup _{s\geq t}Cl_{s}\qquad Cl_{t}^{\leq }=\bigcup _{s\leq t}Cl_{s}\qquad t\in T}$

Main concepts[]

Dominance[]

We say that ${\displaystyle x\,\!}$ dominates ${\displaystyle y\,\!}$ with respect to ${\displaystyle P\subseteq C}$, denoted by ${\displaystyle xD_{p}y\,\!}$, if ${\displaystyle x\,\!}$ is better than ${\displaystyle y\,\!}$ on every criterion from ${\displaystyle P\,\!}$, ${\displaystyle x\succeq _{q}y,\,\forall q\in P}$. For each ${\displaystyle P\subseteq C}$, the dominance relation ${\displaystyle D_{P}\,\!}$ is reflexive and transitive, i.e. it is a partial pre-order. Given ${\displaystyle P\subseteq C}$ and ${\displaystyle x\in U}$, let

${\displaystyle D_{P}^{+}(x)=\{y\in U\colon yD_{p}x\}}$

${\displaystyle D_{P}^{-}(x)=\{y\in U\colon xD_{p}y\}}$

represent P-dominating set and P-dominated set with respect to ${\displaystyle x\in U}$, respectively.

Rough approximations[]

The key idea of the rough set philosophy is approximation of one knowledge by another knowledge. In DRSA, the knowledge being approximated is a collection of upward and downward unions of decision classes and the "granules of knowledge" used for approximation are P-dominating and P-dominated sets.

The P-lower and the P-upper approximation of ${\displaystyle Cl_{t}^{\geq },t\in T}$ with respect to ${\displaystyle P\subseteq C}$, denoted as ${\displaystyle {\underline {P}}(Cl_{t}^{\geq })}$ and ${\displaystyle {\overline {P}}(Cl_{t}^{\geq })}$, respectively, are defined as:

${\displaystyle {\underline {P}}(Cl_{t}^{\geq })=\{x\in U\colon D_{P}^{+}(x)\subseteq Cl_{t}^{\geq }\}}$

${\displaystyle {\overline {P}}(Cl_{t}^{\geq })=\{x\in U\colon D_{P}^{-}(x)\cap Cl_{t}^{\geq }\neq \emptyset \}}$

Analogously, the P-lower and the P-upper approximation of ${\displaystyle Cl_{t}^{\leq },t\in T}$ with respect to ${\displaystyle P\subseteq C}$, denoted as ${\displaystyle {\underline {P}}(Cl_{t}^{\leq })}$ and ${\displaystyle {\overline {P}}(Cl_{t}^{\leq })}$, respectively, are defined as:

${\displaystyle {\underline {P}}(Cl_{t}^{\leq })=\{x\in U\colon D_{P}^{-}(x)\subseteq Cl_{t}^{\leq }\}}$

${\displaystyle {\overline {P}}(Cl_{t}^{\leq })=\{x\in U\colon D_{P}^{+}(x)\cap Cl_{t}^{\leq }\neq \emptyset \}}$

Lower approximations group the objects which certainly belong to class union ${\displaystyle Cl_{t}^{\geq }}$ (respectively ${\displaystyle Cl_{t}^{\leq }}$). This certainty comes from the fact, that object ${\displaystyle x\in U}$ belongs to the lower approximation ${\displaystyle {\underline {P}}(Cl_{t}^{\geq })}$ (respectively ${\displaystyle {\underline {P}}(Cl_{t}^{\leq })}$), if no other object in ${\displaystyle U\,\!}$ contradicts this claim, i.e. every object ${\displaystyle y\in U}$ which P-dominates ${\displaystyle x\,\!}$, also belong to the class union ${\displaystyle Cl_{t}^{\geq }}$ (respectively ${\displaystyle Cl_{t}^{\leq }}$). Upper approximations group the objects which could belong to ${\displaystyle Cl_{t}^{\geq }}$ (respectively ${\displaystyle Cl_{t}^{\leq }}$), since object ${\displaystyle x\in U}$ belongs to the upper approximation ${\displaystyle {\overline {P}}(Cl_{t}^{\geq })}$ (respectively ${\displaystyle {\overline {P}}(Cl_{t}^{\leq })}$), if there exist another object ${\displaystyle y\in U}$ P-dominated by ${\displaystyle x\,\!}$ from class union ${\displaystyle Cl_{t}^{\geq }}$ (respectively ${\displaystyle Cl_{t}^{\leq }}$).

The P-lower and P-upper approximations defined as above satisfy the following properties for all ${\displaystyle t\in T}$ and for any ${\displaystyle P\subseteq C}$:

${\displaystyle {\underline {P}}(Cl_{t}^{\geq })\subseteq Cl_{t}^{\geq }\subseteq {\overline {P}}(Cl_{t}^{\geq })}$

${\displaystyle {\underline {P}}(Cl_{t}^{\leq })\subseteq Cl_{t}^{\leq }\subseteq {\overline {P}}(Cl_{t}^{\leq })}$

The P-boundaries (P-doubtful regions) of ${\displaystyle Cl_{t}^{\geq }}$ and ${\displaystyle Cl_{t}^{\leq }}$ are defined as:

${\displaystyle Bn_{P}(Cl_{t}^{\geq })={\overline {P}}(Cl_{t}^{\geq })-{\underline {P}}(Cl_{t}^{\geq })}$

${\displaystyle Bn_{P}(Cl_{t}^{\leq })={\overline {P}}(Cl_{t}^{\leq })-{\underline {P}}(Cl_{t}^{\leq })}$

Quality of approximation and reducts[]

The ratio

${\displaystyle \gamma _{P}({\textbf {Cl}})={\frac {\left|U-\left(\left(\bigcup _{t\in T}Bn_{P}(Cl_{t}^{\geq })\right)\cup \left(\bigcup _{t\in T}Bn_{P}(Cl_{t}^{\leq })\right)\right)\right|}{|U|}}}$

defines the quality of approximation of the partition ${\displaystyle {\textbf {Cl}}\,\!}$ into classes by means of the set of criteria ${\displaystyle P\,\!}$. This ratio express the relation between all the P-correctly classified objects and all the objects in the table.

Every minimal subset ${\displaystyle P\subseteq C}$ such that ${\displaystyle \gamma _{P}(\mathbf {Cl} )=\gamma _{C}(\mathbf {Cl} )\,\!}$ is called a reduct of ${\displaystyle C\,\!}$ and is denoted by ${\displaystyle RED_{\mathbf {Cl} }(P)}$. A decision table may have more than one reduct. The intersection of all reducts is known as the core.

Decision rules[]

On the basis of the approximations obtained by means of the dominance relations, it is possible to induce a generalized description of the preferential information contained in the decision table, in terms of decision rules. The decision rules are expressions of the form if [condition] then [consequent], that represent a form of dependency between condition criteria and decision criteria. Procedures for generating decision rules from a decision table use an inducive learning principle. We can distinguish three types of rules: certain, possible and approximate. Certain rules are generated from lower approximations of unions of classes; possible rules are generated from upper approximations of unions of classes and approximate rules are generated from boundary regions.

Certain rules has the following form:

if ${\displaystyle f(x,q_{1})\geq r_{1}\,\!}$ and ${\displaystyle f(x,q_{2})\geq r_{2}\,\!}$ and ${\displaystyle \ldots f(x,q_{p})\geq r_{p}\,\!}$ then ${\displaystyle x\in Cl_{t}^{\geq }}$

if ${\displaystyle f(x,q_{1})\leq r_{1}\,\!}$ and ${\displaystyle f(x,q_{2})\leq r_{2}\,\!}$ and ${\displaystyle \ldots f(x,q_{p})\leq r_{p}\,\!}$ then ${\displaystyle x\in Cl_{t}^{\leq }}$

Possible rules has a similar syntax, however the consequent part of the rule has the form: ${\displaystyle x\,\!}$ could belong to ${\displaystyle Cl_{t}^{\geq }}$ or the form: ${\displaystyle x\,\!}$ could belong to ${\displaystyle Cl_{t}^{\leq }}$.

Finally, approximate rules has the syntax:

if ${\displaystyle f(x,q_{1})\geq r_{1}\,\!}$ and ${\displaystyle f(x,q_{2})\geq r_{2}\,\!}$ and ${\displaystyle \ldots f(x,q_{k})\geq r_{k}\,\!}$ and ${\displaystyle f(x,q_{k+1})\leq r_{k+1}\,\!}$ and ${\displaystyle f(x,q_{k+2})\leq r_{k+2}\,\!}$ and ${\displaystyle \ldots f(x,q_{p})\leq r_{p}\,\!}$ then ${\displaystyle x\in Cl_{s}\cup Cl_{s+1}\cup Cl_{t}}$

The certain, possible and approximate rules represent certain, possible and ambiguous knowledge extracted from the decision table.

Each decision rule should be minimal. Since a decision rule is an implication, by a minimal decision rule we understand such an implication that there is no other implication with an antecedent of at least the same weakness (in other words, rule using a subset of elementary conditions or/and weaker elementary conditions) and a consequent of at least the same strength (in other words, rule assigning objects to the same union or sub-union of classes).

A set of decision rules is complete if it is able to cover all objects from the decision table in such a way that consistent objects are re-classified to their original classes and inconsistent objects are classified to clusters of classes referring to this inconsistency. We call minimal each set of decision rules that is complete and non-redundant, i.e. exclusion of any rule from this set makes it non-complete. One of three induction strategies can be adopted to obtain a set of decision rules:^[4]

• generation of a minimal description, i.e. a minimal set of rules,
• generation of an exhaustive description, i.e. all rules for a given data matrix,
• generation of a characteristic description, i.e. a set of rules covering relatively many objects each, however, all together not necessarily all objects from the decision table

The most popular rule induction algorithm for dominance-based rough set approach is DOMLEM,^[5] which generates minimal set of rules.

Example[]

Consider the following problem of high school students’ evaluations:

Table 1: Example—High School Evaluations

object (student)	${\displaystyle q_{1}}$ (Mathematics)	${\displaystyle q_{2}}$ (Physics)	${\displaystyle q_{3}}$ (Literature)		${\displaystyle d}$ (global score)
${\displaystyle x_{1}}$	medium	medium	bad		bad
${\displaystyle x_{2}}$	good	medium	bad		medium
${\displaystyle x_{3}}$	medium	good	bad		medium
${\displaystyle x_{4}}$	bad	medium	good		bad
${\displaystyle x_{5}}$	bad	bad	medium		bad
${\displaystyle x_{6}}$	bad	medium	medium		medium
${\displaystyle x_{7}}$	good	good	bad		good
${\displaystyle x_{8}}$	good	medium	medium		medium
${\displaystyle x_{9}}$	medium	medium	good		good
${\displaystyle x_{10}}$	good	medium	good		good

Each object (student) is described by three criteria ${\displaystyle q_{1},q_{2},q_{3}\,\!}$, related to the levels in Mathematics, Physics and Literature, respectively. According to the decision attribute, the students are divided into three preference-ordered classes: ${\displaystyle Cl_{1}=\{bad\}}$, ${\displaystyle Cl_{2}=\{medium\}}$ and ${\displaystyle Cl_{3}=\{good\}}$. Thus, the following unions of classes were approximated:

• ${\displaystyle Cl_{1}^{\leq }}$ i.e. the class of (at most) bad students,
• ${\displaystyle Cl_{2}^{\leq }}$ i.e. the class of at most medium students,
• ${\displaystyle Cl_{2}^{\geq }}$ i.e. the class of at least medium students,
• ${\displaystyle Cl_{3}^{\geq }}$ i.e. the class of (at least) good students.

Notice that evaluations of objects ${\displaystyle x_{4}\,\!}$ and ${\displaystyle x_{6}\,\!}$ are inconsistent, because ${\displaystyle x_{4}\,\!}$ has better evaluations on all three criteria than ${\displaystyle x_{6}\,\!}$ but worse global score.

Therefore, lower approximations of class unions consist of the following objects:

${\displaystyle {\underline {P}}(Cl_{1}^{\leq })=\{x_{1},x_{5}\}}$

${\displaystyle {\underline {P}}(Cl_{2}^{\leq })=\{x_{1},x_{2},x_{3},x_{4},x_{5},x_{6},x_{8}\}=Cl_{2}^{\leq }}$

${\displaystyle {\underline {P}}(Cl_{2}^{\geq })=\{x_{2},x_{3},x_{7},x_{8},x_{9},x_{10}\}}$

${\displaystyle {\underline {P}}(Cl_{3}^{\geq })=\{x_{7},x_{9},x_{10}\}=Cl_{3}^{\geq }}$

Thus, only classes ${\displaystyle Cl_{1}^{\leq }}$ and ${\displaystyle Cl_{2}^{\geq }}$ cannot be approximated precisely. Their upper approximations are as follows:

${\displaystyle {\overline {P}}(Cl_{1}^{\leq })=\{x_{1},x_{4},x_{5},x_{6}\}}$

${\displaystyle {\overline {P}}(Cl_{2}^{\geq })=\{x_{2},x_{3},x_{4},x_{6},x_{7},x_{8},x_{9},x_{10}\}}$

while their boundary regions are:

${\displaystyle Bn_{P}(Cl_{1}^{\leq })=Bn_{P}(Cl_{2}^{\geq })=\{x_{4},x_{6}\}}$

Of course, since ${\displaystyle Cl_{2}^{\leq }}$ and ${\displaystyle Cl_{3}^{\geq }}$ are approximated precisely, we have ${\displaystyle {\overline {P}}(Cl_{2}^{\leq })=Cl_{2}^{\leq }}$, ${\displaystyle {\overline {P}}(Cl_{3}^{\geq })=Cl_{3}^{\geq }}$ and ${\displaystyle Bn_{P}(Cl_{2}^{\leq })=Bn_{P}(Cl_{3}^{\geq })=\emptyset }$

The following minimal set of 10 rules can be induced from the decision table:

1. if ${\displaystyle Physics\leq bad}$ then ${\displaystyle student\leq bad}$
2. if ${\displaystyle Literature\leq bad}$ and ${\displaystyle Physics\leq medium}$ and ${\displaystyle Math\leq medium}$ then ${\displaystyle student\leq bad}$
3. if ${\displaystyle Math\leq bad}$ then ${\displaystyle student\leq medium}$
4. if ${\displaystyle Literature\leq medium}$ and ${\displaystyle Physics\leq medium}$ then ${\displaystyle student\leq medium}$
5. if ${\displaystyle Math\leq medium}$ and ${\displaystyle Literature\leq bad}$ then ${\displaystyle student\leq medium}$
6. if ${\displaystyle Literature\geq good}$ and ${\displaystyle Math\geq medium}$ then ${\displaystyle student\geq good}$
7. if ${\displaystyle Physics\geq good}$ and ${\displaystyle Math\geq good}$ then ${\displaystyle student\geq good}$
8. if ${\displaystyle Math\geq good}$ then ${\displaystyle student\geq medium}$
9. if ${\displaystyle Physics\geq good}$ then ${\displaystyle student\geq medium}$
10. if ${\displaystyle Math\leq bad}$ and ${\displaystyle Physics\geq medium}$ then ${\displaystyle student=bad\lor medium}$

The last rule is approximate, while the rest are certain.

Extensions[]

Multicriteria choice and ranking problems[]

The other two problems considered within multi-criteria decision analysis, and ranking problems, can also be solved using dominance-based rough set approach. This is done by converting the decision table into (PCT).^[1]

Variable-consistency DRSA[]

The definitions of rough approximations are based on a strict application of the dominance principle. However, when defining non-ambiguous objects, it is reasonable to accept a limited proportion of negative examples, particularly for large decision tables. Such extended version of DRSA is called model (VC-DRSA)^[6]

Stochastic DRSA[]

In real-life data, particularly for large datasets, the notions of rough approximations were found to be excessively restrictive. Therefore, an extension of DRSA, based on stochastic model (), which allows inconsistencies to some degree, has been introduced.^[7] Having stated the probabilistic model for ordinal classification problems with monotonicity constraints, the concepts of lower approximations are extended to the stochastic case. The method is based on estimating the conditional probabilities using the nonparametric maximum likelihood method which leads to the problem of isotonic regression.

Stochastic dominance-based rough sets can also be regarded as a sort of variable-consistency model.

Software[]

4eMka2 is a decision support system for multiple criteria classification problems based on dominance-based rough sets (DRSA). JAMM is a much more advanced successor of 4eMka2. Both systems are freely available for non-profit purposes on the Laboratory of Intelligent Decision Support Systems (IDSS) website.

See also[]

• Rough sets
• Granular computing
• Multicriteria Decision Analysis (MCDA)

References[]

• Chakhar S., Ishizaka A., Labib A., Saad I. (2016). Dominance-based rough set approach for group decisions, European Journal of Operational Research, 251(1): 206-224
• Li S., Li T. Zhang Z., Chen H., Zhang J. (2015). Parallel Computing of Approximations in Dominance-based Rough Sets Approach, Knowledge-based Systems, 87: 102-111
• Li S., Li T. (2015). Incremental Update of Approximations in Dominance-based Rough Sets Approach under the Variation of Attribute Values, Information Sciences, 294: 348-361
• Li S., Li T., Liu D. (2013). Dynamic Maintenance of Approximations in Dominance-based Rough Set Approach under the Variation of the Object Set, International Journal of Intelligent Systems, 28(8): 729-751

External links[]

• The International Rough Set Society
• Laboratory of Intelligent Decision Support Systems (IDSS) at Poznań University of Technology.
• Extensive list of DRSA references on the Roman Słowiński home page.