نتایج جستجو برای: aggregation operators

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

Journal: :Cybernetics and Systems 2006
Ching-Hsue Cheng Jing-Rong Chang Tien-Hwa Ho

It is difficult to deal with the traditional weight problems of MCDM ( multiple criteria decision making). However, the previous aggregation operators (include OWA) do not take into account the situational factors when processes the aggregation, i.e. these operators and aggregation situation are independent. In order to solve this problem mentioned above, we propose a new powerful OWA aggregati...

2014
Hong-yu Zhang Jian-qiang Wang Xiao-hong Chen

As a generalization of fuzzy sets and intuitionistic fuzzy sets, neutrosophic sets have been developed to represent uncertain, imprecise, incomplete, and inconsistent information existing in the real world. And interval neutrosophic sets (INSs) have been proposed exactly to address issues with a set of numbers in the real unit interval, not just a specific number. However, there are fewer relia...

2006
Michel Grabisch

The paper addresses the problem of extending aggregation operators typically defined on [0, 1] to the symmetric interval [−1, 1], where the “0” value plays a particular role (neutral value). We distinguish the cases where aggregation operators are associative or not. In the former case, the “0” value may play the role of neutral or absorbant element, leading to pseudo-addition and pseudo-multip...

2000
Marcin Detyniecki Bernadette Bouchon-Meunier

We propose an axiom set for the aggregation of truth values, which leads to the characterization of two truth-aggregation families, a prudent and an enthusiastic. The first one has a cautious attitude choosing between two observed values the one which is more uncertain. The second one has an enthusiastic behavior and will reinforce the result if it observes twice the truth or twice the falsity....

1996
Dallan Quass

Materialized views, especially views involving aggregation, are often used in environments such as data warehouses to speed up the evaluation of complex queries. Because the views can be quite complex, as changes are made to the underlying base data it is usually better to incrementally maintain a view by propagating changes to base data onto the view than to recompute the view from scratch. Gr...

2004
Gábor Gosztolya András Kocsor

In this paper we deal with the heuristic exploration of general hypothesis spaces arising both in the HMM and segment-based approaches of speech recognition. The generated hypothesis space is a tree where we assign costs to its nodes. The tree and the costs are both generated in a top-down way where we have node extension rules and aggregation operators for the cost calculation. We introduce a ...

2008
Patricia Everaere Sébastien Konieczny Pierre Marquis

Merging operators aim at defining the beliefs (resp. the goal) of a group of agents from a profile of bases, gathering the beliefs (resp. the goals) of each member of the group. In the propositional setting, a well-studied family of merging operators are distance-based ones: the models of the merged base are the closest interpretations to the given profile. Closeness is, in this context, measur...

2008
José M. Merigó Anna M. Gil - Lafuente

Different types of aggregation operators such as the ordered weighted quasi-arithmetic mean (Quasi-OWA) operator and the normalized Hamming distance are studied. We introduce the use of the OWA operator in generalized distances such as the quasiarithmetic distance. We will call these new distance aggregation the ordered weighted quasi-arithmetic distance (Quasi-OWAD) operator. We develop a gene...

Journal: :Expert Syst. Appl. 2011
Jian Wu Qing-wei Cao

Chiclana et al. [Chiclana, F., Herrera-Viedma, E., Herrera, F., Alonso, S. (2007). European Journal of Operational Research 182, 383–399] provided some IOWA operators for aggregating the individual fuzzy preference elations. The aim of this work is further to study their desired properties under group decision making problem with fuzzy preference relations. First, it is proved that the collecti...

Journal: :IEEE transactions on neural networks 2000
Nicolaos B. Karayiannis

This paper presents the development and investigates the properties of ordered weighted learning vector quantization (LVQ) and clustering algorithms. These algorithms are developed by using gradient descent to minimize reformulation functions based on aggregation operators. An axiomatic approach provides conditions for selecting aggregation operators that lead to admissible reformulation functi...

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

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