Ferrero Jaurrieta, MikelPaiva, RuiCruz, AndersonBedregal, BenjaminZhang, XiaohongTakáč, ZdenkoLópez Molina, CarlosBustince Sola, Humberto2024-10-012024-10-012024Ferrero-Jaurrieta, M., Paiva, R., Cruz, A., Bedregal, B., Zhang, X., Takac, Z., López-Molina, C., Bustince, H. (2024) Reduction of complexity using generators of pseudo-overlap and pseudo-grouping functions. Fuzzy Sets and Systems, 490, 1-20. https://doi.org/10.1016/j.fss.2024.1090250165-011410.1016/j.fss.2024.109025https://academica-e.unavarra.es/handle/2454/51890Overlap and grouping functions can be used to measure events in which we must consider either the maximum or the minimum lack of knowledge. The commutativity of overlap and grouping functions can be dropped out to introduce the notions of pseudo-overlap and pseudo-grouping functions, respectively. These functions can be applied in problems where distinct orders of their arguments yield different values, i.e., in non-symmetric contexts. Intending to reduce the complexity of pseudo-overlap and pseudo-grouping functions, we propose new construction methods for these functions from generalized concepts of additive and multiplicative generators. We investigate the isomorphism between these families of functions. Finally, we apply these functions in an illustrative problem using them in a time series prediction combined model using the IOWA operator to evidence that using these generators and functions implies better performance.application/pdfeng© 2024 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND licensePseudo-overlapPseudo-groupingArchimedean functionsPseudo-additive generatorPseudo-multiplicative generatorTime series predictioninfo:eu-repo/semantics/article2024-10-01info:eu-repo/semantics/openAccess