Dominance-based Rough Set Approach, basic ideas and main trends

Dominance-based Rough Approach (DRSA) has been proposed as a machine learning and knowledge discovery methodology to handle Multiple Criteria Decision Aiding (MCDA). Due to its capacity of asking the decision maker (DM) for simple preference information and supplying easily understandable and explainable recommendations, DRSA gained much interest during the years and it is now one of the most appreciated MCDA approaches. In fact, it has been applied also beyond MCDA domain, as a general knowledge discovery and data mining methodology for the analysis of monotonic (and also non-monotonic) data. In this contribution, we recall the basic principles and the main concepts of DRSA, with a general overview of its developments and software. We present also a historical reconstruction of the genesis of the methodology, with a specific focus on the contribution of Roman S{\l}owi\'nski.Comment: This research was partially supported by TAILOR, a project funded by European Union (EU) Horizon 2020 research and innovation programme under GA No 952215. This submission is a preprint of a book chapter accepted by Springer, with very few minor differences of just technical natur

Consistency based completion approaches of incomplete preference relations in uncertain decision contexts.

Uncertainty, hesitation and vagueness are inherent to human beings when articulating opinions and preferences. Therefore in decision making situations it might well be the case that experts are unable to express their opinions in an accurate way. Under these circumstances, various families of preference relations (PRs) have been proposed (linguistic, intuitionistic and interval fuzzy PRs) to allow the experts to manifest some degree of hesitation when enunciating their opinions. An extreme case of uncertainty happens when an expert is unable to differentiate the degree up to which one preference is preferred to another. Henceforth, incomplete preference relations are possible. It is worth to bear in mind that incomplete information does not mean low quality information, on the contrary, in many occasions experts might prefer no to provide information in other to keep consistency. Consequently mechanism to deal with incomplete information in decision making are necessary. This contribution presents the main consistency based completion approaches to estimate incomplete preference values in linguistic, intuitionistic and interval fuzzy PRs

New Trends in Neutrosophic Theory and Applications Volume II

Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory was proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs introducing neutrosophic sets and its applications, by many authors around the world. Also, an international journal - Neutrosophic Sets and Systems started its journey in 2013. Single valued neutrosophic sets have found their way into several hybrid systems, such as neutrosophic soft set, rough neutrosophic set, neutrosophic bipolar set, neutrosophic expert set, rough bipolar neutrosophic set, neutrosophic hesitant fuzzy set, etc. Successful applications of single valued neutrosophic sets have been developed in multiple criteria and multiple attribute decision making. This second volume collects original research and application papers from different perspectives covering different areas of neutrosophic studies, such as decision making, graph theory, image processing, probability theory, topology, and some theoretical papers. This volume contains four sections: DECISION MAKING, NEUTROSOPHIC GRAPH THEORY, IMAGE PROCESSING, ALGEBRA AND OTHER PAPERS. First paper (Pu Ji, Peng-fei Cheng, Hongyu Zhang, Jianqiang Wang. Interval valued neutrosophic Bonferroni mean operators and the application in the selection of renewable energy) aims to construct selection approaches for renewable energy considering the interrelationships among criteria. To do that, Bonferroni mean (BM) and geometric BM (GBM) are employed

Knowledge Granulation, Rough Entropy and Uncertainty Measure in Incomplete Fuzzy Information System

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 paper, we address knowledge measures and reduction in incomplete fuzzy information system using the approach. Firstly, new definitions of knowledge granulation and rough entropy are given, and some important properties of them are investigated. Then, dominance matrix about the measures knowledge granulation and rough entropy is obtained, which could be used to eliminate the redundant attributes in incomplete fuzzy information system. Lastly, a matrix algorithm for knowledge reduction is proposed. An example illustrates the validity of this method and shows the method is applicable to complex fuzzy system. Experiments are also made to show the performance of the newly proposed algorithm

Managing Incomplete Preference Relations in Decision Making: A Review and Future Trends

In decision making, situations where all experts are able to efficiently express their preferences over all the available options are the exception rather than the rule. Indeed, the above scenario requires all experts to possess a precise or sufficient level of knowledge of the whole problem to tackle, including the ability to discriminate the degree up to which some options are better than others. These assumptions can be seen unrealistic in many decision making situations, especially those involving a large number of alternatives to choose from and/or conflicting and dynamic sources of information. Some methodologies widely adopted in these situations are to discard or to rate more negatively those experts that provide preferences with missing values. However, incomplete information is not equivalent to low quality information, and consequently these methodologies could lead to biased or even bad solutions since useful information might not being taken properly into account in the decision process. Therefore, alternative approaches to manage incomplete preference relations that estimates the missing information in decision making are desirable and possible. This paper presents and analyses methods and processes developed on this area towards the estimation of missing preferences in decision making, and highlights some areas for future research

Neutrosophic Multi-Criteria Decision Making

The notion of a neutrosophic quadruple BCK/BCI-number is considered in the first article (“Neutrosophic Quadruple BCK/BCI-Algebras”, by Young Bae Jun, Seok-Zun Song, Florentin Smarandache, and Hashem Bordbar), and a neutrosophic quadruple BCK/BCI-algebra, which consists of neutrosophic quadruple BCK/BCI-numbers, is constructed. Several properties are investigated, and a (positive implicative) ideal in a neutrosophic quadruple BCK-algebra and a closed ideal in a neutrosophic quadruple BCI-algebra are studied. Given subsets A and B of a BCK/BCI-algebra, the set NQ(A,B), which consists of neutrosophic quadruple BCK/BCInumbers with a condition, is established. Conditions for the set NQ(A,B) to be a (positive implicative) ideal of a neutrosophic quadruple BCK-algebra are provided, and conditions for the set NQ(A,B) to be a (closed) ideal of a neutrosophic quadruple BCI-algebra are given. Techniques for the order of preference by similarity to ideal solution (TOPSIS) and elimination and choice translating reality (ELECTRE) are widely used methods to solve multicriteria decision-making problems. In the second research article (“Decision-Making with Bipolar Neutrosophic TOPSIS and Bipolar Neutrosophic ELECTRE-I”), Muhammad Akram, Shumaiza, and Florentin Smarandache present the bipolar neutrosophic TOPSIS method and the bipolar neutrosophic ELECTRE-I method to solve such problems. The authors use the revised closeness degree to rank the alternatives in the bipolar neutrosophic TOPSIS method. The researchers describe the bipolar neutrosophic TOPSIS method and the bipolar neutrosophic ELECTRE-I method by flow charts, also solving numerical examples by the proposed methods and providing a comparison of these methods. In the third article (“Interval Neutrosophic Sets with Applications in BCK/BCI-Algebra”, by Young Bae Jun, Seon Jeong Kim and Florentin Smarandache), the notion of (T(i,j),I(k,l),F(m,n))-interval neutrosophic subalgebra in BCK/BCI-algebra is introduced for i,j,k,l,m,n infoNumber 1,2,3,4, and properties and relations are investigated. The notion of interval neutrosophic length of an interval neutrosophic set is also introduced, and the related properties are investigated

Discrete Mathematics and Symmetry

Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group