نتایج جستجو برای: ordered weighted averaging

تعداد نتایج: 170391  

2008
Wlodzimierz Ogryczak

The Reference Point Method (RPM) is an interactive technique formalizing the so-called quasi-satisficing approach to multiple criteria optimization. The DM’s preferences are there specified in terms of reference (target) levels for several criteria. The reference levels are further used to build the scalarizing achievement function which generates an efficient solution when optimized. Typical R...

2002
János C. FODOR Jean-Luc MARICHAL Marc ROUBENS

We investigate the aggregation phase of multicriteria decision making procedures. Characterizations of some classes of nonconventional aggregation operators are established. The first class consists of the ordered weighted averaging operators (OWA) introduced by Yager. The second class corresponds to the weighted maximum defined by Dubois and Prade. The dual class (weighted minimum) and some or...

2008
José M. Merigó Montserrat Casanovas

The Minkowski distance is a distance measure that generalizes a wide range of other distances such as the Hamming and the Euclidean distance. In this paper, we develop a generalization of the Minkowski distance by using the induced ordered weighted averaging (IOWA) operator. We will call it the induced Minkowski OWA distance (IMOWAD). Then, we are able to obtain a wider range of distance measur...

Journal: :iranian journal of fuzzy systems 2009
ferenc szidarovszky mahdi zarghami

this paper will introduce a new method to obtain the order weightsof the ordered weighted averaging (owa) operator. we will first show therelation between fuzzy quantifiers and neat owa operators and then offer anew combination of them. fuzzy quantifiers are applied for soft computingin modeling the optimism degree of the decision maker. in using neat operators,the ordering of the inputs is not...

Fuzzy risk analysis, as a powerful tool to address uncertain information, can provide an appropriate method for risk analysis. However, the previous fuzzy risk analysis methods still have some weaknesses. To overcome the weaknesses of existing fuzzy risk analysis methods, a novel method for ranking generalized fuzzy numbers is proposed for addressing fuzzy risk analysis problems. In the propose...

This paper will introduce a new method to obtain the order weightsof the Ordered Weighted Averaging (OWA) operator. We will first show therelation between fuzzy quantifiers and neat OWA operators and then offer anew combination of them. Fuzzy quantifiers are applied for soft computingin modeling the optimism degree of the decision maker. In using neat operators,the ordering of the inputs is not...

Journal: :Computer Speech & Language 2007
László Tóth András Kocsor

Here we seek to understand the similarities and differences between two speech recognition approaches, namely the HMM/ANN hybrid and the posterior-based segmental model. Both these techniques create local posterior probability estimates and combine these estimates into global posteriors – but they are built on somewhat different concepts and mathematical derivations. The HMM/ANN hybrid combines...

Journal: :Journal of Intelligent and Fuzzy Systems 2014
Carlos Guerra Aranzazu Jurio Humberto Bustince Carlos Lopez-Molina

A large number of methods in the edge detection literature are only prepared to deal with monochannel images, which represent the value at each pixel by means of scalar values. This fact hinders their applicability to many fields in which multichannel are common, including remote sensing or medical imagery. Very often, multichannel images have to be turned into grayscale images on which edge de...

Journal: :Computers & Industrial Engineering 2009
Jian Wu Bo-Liang Sun Changyong Liang Shanlin Yang

It has a wide attention about the methods for determining OWA operator weights. At the beginning of this dissertation, we provide a briefly overview of the main approaches for obtaining the OWA weights with a predefined degree of orness. Along this line, we nextmake an important generalization of these approaches as a special case of the well-known andmore general problem of calculation of the ...

2011
Laura Climent Miguel A. Salido Federico Barber

Constraint programming is a successful technology for solving combinatorial problems modeled as constraint satisfaction problems (CSPs). Many real life problems come from uncertain and dynamic environments, which means that the initial description of the problem may change during its execution. In these cases, the solution found for a problem may become invalid. The search of robust solutions f...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید