Skip to main content Accessibility help
×
Hostname: page-component-77c89778f8-5wvtr Total loading time: 0 Render date: 2024-07-17T17:42:48.984Z Has data issue: false hasContentIssue false

6 - Construction methods

Published online by Cambridge University Press:  05 March 2013

Michel Grabisch
Affiliation:
Université de Paris I
Jean-Luc Marichal
Affiliation:
Université du Luxembourg
Radko Mesiar
Affiliation:
Slovenská Technická Univerzita
Endre Pap
Affiliation:
University of Novi Sad, Serbia
Get access

Summary

Introduction

There is a well-known demand for an ample variety of aggregation functions having predictable and tailored properties to be used in modeling processes. Several construction methods have been introduced and developed for extending the known classes of aggregation functions (defined either on [0, 1] or, possibly, on some other domains). Obviously, new construction methods should be a central issue in the rapidly developing field of aggregation functions. In this chapter we present some well-established construction methods as well as some new ones.

The first group of construction methods can be characterized “from simple to complex”. They are based on standard arithmetical operations on the real line and fixed real functions. The second group of construction methods starts from given aggregation functions to construct new ones. Here we can start either from aggregation functions with a fixed number of inputs (e.g., from binary functions only) or from extended aggregation functions. Observe that some methods presented are applicable to all aggregation functions (for example, transformation), while some of them can be applied only to specific cases. Finally, there are construction methods allowing us to find aggregation functions when only some partial knowledge about them is available. These extension methods are discussed in the last two sections of this chapter.

Transformed aggregation functions

The idea of transformation of aggregation functions can be clearly illustrated on the well-known relation of the two basic arithmetic operations of addition and multiplication.

Type
Chapter
Information
Aggregation Functions , pp. 234 - 271
Publisher: Cambridge University Press
Print publication year: 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×