Generation of Exhaustive Set of Rules within Dominance-based Rough Set Approach

AbstractThe rough sets theory has proved to be a useful mathematical tool for the analysis of a vague description of objects. One of extensions of the classic theory is the Dominance-based Set Approach (DRSA) that allows analysing preference-ordered data. The analysis ends with a set of decision rules induced from rough approximations of decision classes. The role of the decision rules is to explain the analysed phenomena, but they may also be applied in classifying new, unseen objects. There are several strategies of decision rule induction. One of them consists in generating the exhaustive set of minimal rules. In this paper we present an algorithm based on Boolean reasoning techniques that follows this strategy with in DRSA

Rough set and rule-based multicriteria decision aiding

The aim of multicriteria decision aiding is to give the decision maker a recommendation concerning a set of objects evaluated from multiple points of view called criteria. Since a rational decision maker acts with respect to his/her value system, in order to recommend the most-preferred decision, one must identify decision maker's preferences. In this paper, we focus on preference discovery from data concerning some past decisions of the decision maker. We consider the preference model in the form of a set of "if..., then..." decision rules discovered from the data by inductive learning. To structure the data prior to induction of rules, we use the Dominance-based Rough Set Approach (DRSA). DRSA is a methodology for reasoning about data, which handles ordinal evaluations of objects on considered criteria and monotonic relationships between these evaluations and the decision. We review applications of DRSA to a large variety of multicriteria decision problems

Multiple Criteria Ranking and Choice with All Compatible Minimal Cover Sets of Decision Rules

We introduce a new multiple criteria ranking/choice method that applies Dominance-based Rough Set Approach (DRSA) and represents the Decision Maker's (DM's) preferences with decision rules. The DM provides a set of pairwise comparisons indicating whether an outranking (weak preference) relation should hold for some pairs of reference alternatives. This preference information is structured using the lower and upper approximations of outranking (S) and non-outranking (S c ) relations. Then, all minimal-cover (MC) sets of decision rules being compatible with this preference information are induced. Each of these sets is supported by some positive examples (pairs of reference alternatives from the lower approximation of a preference relation) and it does not cover any negative example (pair of alternatives from the upper approximation of an opposite preference relation). The recommendations obtained by all MC sets of rules are analyzed to describe pairwise outranking and non-outranking relations, using probabilistic indices (estimates of probabilities that one alternative outranks or does not outrank the other). Furthermore, given the preference relations obtained in result of application of each MC set of rules on a considered set of alternatives, we exploit them using some scoring procedures. From this, we derive the distribution of ranks attained by the alternatives. We also extend the basic approach in several ways. The practical usefulness of the method is demonstrated on a problem of ranking Polish cities according to their innovativeness

Positive region: An enhancement of partitioning attribute based rough set for categorical data

Datasets containing multi-value attributes are often involved in several domains, like pattern recognition, machine learning and data mining. Data partition is required in such cases. Partitioning attributes is the clustering process for the whole data set which is specified for further processing. Recently, there are already existing prominent rough set-based approaches available for group objects and for handling uncertainty data that use indiscernibility attribute and mean roughness measure to perform attribute partitioning. Nevertheless, most of the partitioning attribute methods for selecting partitioning attribute algorithm for categorical data in clustering datasets are incapable of optimal partitioning. This indiscernibility and mean roughness measures, however, require the calculation of the lower approximation, which has less accuracy and it is an expensive task to compute. This reduces the growth of the set of attributes and neglects the data found within the boundary region. This paper presents a new concept called the "Positive Region Based Mean Dependency (PRD)”, that calculates the attribute dependency. In order to determine the mean dependency of the attributes, that is acceptable for categorical datasets, using a positive region-based mean dependency measure, PRD defines the method. By avoiding the lower approximation, PRD is an optimal substitute for the conventional dependency measure in partitioning attribute selection. Contrary to traditional RST partitioning methods, the proposed method can be employed as a measure of data output uncertainty and as a tailback for larger and multiple data clustering. The performance of the method presented is evaluated and compared with the algorithmes of Information-Theoretical Dependence Roughness (ITDR) and Maximum Indiscernible Attribute (MIA)

Decision-making with gaussian processes: sampling strategies and monte carlo methods

We study Gaussian processes and their application to decision-making in the real world. We begin by reviewing the foundations of Bayesian decision theory and show how these ideas give rise to methods such as Bayesian optimization. We investigate practical techniques for carrying out these strategies, with an emphasis on estimating and maximizing acquisition functions. Finally, we introduce pathwise approaches to conditioning Gaussian processes and demonstrate key benefits for representing random variables in this manner.Open Acces

Spare parts classification in industrial manufacturing using the dominance-based rough set approach

Classification is one of the critical issues in the operations management of spare parts. The issue of managing spare parts involves multiple criteria to be taken into consideration, and therefore, a number of approaches exists that consider criteria such as criticality, price, demand, lead time, and obsolescence, to name a few. In this paper, we first review proposals to deal with inventory control. We then propose a three-phase multicriteria classification framework for spare parts management using the dominance-based rough set approach (DRSA). In the first phase, a set of ‘if–then’ decision rules is generated from historical data using the DRSA. The generated rules are then validated in the second phase by using both the automated and manual approaches, including cross-validation and feedback assessments by the decision maker. The third and final phase is to classify an unseen set of spare parts in a real setting. The proposed approach has been successfully applied to data collected from a manufacturing company in China. The proposed framework was practically tested on different spare parts and, based on the feedback received from the industry experts, 96% of the spare parts were correctly classified. Furthermore, the cross-validation results show that the proposed approach significantly outperforms other well-known classification methods. The proposed approach has several important characteristics that distinguish it from existing ones: (i) it is a learning-set based analysis approach; (ii) it uses a powerful multicriteria classification method, namely the DRSA; (iii) it validates the generated decision rules with multiple strategies; and (iv) it actively involves the decision maker during all the steps of the decision making process