Consistency and stability in aggregation operators: An application to missing data problems

20Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this work we analyze the key issue of the relationship that should hold between the operators in a family {An} of aggregation operators in order to understand they properly define a consistent whole. Here we extend some of the ideas about stability of a family of aggregation operators into a more general framework, formally defining the notions of i - L and j - R strict stability for families of aggregation operators. The notion of strict stability of order k is introduced as well. Finally, we also present an application of the strict stability conditions to deal with missing data problems in an information aggregation process. For this analysis, we have focused in the weighted mean family and the quasi-arithmetic weighted means families. © 2014 Copyright: the authors.

Cite

CITATION STYLE

APA

Gómez, D., Rojas, K., Montero, J., Rodríguez, J. T., & Beliakov, G. (2014). Consistency and stability in aggregation operators: An application to missing data problems. International Journal of Computational Intelligence Systems, 7(3), 595–604. https://doi.org/10.1080/18756891.2013.859862

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free