On ordered weighted averaging aggregation operators in multicriteria decision-making
01 Jan 1988-Vol. 18, pp 183-190
About: The article was published on 1988-01-01 and is currently open access. It has received 3030 citations till now. The article focuses on the topics: Ordered weighted averaging aggregation operator.
Citations
More filters
Book•
[...]
05 Jun 2007
TL;DR: The second edition of Ontology Matching has been thoroughly revised and updated to reflect the most recent advances in this quickly developing area, which resulted in more than 150 pages of new content.
Abstract: Ontologies tend to be found everywhere. They are viewed as the silver bullet for many applications, such as database integration, peer-to-peer systems, e-commerce, semantic web services, or social networks. However, in open or evolving systems, such as the semantic web, different parties would, in general, adopt different ontologies. Thus, merely using ontologies, like using XML, does not reduce heterogeneity: it just raises heterogeneity problems to a higher level. Euzenat and Shvaikos book is devoted to ontology matching as a solution to the semantic heterogeneity problem faced by computer systems. Ontology matching aims at finding correspondences between semantically related entities of different ontologies. These correspondences may stand for equivalence as well as other relations, such as consequence, subsumption, or disjointness, between ontology entities. Many different matching solutions have been proposed so far from various viewpoints, e.g., databases, information systems, and artificial intelligence. The second edition of Ontology Matching has been thoroughly revised and updated to reflect the most recent advances in this quickly developing area, which resulted in more than 150 pages of new content. In particular, the book includes a new chapter dedicated to the methodology for performing ontology matching. It also covers emerging topics, such as data interlinking, ontology partitioning and pruning, context-based matching, matcher tuning, alignment debugging, and user involvement in matching, to mention a few. More than 100 state-of-the-art matching systems and frameworks were reviewed. With Ontology Matching, researchers and practitioners will find a reference book that presents currently available work in a uniform framework. In particular, the work and the techniques presented in this book can be equally applied to database schema matching, catalog integration, XML schema matching and other related problems. The objectives of the book include presenting (i) the state of the art and (ii) the latest research results in ontology matching by providing a systematic and detailed account of matching techniques and matching systems from theoretical, practical and application perspectives.
2,579 citations
TL;DR: This paper develops a computational technique for computing with words without any loss of information in the 2-tuple linguistic model and extends different classical aggregation operators to deal with this model.
Abstract: The fuzzy linguistic approach has been applied successfully to many problems. However, there is a limitation of this approach imposed by its information representation model and the computation methods used when fusion processes are performed on linguistic values. This limitation is the loss of information; this loss of information implies a lack of precision in the final results from the fusion of linguistic information. In this paper, we present tools for overcoming this limitation. The linguistic information is expressed by means of 2-tuples, which are composed of a linguistic term and a numeric value assessed in (-0.5, 0.5). This model allows a continuous representation of the linguistic information on its domain, therefore, it can represent any counting of information obtained in a aggregation process. We then develop a computational technique for computing with words without any loss of information. Finally, different classical aggregation operators are extended to deal with the 2-tuple linguistic model.
2,353 citations
TL;DR: Based on score function and accuracy function, a method is introduced for the comparison between two intuitionistic fuzzy values and some aggregation operators are developed, such as the intuitionism fuzzy weighted averaging operator, intuitionists fuzzy ordered weighted averaging operators, and intuitionistic fuzziness hybrid aggregation operator, for aggregating intuitionist fuzzy values.
Abstract: An intuitionistic fuzzy set, characterized by a membership function and a non-membership function, is a generalization of fuzzy set. In this paper, based on score function and accuracy function, we introduce a method for the comparison between two intuitionistic fuzzy values and then develop some aggregation operators, such as the intuitionistic fuzzy weighted averaging operator, intuitionistic fuzzy ordered weighted averaging operator, and intuitionistic fuzzy hybrid aggregation operator, for aggregating intuitionistic fuzzy values and establish various properties of these operators.
2,131 citations
Book•
01 Jan 2004TL;DR: In this article, the authors present a set of heuristics for solving problems with probability and statistics, including the Traveling Salesman Problem and the Problem of Who Owns the Zebra.
Abstract: I What Are the Ages of My Three Sons?.- 1 Why Are Some Problems Difficult to Solve?.- II How Important Is a Model?.- 2 Basic Concepts.- III What Are the Prices in 7-11?.- 3 Traditional Methods - Part 1.- IV What Are the Numbers?.- 4 Traditional Methods - Part 2.- V What's the Color of the Bear?.- 5 Escaping Local Optima.- VI How Good Is Your Intuition?.- 6 An Evolutionary Approach.- VII One of These Things Is Not Like the Others.- 7 Designing Evolutionary Algorithms.- VIII What Is the Shortest Way?.- 8 The Traveling Salesman Problem.- IX Who Owns the Zebra?.- 9 Constraint-Handling Techniques.- X Can You Tune to the Problem?.- 10 Tuning the Algorithm to the Problem.- XI Can You Mate in Two Moves?.- 11 Time-Varying Environments and Noise.- XII Day of the Week of January 1st.- 12 Neural Networks.- XIII What Was the Length of the Rope?.- 13 Fuzzy Systems.- XIV Everything Depends on Something Else.- 14 Coevolutionary Systems.- XV Who's Taller?.- 15 Multicriteria Decision-Making.- XVI Do You Like Simple Solutions?.- 16 Hybrid Systems.- 17 Summary.- Appendix A: Probability and Statistics.- A.1 Basic concepts of probability.- A.2 Random variables.- A.2.1 Discrete random variables.- A.2.2 Continuous random variables.- A.3 Descriptive statistics of random variables.- A.4 Limit theorems and inequalities.- A.5 Adding random variables.- A.6 Generating random numbers on a computer.- A.7 Estimation.- A.8 Statistical hypothesis testing.- A.9 Linear regression.- A.10 Summary.- Appendix B: Problems and Projects.- B.1 Trying some practical problems.- B.2 Reporting computational experiments with heuristic methods.- References.
2,089 citations
TL;DR: The issue of having to choose a best alternative in multicriteria decision making leads the problem of comparing Pythagorean membership grades to be considered, and a variety of aggregation operations are introduced for these Pythagorian fuzzy subsets.
Abstract: We first look at some nonstandard fuzzy sets, intuitionistic, and interval-valued fuzzy sets. We note both these allow a degree of commitment of less then one in assigning membership. We look at the formulation of the negation for these sets and show its expression in terms of the standard complement with respect to the degree of commitment. We then consider the complement operation. We describe its properties and look at alternative definitions of complement operations. We then focus on the Pythagorean complement. Using this complement, we introduce a class of nonstandard Pythagorean fuzzy subsets whose membership grades are pairs, (a, b) satisfying the requirement a
2
+ b
2
≤ 1. We introduce a variety of aggregation operations for these Pythagorean fuzzy subsets. We then look at multicriteria decision making in the case where the criteria satisfaction are expressed using Pythagorean membership grades. The issue of having to choose a best alternative in multicriteria decision making leads us to consider the problem of comparing Pythagorean membership grades.
1,706 citations