An Application of Rough Sets to Monk's Problems Solving
نویسندگان
چکیده
In this paper, the main techniques of inductive machine learning are united to the knowledge reduction theory based on rough sets from the theoretical point of view. And then the Monk’s problems are resolved again employing rough sets. As far as accuracy and conciseness are concerned, the learning algorithms based on rough sets have remarkable superiority to the previous methods.
منابع مشابه
Chapter 17 a Comparison of Dynamic and Non{dynamic Rough Set Methods for Extracting Laws from Decision Tables
We report results of experiments on several data sets, in particular: Monk's problems data (see 58]), medical data (lymphography, breast cancer, primary tumor-see 30]) and StatLog's data (see 32]). We compare standard methods for extracting laws from decision tables (see 43], 52]), based on rough set (see 42]) and boolean reasoning (see 8]), with the method based on dynamic reducts and dynamic ...
متن کاملA New Balancing and Ranking Method based on Hesitant Fuzzy Sets for Solving Decision-making Problems under Uncertainty
The purpose of this paper is to extend a new balancing and ranking method to handle uncertainty for a multiple attribute analysis under a hesitant fuzzy environment. The presented hesitant fuzzy balancing and ranking (HF-BR) method does not require attributes’ weights through the process of multiple attribute decision making (MADM) under hesitant conditions. For the rating of possible alternati...
متن کاملاستفاده از تحلیل پوششی دادههای ناهموار برای ارزیابی تأمینکنندگان، مطالعه موردی: گروه صنعتی ایران ترانسفو
Im this paper, the performance of suppliers is evaluated based on their efficiencies. Evaluation environment is not always precise and we may face imprecise for evaluation indexes values. In this situation, traditional and certain models cannot be employed. For overcoming uncertainty problem, there are different models such as stochastic, statistical, Rough, Fuzzy, etc for solving uncertainty e...
متن کاملMultigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making
In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...
متن کاملL-valued Fuzzy Rough Sets
In this paper, we take a GL-quantale as the truth value table to study a new rough set model—L-valued fuzzy rough sets. The three key components of this model are: an L-fuzzy set A as the universal set, an L-valued relation of A and an L-fuzzy set of A (a fuzzy subset of fuzzy sets). Then L-valued fuzzy rough sets are completely characterized via both constructive and axiomatic approaches.
متن کامل