A novel generalization of the OWA and IOWA operators based on weighting vectors

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F25%3A73633254" target="_blank" >RIV/61989592:15310/25:73633254 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0020025525003147" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0020025525003147</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ins.2025.122182" target="_blank" >10.1016/j.ins.2025.122182</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A novel generalization of the OWA and IOWA operators based on weighting vectors

Popis výsledku v původním jazyce

In this article, we present two novel generalizations of the OWA and IOWA operators based on weighting vectors, which could be useful in the field of data aggregation. In our first approach, OWAs and IOWAs are aggregated. In the case of convex sum aggregation, the corresponding ORNESS is also evaluated. In our second approach, given a weighting vector W, we consider an ordering mapping b : [0, 1]n- [0, 1]n that determines which weights and which inputs are related by a product, and an appropriate sum of these products is then considered. In the event of ties in the proposed approach, these are resolved by means of the arithmetic mean, a methodology that is analogous to that employed in the context of IOWA operators. Our approach is illustrated on series of examples including the related figures.

Název v anglickém jazyce

A novel generalization of the OWA and IOWA operators based on weighting vectors

Popis výsledku anglicky

In this article, we present two novel generalizations of the OWA and IOWA operators based on weighting vectors, which could be useful in the field of data aggregation. In our first approach, OWAs and IOWAs are aggregated. In the case of convex sum aggregation, the corresponding ORNESS is also evaluated. In our second approach, given a weighting vector W, we consider an ordering mapping b : [0, 1]n- [0, 1]n that determines which weights and which inputs are related by a product, and an appropriate sum of these products is then considered. In the event of ties in the proposed approach, these are resolved by means of the arithmetic mean, a methodology that is analogous to that employed in the context of IOWA operators. Our approach is illustrated on series of examples including the related figures.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

INFORMATION SCIENCES

ISSN

0020-0255

e-ISSN

1872-6291

Svazek periodika

713

Číslo periodika v rámci svazku

SEP

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

10

Strana od-do

"122182-1"-"122182-10"

Kód UT WoS článku

001471469100001

EID výsledku v databázi Scopus

2-s2.0-105002275757