Induced aggregation operators in the ordered weighted average sum

Merigo, JM; Alrajeh, N; Peris-Ortiz, M

Induced aggregation operators in the ordered weighted average sum

Merigo, JM

Alrajeh, N Peris-Ortiz, M

Permalink

Publication Type:: Conference Proceeding
Citation:: 2016 IEEE Symposium Series on Computational Intelligence, SSCI 2016, 2017
Issue Date:: 2017-02-09

Closed Access

	Filename	Description	Size
	07850148.pdf	Published version	222.93 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Merigo, JM https://orcid.org/0000-0002-4672-6961	en_US
dc.contributor.author	Alrajeh, N	en_US
dc.contributor.author	Peris-Ortiz, M	en_US
dc.date.issued	2017-02-09	en_US
dc.identifier.citation	2016 IEEE Symposium Series on Computational Intelligence, SSCI 2016, 2017	en_US
dc.identifier.isbn	9781509042401	en_US
dc.identifier.uri	http://hdl.handle.net/10453/126395
dc.description.abstract	© 2016 IEEE. The ordered weighted average (OWA) aggregation is an extension of the classical weighted average by using a reordering process of the arguments in a decreasing or increasing way. This article presents new averaging aggregation operators by using sums and order inducing variables. This approach produces the induced ordered weighted average sum (IOWAS). The IOWAS operator aggregates a set of sums using a complex reordering process based on order-inducing variables. This approach includes a different types of aggregation structures including the well-known OWA families. The work presents additional generalizations by using generalized and quasi-arithmetic means. The paper ends with a simple numerical example that shows how to aggregate with this new approach.	en_US
dc.relation.ispartof	2016 IEEE Symposium Series on Computational Intelligence, SSCI 2016	en_US
dc.relation.isbasedon	10.1109/SSCI.2016.7850148	en_US
dc.title	Induced aggregation operators in the ordered weighted average sum	en_US
dc.type	Conference Proceeding
utslib.for	0802 Computation Theory and Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Information, Systems and Modelling
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

© 2016 IEEE. The ordered weighted average (OWA) aggregation is an extension of the classical weighted average by using a reordering process of the arguments in a decreasing or increasing way. This article presents new averaging aggregation operators by using sums and order inducing variables. This approach produces the induced ordered weighted average sum (IOWAS). The IOWAS operator aggregates a set of sums using a complex reordering process based on order-inducing variables. This approach includes a different types of aggregation structures including the well-known OWA families. The work presents additional generalizations by using generalized and quasi-arithmetic means. The paper ends with a simple numerical example that shows how to aggregate with this new approach.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/126395