We use the notion of the rough set diagram introduced by Wasilewska and Vigneron 8] to present a general decision procedure for validity of equations in rough boolean algebra. First, we establish equivalence of validity in rough boolean algebra to validity in so called simple rough boolean algebra. Second, we propose a decision method for simple rough boolean algebra, which is to construct and ...

Many real world problems deal with ordering of objects instead of classifying objects, although most of research in data analysis has been focused on the latter. One of the extensions of classical rough sets to take into account the ordering properties is dominance-based rough sets approach which is mainly based on substitution of the indiscernibility relation by a dominance relation. In this p...

Dominance-based Rough Sets Approach (DRSA) is a generalized model of the classical Rough Sets Theory (RST) which may handle information with preference-ordered attribute domain. The attribute set in the information system may evolve over time. Approximations of DRSA used to induce decision rules need updating for knowledge discovery and other related tasks. We firstly introduce a kind of domina...

Dominance-based rough sets approach (DRSA) is an effective tool to deal with information with preference-ordered attribute domains and decision classes. Any information system may evolve when new objects enter into or old objects get out. Approximations of DRSA need update for decision analysis or other relative tasks. Incremental updating is a feasible and effective technique to update approxi...

The Dominance-based Rough Set Approach (DRSA) is an extension of Rough Sets Theory to handle multicriteria classification problems by authorizing preferenceordered attributes. The DRSA assumes the existence of a single decision table while real-world decision problems imply generally several experts with different decision tables. The objective of this paper is to propose an algorithm for the a...

In this paper, we introduce a new rough set approach, which is called the limited dominance-based rough set model into the incomplete decision system. The limited dominance relation is different from the traditional dominance relation in the incomplete environment because we are on the assumption that the unknown value can only be compared with the maximal or minimal value in the domain of the ...

Set-valued ordered information systems can be classified into two categories: disjunctive and conjunctive systems. Through introducing two new dominance relations to set-valued information systems, we first introduce the conjunctive/disjunctive set-valued ordered information systems, and develop an approach to queuing problems for objects in presence of multiple attributes and criteria. Then, w...

Rough set theory has been proposed by Pawlak in the early 80s to deal with inconsistency problems following from information granulation. It operates on an information table composed of a set U of objects described by a set Q of condition and decision attributes. Decision attributes make a partition of U into decision classes. Basic concepts of rough set theory are: indiscernibility relation on...

Feature selection methods, as a preprocessing step to machine learning, are effective in reducing dimensionality, removing irrelevant data, increasing learning accuracy, and improving result comprehensibility. However, the recent increase of dimensionality of data poses a severe challenge to many existing feature selection methods with respect to the efficiency and effectiveness. In this work, ...

One of the most sustainable ways of improving the landscape value is the valorisation of the countryside dirt road network with the purpose of creating a greenweb, a communication system able to improve the territory attractiveness. The study assumes an axiological approach to land planning, including a qualitative valuation model and an interactive multicriteria tool based on the combination o...