Publication: A generalization of stability for families of aggregation operators
Loading...
Official URL
Full text at PDC
Publication Date
2020-01
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Citations
Exportar
Abstract
In this paper we extend the notion of stability of each aggregation function as presented in a previous paper of the authors, where an aggregation function was denominated Family of Aggregation Operators (FAO) in order to stress that aggregation operators within an aggregation function should be consistent. We will show that the previous definition presents certain problems when dealing with a FAO that is not idempotent or continuous. Meanwhile the previous definition was based on the study of fixed points, without taking into account the environment of each point, as many applications demand, the new approach we propose now is more flexible, and at the end allows a more appropriate definition of the consistency of a FAO. It will be shown that under certain conditions our new proposal is equivalent to the previous definition of strict stability, but the new definition covers families of aggregation operators that are not strictly stable, but intuitively stable, and vice versa. In short, we will see that our new proposal fits much better the intuition of stability of a FAO. This reformulation of stability is based upon the concept of penalty function as a measure of proximity between a value and an array of values.
Description
UCM subjects
Unesco subjects
Keywords
Citation
[1] A. Amo, J. Montero, E. Molina, Representation of consistent recursive rules, Eur. J. Oper. Res. 130 (2001) 29–53.
[2] G. Beliakov, A. Pradera, T. Calvo, Aggregation Functions, a Guide to Practitioners, Springer Verlag, Berlin, 2007.
[3] G. Beliakov, M. Gagolewski, S. James, S. Pace, N. Pastorello, E. Thilliez, R. Vasa, Measuring traffic congestion: an approach based on learning weighted inequality, spread and aggregation indices from comparison data, Appl. Soft Comput. 67 (2018) 910–919.
[4] G. Beliakov, S. James, D. Gómez, J.T. Rodríguez, J. Montero, Learning stable weights for data of varying dimension, in: Proceedings of 8th International Summer School on Aggregation Operators AGOP, University of Silesia, Poland, 2015.
[5] G. Beliakov, D. Gómez, S. James, J. Montero, J.T. Rodríguez, Approaches to learning strictly-stable weights for data with missing values, Fuzzy Sets Syst. 325 (2017) 97–113.
[6] G. Beliakov, S. James, Stability of weighted penalty-based aggregation functions, Fuzzy Sets Syst. 226 (2013) 1–18.
[7] H. Bustince, G. Beliakov, G.P. Dimuro, B. Bedregal, R. Mesiar, On the definition of penalty functions in data aggregation, Fuzzy Sets Syst. 323 (2017) 1–18.
[8] H. Bustince, J. Fernández, R. Mesiar, J. Montero, R. Orduna, Overlap functions, Nonlinear Anal., Theory Methods Appl. 72 (3–4) (2010) 1488–1499.
[9] H. Bustince, M. Pagola, R. Mesiar, E. Hullermeier, F. Herrera, Grouping, overlap, and generalized bientropic functions for fuzzy modeling of pairwise comparisons, IEEE Trans. Fuzzy Syst. 20 (3) (2012) 405–415.
[10] T. Calvo, G. Mayor, J. Torrens, J. Suner, M. Mas, M. Carbonell, Generation of weighting triangles associated with aggregation functions, Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 8 (4) (2000) 417–451.
[11] T. Calvo, A. Kolesárová, M. Komorníková, R. Mesiar, Aggregation operators: properties, classes and construction methods, in: Aggregation Operators, in: Studies in Fuzziness and Soft Computing, vol. 97, 2002, pp. 3–104.
[12] T. Calvo, G. Beliakov, Aggregation functions based on penalties, Fuzzy Sets Syst. 161 (10) (2010) 1420–1436.
[13] V. Cutello, J. Montero, Hierarchical aggregation of OWA operators: basic measures and related computational problems, Uncertain. Fuzziness Knowl.-Based Syst. 3 (1995) 17–26.
[14] V. Cutello, J. Montero, Recursive connective rules, Int. J. Intell. Syst. 14 (1999) 3–20.
[15] J. Dujmovic, Aggregation operators and observable properties of human reasoning, Adv. Intell. Syst. Comput. 228 (2013) 5–16.
[16] J.J. Dujmovic, G.D. Tre, N. Singh, D. Tomasevich, R. Yokoohji, Soft computing models in online real estate, Studies in Fuzziness and Soft Computing 312 (2013) 77–91.
[17] J.J. Dujmovic, The problem of missing data in LSP aggregation, in: Communications in Computer and Information Science, in: Advances in Computational Intelligence, vol. 299, 2012, pp. 336–346.
[18] D. Gómez, K. Rojas, J. Montero, J.T. Rodríguez, G. Beliakov, Consistency and stability in aggregation operators: an application to missing data problems, Int. J. Comput. Intell. Syst. (2013) 595–604.
[19] D. Gómez, J. Montero, A discussion of aggregation functions, Kybernetika 40 (2004) 107–120.
[20] D. Gómez, J.T. Rodríguez, J. Montero, H. Bustince, E. Barrenechea, n-Dimensional overlap functions, Fuzzy Sets Syst. 287 (2016) 57–75.
[21] M. Grabisch, J. Marichal, R. Mesiar, E. Pap, Aggregation Functions, Cambridge University Press, Cambridge, 2009.
[22] S. Ilanko, A. Tucker, The use of negative penalty functions in solving partial differential equations, Int. J. Numer. Methods Biomed. Eng. 21 (3) (2005) 99–106.
[23] J. Montero, R. González del Campo, L. Garmendia, D. Gómez, J.T. Rodríguez, Computable aggregations, Inf. Sci. 460–461 (2018) 439–449.
[24] K. Rojas, D. Gómez, J.T. Rodríguez, J. Montero, Strict stability in aggregation operators, Fuzzy Sets Syst. 228 (2013) 44–63.
[25] K. Rojas, D. Gómez, J.T. Rodríguez, J. Montero, A. Valdivia, F. Paiva, Development of child’s home environment indexes based on consistent families of aggregation operators with prioritized hierarchical information, Fuzzy Sets Syst. 241 (2013) 41–60.
[26] A. Wojtowicz, P. Zywica, A. Stachowiak, K. Dyczkowski, Interval-valued aggregation as a tool to improve medical diagnosis, in: Proceedings of 8th International Summer School on Aggregation Operators, University of Silesia, Katowice, Poland, 2015, pp. 239–244.
[27] R.R. Yager, A. Rybalov, Noncommutative self-identity aggregation, Fuzzy Sets Syst. 85 (1997) 73–82.