Abstract
Four different types of convolutions of aggregation functions (the upper, the lower, the super-, and the sub-convolution) are examined in the setting of both sub- and super-decomposition integrals defined on a finite space. Examples of the results of the paper are provided. As a by-product, the super-additive transformation of sub-decomposition integrals and the sub-additive transformation of super-decomposition integrals are fully characterized. Possible applications are indicated.
MSC:
28B15; 28E10; 91B06
1. Introduction
One may notice that the concept of aggregation functions plays an important role in the decision theory, and the concept of convolution is important in the classical analysis, but also in probability, acoustics, image processing, computer vision, etc. Recall that convolution is a binary operation acting on functions, mostly on n-dimensional real functions. Note that aggregation functions are special n-dimensional functions, and thus, it is no surprise that these two concepts were combined and convolution was introduced for the framework of aggregation functions; for further reference, see, [1]. The mentioned paper introduced four different types of convolutions, namely, the upper convolution, the lower convolution, the super-convolution, and the sub-convolution.
Standard convolutions usually deal with Riemann (or Lebesgue) integral. Inspired by convolutions of aggregation functions proposed in [1], in this paper, we apply these convolutions in the setting of sub-decomposition integrals [2] and super-decomposition integrals [3], a special class of aggregation functions that includes many well-known non-linear integrals, such as the Choquet integral [4], the Shilkret integral [5], the PAN integral [6,7], the concave integral [8], or the convex integral [3]. Note that these integrals contribute to the basics of set-valued analysis, see also, e.g., [9,10]. As a by-product, we obtain the super- and sub-additive transformations [11] of sub-decomposition and super-decomposition integrals, respectively.
The rest of the paper is organized as follows. Section 2 contains some preliminaries and definitions used in the paper. Section 3 examines the upper convolution and super-convolution of sub-decomposition integrals. This section also solves the problem of super-additive transformation of sub-decomposition integrals. Section 4 examines other convolutions for sub-decomposition integrals and analogous results for super-decomposition integrals. The last section, Section 5, concludes the paper with some remarks.
Recall that the upper convolution of sub-collection integrals was examined in the conference paper [12], and this paper extends these results.
2. Preliminaries
Let X be a finite non-empty set referred to as a space. Without loss of generality, we may assume that the space X is of the form for some natural number that is fixed throughout the paper.
A (non-negative) function is a map . Any function f is in one-to-one correspondence with a vector of its values . Thus, vectors from are referred to as functions and are denoted by bold lower-case letters , etc. The coordinate of the vector is denoted by the symbol , for . An indicator function of a set is denoted by .
A monotone measure is a map such that is grounded, i.e., , and is non-decreasing with respect to set inclusion, i.e., the inequality holds for . The set of all monotone measures is denoted by . A monotone measure is called an additive measure if, and only if, is additive, i.e., for any disjoint sets . The set of all additive measures is denoted by .
The monograph [6] revisited and revised the terminology used in the generalized measure theory. Note that the term ‘monotone measure’ is sometimes replaced in the literature with the term ‘fuzzy measure’. As remarked in the Preface of the mentioned monograph, monotone measures may not be continuous as in the case of fuzzy measures, and their primary characteristic is the monotonicity, hence the name.
A non-empty set is called a collection. A non-empty set of collections is called a decomposition system. The set of all collections is denoted by , and the set of all decomposition systems by .
Definition 1.
A sub-collection integral [13] with respect to a collection and monotone measure is an operator given by
for any function . A super-collection integral [13] with respect to a collection and monotone measure is an operator given by
for any function (if necessary, the standard convention is considered).
Definition 2.
A sub-decomposition integral [2] with respect to a decomposition system and a monotone measure is an operator given by
for any function . A super-decomposition integral [3] with respect to a decomposition system and a monotone measure is an operator given by
for any function .
Note that sub-collection and sub-decomposition integrals are aggregation functions. An aggregation function is an operator such that and for all such that . In this setting, super-collection and super-decomposition integrals are not aggregation functions, in general, because the value of ∞ can be attained for some inputs. As an example, take the space , a collection (or the decomposition system ), and compute the value of the corresponding integral of the function .
Definition 3.
Let be two aggregation functions. Their upper convolution is an aggregation function given by
for all ; their lower convolution is an aggregation function given by
for all ; their super convolution is an aggregation function given by
for all (if defined); and their sub-convolution is an aggregation function given by
for all . These definitions are introduced and examined in [1].
Notice that the super convolution may not be well defined for some aggregation functions. Consider, for example, one-dimensional aggregation functions and for all , in which case
i.e., is not an aggregation function.
3. Upper Convolution and Super-Convolution of Sub-Decomposition Integrals
In the conference paper [12], the upper convolution of collection integrals were examined. The following results were obtained: Let be collections and let be monotone measures. Then
In the spirit of the first equality, we obtain the following result for decomposition integrals.
Proposition 1.
Let be two decomposition systems and let be a monotone measure. Then
where is a decomposition system .
Proof.
Let be a function. Then
i.e., there exists such that and
Now, there exist collections and such that
and thus, a sub-decomposition of and a sub-decomposition of such that
Note that by summing these two sub-decompositions, we obtain a sub-decomposition of from the collection , i.e.,
Thus, following that is arbitrary, . Now, we prove the same inequalities, but with a reversed inequality sign. Let . Note that there exists a collection (and thus, collections , ) such that
From this, the existence of coefficients for such that is a sub-decomposition of with
is guaranteed. Now, set for and
from which
Then, consider , and therefore is a sub-decomposition of . Thus
Because, again, was arbitrary, . Combining both proved inequalities, we obtain the desired result. □
Remark 1.
The decomposition system from the previous proposition is denoted by . Note that the set of all decomposition systems with the operation ⊎ forms an Abelian semigroup with annihilator .
Example 1.
Let be a monotone measure. Choose a decomposition system , i.e., is the Shilkret integral. Then choose , i.e., is equivalent to the Lebesgue integral for additive measures . Then, for example, when , one obtains
After some algebraic manipulations, one can find that
Note that this equality is true for an arbitrary space X.
Following the result [1] of Theorem 5.2, we obtain the following corollary.
Corollary 1.
A sub-decomposition integral is super additive for all monotone measures if and only if .
Example 2.
It is easy to notice that singleton decomposition systems , i.e., all sub-collections integrals, are such that . In fact, if we consider only minimal decomposition systems, then these are the only ones that generate a super-additive sub-decomposition integral (with the monotone measure not being fixed).
Now, we can examine the super-convolution of sub-decomposition integrals. Let us start with the super self-convolution.
Proposition 2.
Let be a decomposition system and let be a monotone measure. Then
where is a collection given by
Proof.
From the definition of super self-convolution, it can be noted that it is the same as the limit of the upper self-convolutions applied consecutively over and over. The ‘greatest’ collection that will appear is the collection . All other collections in the decomposition system are subsets of . From the properties of sub-decomposition integrals, the smaller collections can be ignored, leaving only the collection in the decomposition system, i.e., it will be the same as the sub-collection integral with respect to the collection . □
Note that the corollary of this result, based on the proof of [1] Theorem 5.4, is as follows.
Corollary 2.
Let be a decomposition system and let be a monotone measure. The super-additive transformation of a sub-decomposition integral is the sub-collection integral , where is a collection given by
Now we examine the super convolution of two different sub-decomposition integrals with respect to the same monotone measure.
Proposition 3.
Let be two decomposition systems and let be a monotone measure. Then
where is a collection given by
Proof.
This follows directly from [1] Theorem 4.4. □
Example 3.
If we consider decomposition systems and from Example 1 of this paper, we can compute super-additive transformations of sub-decomposition integrals and (where is an arbitrary monotone measure). In the first case, we obtain the concave integral (i.e., the sub-collection integral with respect to a collection ), and the second one stays unchanged. Additionally, is the concave integral [8].
4. Other Convolutions of Decomposition Integrals
The situation with the lower convolution and sub-decomposition integrals is not so easy. The upper convolution (and also the super-convolution) is closed for sub-decomposition integrals (i.e., the result is again a sub-decomposition integral). In the case of the lower convolution, this is no longer the case. See the following example, where we consider two collections integrals (i.e., decomposition integrals with respect to a singleton decomposition system).
Example 4.
Consider two sub-collection integrals on the space with respect to collections and (both of these integrals are so-called chain integrals, see, e.g., [13]). Let be a monotone measure and, for the sake of simplification, we use the following notation: , , and . The value of these integrals is given by
for the first one, and
for the second one. For the lower convolution of these two integrals we obtain that
which implies that . There is no decomposition integral (with μ being an arbitrary monotone measure).
Remark 2.
Note that the previous example (in the setting of the example) also implies that .
Similar results, as in the case of the lower convolution and the super convolution for sub-decomposition integrals, can be obtained for the upper convolution and the sub-convolution for super-decomposition integrals. We just need to make sure that we work with those super-decomposition integrals that are aggregation functions, and we refer to those as the well-defined super-decomposition integrals.
Definition 4.
Let be a decomposition system. A super-decomposition integral with respect to the decomposition system is called well-defined if and only if
for all functions and all monotone measures .
We assume that the super-decomposition integrals are well defined for the rest of the paper. Because the proofs of the following statements are completely analogous to proofs in the previous section, we omit them.
Proposition 4.
Let be two decomposition systems and let be a monotone measure. Then
Corollary 3.
A super-decomposition integral is sub-additive for all monotone measures if and only if .
Remark 3.
Note that the same decomposition systems generating super-additive sub-decomposition integrals generate sub-additive super-additive integrals and vice versa.
Proposition 5.
Let be a decomposition system and let be a monotone measure. Then
where is a collection given by
Corollary 4.
Let be a decomposition system, and let be a monotone measure. The sub-additive transformation of a super-decomposition integral is the super-collection integral , where is a collection given by
Proposition 6.
Let be two decomposition systems, and let be a monotone measure. Then
where is a collection given by
5. Concluding Remarks
In the paper, four different types of convolution of aggregation functions in the setting of decomposition integrals, i.e., both the sub-decomposition and super-decomposition integrals, were examined. We solved the problem of the upper convolution and super convolution of sub-decomposition integrals with respect to the same monotone measure and, analogously, the lower convolution and sub-convolution of super-decomposition integrals with respect to the same monotone measure.
Some questions still remain open, both theoretical and practical. For example, is it possible to obtain a result similar to
but replacing the sub-collection integrals with sub-decomposition integrals? Or, is it possible to characterize those decomposition systems for which the lower convolution of sub-decomposition integrals is again a sub-decomposition integral (in the spirit of Example 4)? Another interesting question is related to the fact that some decomposition integrals are extensions of the Lebesgue integral (i.e., for additive monotone measures, they coincide with the Lebesgue integral); for more details, see [14]. Now, we have the problem of how our proposed convolutions are related to the standard convolution based on the Lebesgue integral.
Though our work is purely theoretical, we expect several applications of our results in all domains, where particular decomposition integrals and their generalizations were successfully applied. Here, we recall, among others, multi-criteria decision support, image processing, fuzzy ruler-based classification, etc., where generalizations of the Choquet integral were considered; see, for example, [15,16,17,18]. In our further research, we will focus on these mentioned problems and possible applications. More, we will aim to focus on algorithms for faster processing of our theoretical results. Observe that we have already proposed some algorithms for the computation of decomposition integrals in [13], where we have also shown that this is not an easy task.
Funding
The author was supported by the Slovak Research and Development Agency under the contract no. APVV-17-0066 and no. APVV-18-0052. In addition, the support of the grant VEGA 1/0006/19 is kindly announced.
Conflicts of Interest
The author declares no conflict of interest.
References
- Mesiar, R.; Šeliga, A.; Šipošová, A.; Širxaxň, J. Convolution of aggregation functions. Int. J. Gen. Syst. 2020, 49, 747–759. [Google Scholar] [CrossRef]
- Even, Y.; Lehrer, E. Decomposition-integral: Unifying Choquet and the concave integrals. Econ. Theory 2014, 56, 33–58. [Google Scholar] [CrossRef] [Green Version]
- Mesiar, R.; Li, J.; Pap, E. Superdecomposition integrals. Fuzzy Sets Syst. 2015, 259, 3–11. [Google Scholar] [CrossRef]
- Choquet, G. Theory of capacities. Ann. L’Institut Fourier 1954, 5, 131–295. [Google Scholar] [CrossRef] [Green Version]
- Shilkret, N. Maxitive measure and integration. Indag. Math. 1971, 33, 109–116. [Google Scholar] [CrossRef] [Green Version]
- Wang, Z.; Klir, G.J. Generalized Measure Theory; IFSR International Series on Systems Science and Engineering; Springer: Boston, MA, USA, 2009; Volume 25. [Google Scholar] [CrossRef]
- Yang, Q. The pan-integral on the fuzzy measure space. Fuzzy Math. 1985, 3, 107–114. (In Chinese) [Google Scholar]
- Lehrer, E. A new integral for capacities. Econ. Theory 2009, 39, 157–176. [Google Scholar] [CrossRef]
- Sambucini, A.R. The Choquet integral with respect to fuzzy measures and applications. Math. Slovaca 2017, 67, 1427–1450. [Google Scholar] [CrossRef] [Green Version]
- Candeloro, D.; Mesiar, R.; Sambucini, A.R. A special class of fuzzy measures: Choquet integral and applications. Fuzzy Sets Syst. 2019, 355, 83–99. [Google Scholar] [CrossRef] [Green Version]
- Greco, S.; Mesiar, R.; Rindone, F.; Šipeky, L. Superadditive and subadditive transformations of integrals and aggregation functions. Fuzzy Sets Syst. 2016, 291, 40–53. [Google Scholar] [CrossRef] [Green Version]
- Šeliga, A. Some remarks on convolution of collection integrals. In Joint Proceedings of the 19th World Congress of the International Fuzzy Systems Association (IFSA), the 12th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT), and the 11th International Summer School on Aggregation Operators (AGOP); Atlantis Studies in Uncertainty Modelling: Dordrecht, The Netherlands, 2021; Volume 3, pp. 575–579. [Google Scholar] [CrossRef]
- Šeliga, A. Decomposition integral without alternatives, its equivalence to Lebesgue integral, and computational algorithms. J. Autom. Mob. Robot. Intell. Syst. 2019, 13, 41–48. [Google Scholar] [CrossRef]
- Li, J.; Mesiar, R.; Ouyang, Y.; Šeliga, A. Characterization of decomposition integrals extending Lebesgue integral. Fuzzy Sets Syst. 2022, 430, 56–68. [Google Scholar] [CrossRef]
- Dias, C.A.; Bueon, J.C.S.; Borges, E.N.; Botelho, S.S.C.; Dimuro, G.P.; Lucca, G.; Fernández, J.; Bustince, H.; Drews, P.L.J., Jr. Using the Choquet integral in the pooling layer in deep learning networks. In Fuzzy Information Processing, NAFIPS 2018. Communications in Computer and Information Science; Springer: Cham, Switzerland, 2018; Volume 831. [Google Scholar] [CrossRef]
- Lucca, G.; Borges, E.N.; Santos, H.; Dimuro, G.P.; Asmus, T.C.; Sanz, J.A.; Bustince, H. A fuzzy reasoning method based on ensembles of generalizations of the Choquet integral. In Intelligent Systems, BRACIS 2020. Lecture Notes in Computer Science; Springer: Cham, Switzerland, 2020; Volume 12320. [Google Scholar] [CrossRef]
- Lucca, G.; Sanz, J.A.; Dimuro, G.P.; Borges, E.N.; Santos, H.; Bustince, H. Analyzing the performance of different fuzzy measures with generalizations of the Choquet integral in classification problems. In Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, New Orleans, LA, USA, 23–26 June 2019; pp. 1–6. [Google Scholar] [CrossRef]
- Bueno, J.C.S.; Dias, C.A.; Dimuro, G.P.; Santos, H.S.; Borges, E.N.; Lucca, G.; Bustince, H. Aggregation functions based on the Choquet integral applied to image resizing. In Proceedings of the 11th Conference of the European Society for Fuzzy Logic and Technology, EUSFLAT 2019, Prague, Czech Republic, 9–13 September 2019; Atlantis Press: Dordrecht, The Netherlands, 2019; pp. 460–466. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).