Abstract
Grouping function is a special kind of aggregation function which measures the amount of evidence in favor of either of the two choices. Recently, complex fuzzy sets have been successfully used in many fields. This paper extends the concept of grouping functions to the complex-valued setting. We introduce the concepts of complex-valued grouping, complex-valued 0-grouping, complex-valued 1-grouping, and general complex-valued grouping functions. We present some interesting results and construction methods of general complex-valued grouping functions.
1. Introduction
In 2012, Bustince et al. [1] introduced the concept of grouping function as a special type of aggregation functions [2]. A grouping function measures the amount of evidence in favor of either of two choices in decision making. It plays an important role in many aspects of applications such as image processing [1, 3], classification [4, 5], and decision making [6, 7].
In this paper, we consider complex-valued grouping function, which is both a generation of real-valued grouping function and a special kind of complex fuzzy aggregation operator. In the literature, one can find many works on real-valued grouping functions. The concepts of general grouping functions [8] and interval-valued grouping functions [9, 10] have been proposed. Some properties incluing migrativity, homogeneity, idempotency, and distributivity of grouping functions have been studied [1, 11–14]. The multiplicative generators [15] and additive generators [16] of grouping functions have been investigated. (G, N)-implications [17] and QL-implications [18] derived from grouping functions have been constructed.
Meanwhile, we can also find several works on complex fuzzy aggregation operators and related concepts. In 2002, Ramot et al. [19, 20] introduced the concepts of complex fuzzy sets and complex fuzzy aggregation operators, which have been successfully used in signal processing [20–22], time series forecasting [23–25], and decision making [26, 27]. Distance and entropy measures of complex fuzzy sets and its extensions have been proposed [28–30]. Moreover, some new concepts such as orthogonality and rotational invariance have been presented for complex fuzzy sets and complex fuzzy aggregation operators [31–33].
Recently, Chen et al. [34] introduced the concept of complex-valued overlap function, which measures the overlapping degree between two objects with complex-valued information. In order to measure the amount of evidence in favor of either of two choices with complex-valued information, this paper extends traditional real-valued grouping functions to complex-valued grouping functions. As mentioned in [34], some features of complex fuzzy sets can lead to special properties for complex-valued overlap functions.
Both real-valued grouping functions and complex fuzzy aggregation operators have gained a rapid development both in application and theory. However, as far as we know, nowadays, there are no corresponding discussions to propose the complex-valued grouping functions. Therefore, in this paper, we introduce the concepts of complex-valued grouping functions. This paper is organized as follows. In Section 2, we recall the concepts of grouping functions. In Section 3, we introduce complex-valued grouping functions and their properties. In Section 4, we introduce construction methods of general complex-valued grouping functions. Conclusions are given in Section 5.
2. Preliminaries
In this section, we recall the concepts of bivariate grouping functions and n-dimensional grouping functions [1, 8, 12, 16].
2.1. Overlap Functions
Definition 1 (see [1]). A mapping is a grouping function if it is symmetric, nondecreasing, continuous, and has the following properties:(G1) if and only if (G2)if and only iforAs introduced in [16], a mapping is a 0-grouping function if we replace the property (G1) by the following: (G1’) without changing others.Similarly, a mapping is a 1-grouping function if we replace the property (G2) by the following: (G2’) without changing others.
Definition 2 (see [12]). An n-ary mapping is an -dimensional grouping function if it is commutative, nondecreasing, continuous, and has the following properties: if and only if for all if and only if there exists such that Analogously, an n-ary mapping is an n-dimensional 0-grouping function if we replace the property by the following: (Gn1’) If for all , then without changing others.An n-ary mapping is an n-dimensional 1-grouping function if we replace the property by the following: (Gn2’) If there exists such that , then without changing others.Based on the concepts of n-dimensional 0-grouping and 1-grouping functions, the general grouping functions is defined as follows.
Definition 3 (see [8]). A mapping is an -dimensional general grouping function if it is commutative, nondecreasing, continuous, and has the following properties: If then If there exists such that , then
3. N-Dimensional Complex-Valued Grouping Functions
Let , each is of the form , where , the amplitude term and the phase term .
We define n-dimensional complex-valued grouping functions.
Definition 4. An n-ary mapping is an -dimensional complex-valued grouping function if it is commutative, continuous, and has the following properties: if and only if for all if and only if there exists such that is amplitude monotonic in the first variate: whenSince is commutative, it is also amplitude monotonic in any other variate based on the third property . Obviously, these properties are analogous to those of Definition 1. When the domain is limited to [0, 1], it reduces to an -dimensional real-valued grouping function of Definition 2.
Example 1. Nevertheless, there exists mapping such that is a grouping function in the domain [0, 1] but not a complex-valued grouping function. The function given as follows:is a grouping function but not a complex-valued grouping function; for example, , then does not hold.
Traditional real-valued grouping functions are the dual notion of overlap functions. is an overlap function on [0, 1], and is a grouping function. However, this is not true for complex-valued overlap functions. For example, is a complex-valued overlap function on in [34], but is not a complex-valued grouping function.
Similarly, we introduce some types of grouping functions, such as n-dimensional complex-valued 0-overlap and 1-overlap grouping functions.
An n-ary mapping is an n-dimensional complex-valued 0-grouping function if we replace the property by the following: (Cgn1’) If for all , then without changing others.An n-ary mapping is an n-dimensional complex-valued 1-grouping function if we replace the property by the following: (Cgn2’) If there exists such that then without changing others.Based on these concepts, we define the concept of n-dimensional general complex-valued grouping functions.
Definition 5. An n-ary mapping is an -dimensional general complex-valued grouping function if it is commutative, continuous, and has the following properties: If for all , then If there exists such that then is amplitude monotonic in the first variate: when The relations between -dimensional complex-valued grouping functions, complex-valued 0-grouping functions, complex-valued 1-grouping functions, and general complex-valued grouping functions are given as follows.
Proposition 1. Let be an n-ary mapping, then(1)If it is an n-dimensional complex-valued grouping function, then it is an n-dimensional complex-valued 0-grouping and 1-grouping function(2)If it is an n-dimensional complex-valued 0-grouping (or 1-grouping) function, then it is also a general complex-valued grouping functionThis relation between complex-valued grouping functions is similar to that between interval-valued overlap functions [9].
Now, we give several examples to demonstrate their relations of complex-valued grouping functions.
Example 2. The binary function given byis a complex-valued overlap function.
Example 3. The binary function given byis a general complex-valued grouping function and complex-valued 1-grouping function, but neither a complex-valued grouping function nor a complex-valued 0-grouping function; for example, , then the property does not hold.
Example 4. The binary function given byis a general complex-valued grouping function and complex-valued 0-grouping function. However, is not a complex-valued 1-grouping function; for example, , then the property does not hold.
Negative operation (–) is closed on D but not closed on [0, 1]. Then, we have following property only for complex-valued function on D.
Definition 6. The n-ary function is symmetric with respect to the point 0, ifholds for any .
Example 5. The n-ary function given byis a complex-valued grouping function, which is symmetric with respect to the point 0.
4. Construction of General Complex-Valued Overlap Functions
Proposition 2. If an n-ary mapping is n-dimensional complex-valued grouping (0-grouping, 1-grouping, or general grouping) function which is expressed asthen the function is an n-dimensional grouping (0-grouping, 1-grouping, or general grouping) function on [0, 1].
Theorem 1. If the n-ary function is an n-dimensional 1-grouping function, the function satisfies the following properties:(i) is commutative(ii)There exists such that if and only if (iii) is continuousThen, the function defined by equation (7) is an n-dimensional complex-valued 1-grouping function.
Proof. It is immediate that is commutative, amplitude monotonic, and continuous. Now, we prove the properties and (Cgn2’). : If , then . Then, for all since is a 1-grouping function. Then, for all . : If for all , this means for all , and then since is a 1-grouping function. Then, . (Cgn2’): If there exists such that , i.e., and , then since is a 1-grouping function, and since satisfies (ii). Then, .
Corollary 1. If the n-ary function is an n-dimensional general grouping function, the function satisfies the following properties:(i) is commutative(ii)There exists such that if and only if (iii) is continuousThen, the function defined by equation (7) is an n-dimensional general complex-valued grouping function.
However, this method cannot obtain complex-valued grouping function. For example, we get from is a grouping function and from property (ii), but ; thus, we cannot get . So, we consider the construction of general complex-valued overlap functions. If the n-dimensional complex-valued function is defined by equation (7), then we can easily see that it is a key step to construct the function , which satisfies the condition (ii) of Corollary 1.
Now, we give some examples of bivariate functions satisfying the condition (ii) of Corollary 1.
Example 6. The n-ary function given bysatisfies the condition (ii) of Corollary 1.
The n-ary function given bysatisfies the condition (ii) of Corollary 1.
Based on these functions, we give the general complex-valued grouping functions.
The function given byis a general complex-valued grouping function.
The function given byis a general complex-valued grouping function.
Now, we consider the way of constructing new complex-valued grouping functions from some given complex-valued grouping functions. In the case of real-valued grouping functions, it is possible to use some aggregation operations to obtain a new grouping function from some given grouping functions. Unfortunately, this approach fails for complex fuzzy arithmetic aggregation because it does not satisfy the property of amplitude monotonicity [35]. This means the weighted sum cannot be used to construct new complex-valued grouping functions.
Example 7. From Examples 2 and 3, and are complex-valued general grouping functions. However, is not a complex-valued general grouping function since it does not satisfy . We give a example such that but ; let , , and , thenThus, .
However, it is possible to use product operation to obtain a new grouping function from some given grouping functions. The product of is defined informally by
Theorem 2. Let be two n-dimensional general complex-valued grouping functions, then th power of also is an n-dimensional general complex-valued grouping function.
Proof. It is immediate that is commutative and continuous. Now, we prove the properties , , and . : If for all , then and since are n-dimensional general complex-valued grouping functions. Then, . : If there exists such that , then since are n-dimensional general complex-valued grouping functions. Then, . : If , then and since are n-dimensional general complex-valued grouping function. Then, .Similarly, we can get the following result.
Theorem 3. Let be two n-dimensional general complex-valued 1-grouping functions, then their product also is an n-dimensional complex-valued 1-grouping function.
Proof. From Theorem 2 and the definition of n-dimensional complex-valued 1-grouping function, we only need to prove the following property: : If , then or . If , then for all since is an n-dimensional general complex-valued 1-grouping function. We have same result when .Now, we consider the power of complex-valued grouping function. First, for positive integers , the th power of is defined informally by
Theorem 4. Let be an n-dimensional general complex-valued grouping function, then th power of also is an n-dimensional general complex-valued grouping function.
Proof. It is immediate that is commutative and continuous. Now, we prove the properties , , and . : If for all , then since is an n-dimensional general complex-valued grouping function. Then, . : If there exists such that , then since is an n-dimensional general complex-valued grouping function. Then, . : If , then since is an n-dimensional general complex-valued grouping function. Then, .Similarly, we can get the following result.
Theorem 5. Let be an n-dimensional general complex-valued 1-grouping function, then th power of also is an n-dimensional complex-valued 1-grouping function.
Proof. From Theorem 4 and the definition of n-dimensional complex-valued 1-grouping function, we only need to prove the following property: : If , then . Then, for all since is an n-dimensional general complex-valued 1-grouping function
Remark 1. In the unit interval [0, 1], if and only if . However, it is not true for the complex unit disk since . We cannot establish a theorem similar to Theorem 2 or Theorem 4 for n-dimensional complex-valued grouping (or 0-grouping) function.
5. Conclusions
This paper introduced the concepts of complex-valued grouping, complex-valued 0-grouping, complex-valued 1-grouping, and general complex-valued grouping functions. Then, we presented some construction methods for general complex-valued grouping functions. Our method includes the construction of a general real-valued grouping function and a continuous, commutative function satisfying the following property:(i)There exists such that if and only if
Of course, the application and properties of complex-valued overlap/grouping functions need further investigation.
Data Availability
No data were used to support this study.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This research was funded by the National Science Foundation of China under Grant no. 62006168 and Zhejiang Provincial Natural Science Foundation of China under Grant no. LQ21A010001.