Multimode function multistability of Cohen-Grossberg neural networks with Gaussian activation functions and mixed time delays

1.   Introduction

Pawlak first proposed the rough set theory^[1], which is the basis for testing the granularity of knowledge^[2]. In recent years, many models related to rough sets have emerged, such as the rough set theory based on fuzzy covering^[3,4,5]. The fuzzy set theory was first proposed by Zadeh^[6]. Since then, theories and applications related to fuzzy sets^[7] have also been widely studied, such as fuzzy soft sets^[8], feature selection of fuzzy sets^[9], outlier detection of fuzzy sets^[10,11,12], decision application of fuzzy sets, etc.^{[13,14,15,16]}. The relation and difference between fuzzy set theory and rough set theory is also a hot topic. An important component of this research is the roughness of the fuzzy set. Dubois et al first defined the concepts of the rough fuzzy set and fuzzy rough set^[17]. The roughness measurement method of fuzzy sets proposed by Banerjee et al really makes the relationship between fuzzy sets and rough sets closer^[18], and it has laid a solid foundation for subsequent researchers to explore the roughness measurement of fuzzy sets by applying fuzzy entropy^[19], from the perspective of distance^[20] and based on soft relation^[21]. Li first mentioned the concept of disturbed fuzzy sets^[22]. Liu and Chen formally described the concept of disturbed fuzzy sets^[23]. Chen and Wu extended the tautology of fuzzy sets^[24] to interval-valued fuzzy sets^[25], intuitionistic fuzzy sets^[26], and disturb fuzzy sets^[27], respectively. It is found that the same result can be obtained only when the disturbation fuzzy set is generalized to the ordinary fuzzy set. Therefore, the disturbation fuzzy set shows excellent properties in the operation and has extensive research value, which is not found in any kind of fuzzy set, including the interval valued fuzzy set. Subsequently, Han et al. put forward the concept of disturbed fuzzy rough sets and the roughness measure of disturbed fuzzy sets^[28]. It further enriches the theoretical basis of combining the fuzzy set and the rough set. However, there are few researches on the roughness measurement of the disturbance fuzzy set, and the application of disturbance fuzzy set roughness measurement is even less.

Upper and lower approximations of fuzzy sets are two important aspects in the study of fuzzy rough sets theory^[29]. In this paper, there are two limitations: On the one hand, it is found in the exploration that the approximation of $\tilde M \cup \tilde N$ generally cannot be obtained by the approximation of $\tilde M$ and $\tilde N$, and these properties are the result of logical forms defined by assumptions in the domain of discussion expressed in an approximate manner^[30]. Therefore they bring inconvenience and difficulty to the research in many fields, including the roughness measurement of disturbed fuzzy sets. On the other hand, when data analysis, data mining, decision support system, and machine learning are carried out, the datasets are usually huge, in order to solve the inconvenience caused by too large datasets. So in this paper, first, the related concepts of the rough set, disturbation fuzzy set, and roughness measurement are introduced. Second, by introducing two new operators designed by Zhang et al. and associating them with the disturbation fuzzy set, the limitation that the execution subset is not the equality of the set and cannot be studied quantitatively is effectively solved. Finally, the roughness measure of the disturbation fuzzy set is studied quantitatively, and its boundedness is obtained. Therefore, it is expected that using the boundary of roughness measure of the disturbing fuzzy set proved in this paper can effectively avoid the computing space outside the boundary and improve the computing efficiency.

2.   Preparatory knowledge

In this section, some basic concepts related to approximate space, upper and lower approximations of fuzzy sets, the roughness measure of fuzzy sets, and disturbation fuzzy sets are given.

Definition 2.1 (Approximate space)^[1] The nonempty set $U$ is called the discourse domain, $S$ is the equivalence relation on $U$, and $\left({U, S} \right)$ is called an approximate space.

Definition 2.2 (Upper approximation, lower approximation, and boundary field)^[1] $\left({U, S} \right)$ is the known approximation space, $M \subseteq U$, and in the approximation space ${y_1}, {y_2}, \cdots, {y_k}$ represents an equivalence class with respect to $S$. $\bar S\left(M \right)$ is the upper approximation of $M$ and $\underline{S} \left(M \right)$ is the lower approximation of $M$. The boundary area $B{N_S}$ is represented by

while

Definition 2.3. (Upper and lower approximations of fuzzy sets) ^[1] In $U$, the upper and lower approximations of the fuzzy set $M$ are defined as: $U/S \to \left[{0, 1} \right]$ and

Definition 2.4. (Roughness measure of fuzzy set)^[1] $\left({U, S} \right)$ is the known approximation space, $M \subseteq U$, and the $M$ roughness measure in $\left({U, S} \right)$ is

where the set $\left| * \right|$ represents the cardinality of $*$.

Yao^[2] once proposed that the roughness measure of a fuzzy set can be understood as the distance between the upper approximation and the lower approximation of the fuzzy set. If $M$: $U \to \left[{0, 1} \right]$ is in $U$, $M\left(y \right), y \in U$ gives $y$ membership in $M$.

Definition 2.5. (Disturbed fuzzy sets)^[23] If

and

call $\tilde P$ a disturbed fuzzy set on $Z$, then all disturbed fuzzy sets on the discourse domain $U$ are denoted as $\tilde E\left(U \right)$.

3.   Roughness of the disturbance fuzzy set

Based on the concepts of upper approximation and lower approximation, this section introduces the roughness measure formula of the disturbed fuzzy set, the operation relations of upper approximation, and lower approximation, and the key properties of roughness measure of the disturbed fuzzy set.

Definition 3.1. (Operation of disturbed fuzzy sets)^[28] Let

the interval corresponding to $\left({{\mu _\alpha }, {\mu _\beta }} \right)$ is

for all

the operation on $\omega$ is defined as

Definition 3.2. (Relation of disturbed fuzzy sets)^[28] The relationship between $\mu$ and $\nu$ is defined as

otherwise, we call it incomparable and denote by $U(\mu, \nu)$.

Obviously, when $(\omega, \leq)$, $\overline{0} = (0, 1)$ and $\overline{1} = (1, 0)$ are the minimum and maximum elements on $\omega$, respectively.

Definition 3.3. (Upper and lower approximations of disturbed fuzzy sets)^[28] Let $\mu, \nu$ be the two given parameters,

and the $\left({U, S} \right)$ be the approximate space, defining the upper and lower approximations of a disturbed fuzzy set. The $\mu -$ cut sets and $\nu -$ cut sets of $\underline{S} \left({\tilde M} \right)$ and $\bar S\left({\tilde M} \right)$ are

where, ${\left(\underline{S} {\left({\tilde M} \right)} \right)_\mu }$ and ${\left({\bar S\left({\tilde M} \right)} \right)_\nu }$ can be regarded as the sets of objects with $\mu$ and $\nu$ as the minimum membership degrees in the disturbance fuzzy set $\tilde M$.

Definition 3.4. (Roughness of disturbed fuzzy set)^[28] Let $\left({U, S} \right)$ be the approximate space,

then the roughness of the disturbed fuzzy set $\tilde M$ on $U$ in accordance with parameter $\mu, \nu$ is

Han et al. introduced several key properties of this roughness measure^[28].

Proposition 3.1. (Disturbation of upper and lower approximation of fuzzy sets)^[28] Let $\mu, \nu$ be two given parameters,

and let ${\left(\underline{S}{\left({\tilde M} \right)} \right)_\mu }$ and ${\left({\bar S\left({\tilde M} \right)} \right)_\nu }$ be the $\mu -$ cut sets and $\nu -$ cut sets of the upper and lower approximations of the disturbed fuzzy set $\underline{S} \left({\tilde M} \right)$ and $\bar S\left({\tilde M} \right)$, where

Property 3.1. For disturbed fuzzy set $\tilde M, \tilde N$, there is^[28]

4.   Determine the increment and indeterminate decrement operators

The pioneering study of fuzzy sets^[1] derived as (3.8) and (3.9) in Proposition 3.1, which carry out the property that subsets are not equal sets, hindered the quantitative study of fuzzy sets. Because of this difficulty, Zhang et al. designed two new operators^[31]. In this section, the new operator proposed by Zhang et al. is fully associated with the disturbed fuzzy set so as to effectively avoid the bad influence of this property in the roughness measurement process of the disturbed fuzzy set. The roughness measure of the disturbed fuzzy set can be studied quantitatively.

Definition 4.1. (Determine the increment operator)^[31] Let the discourse domain be $U, S$, the equivalence class on $U$, $P, Q \subseteq U$, when $P$ is extended by $Q\left({i.e., \ P \cup Q} \right)$,

defining

and ${l_P}\left(p \right) \subseteq Q$ is called the definite increment of $P$, where

Definition 4.2. (Uncertain decrement operator)^[31] Let the discourse domain be $U$, $S$ the equivalence class on $U$, $P, Q \subseteq U$, when $P$ is cut by $Q\left({i.e., \ P \cap Q} \right)$,

defining

and

which is called the uncertainty decrement of $P$, where

Property 4.1. ^[31] $P, Q \subseteq U$, so

Property 4.2. ^[31]

Property 4.3. ^[31]

Theorem 4.1. Let $\tilde M$ and $\tilde N$ be two disturbed fuzzy sets in the discourse domain $U$. Parameters $\mu, \nu$ satisfy $0 < \nu \le \mu \le 1$, while \underline{X}${_{{{\tilde M}_\mu }}}\left({{{\tilde N}_\mu }} \right)$, ${\bar X_{{{\tilde M}_\nu }}}\left({{{\tilde N}_\nu }} \right)$, \underline{X}${_{{{\tilde N}_\mu }}}\left({{{\tilde M}_\mu }} \right)$, and ${\bar X_{{{\tilde N}_\nu }}}\left({{{\tilde M}_\nu }} \right)$ are, respectively, ${\tilde M_\mu }$, ${\tilde N_\mu }$ determines the increment and ${\tilde M_\nu }$, and the uncertainty of ${\tilde N_\nu }$ decreases so we can get

Property 4.4. For disturbed fuzzy sets $\tilde M$ and $\tilde N$,

5.   The boundary of the correlation results of the roughness measure of the perturbation fuzzy set

When calculating the roughness measurement of disturbed fuzzy sets, the datasets of many programs are huge and the measurement is very complicated and cumbersome work, which requires a lot of manpower and material resources. Therefore, this section presents the boundaries of some results necessary for the roughness measurement of disturbed fuzzy sets. Understanding the boundaries of these results before operation can greatly improve work efficiency. It has very important practical significance.

Theorem 5.1. The upper bound of the roughness measure $\mathop {\tilde \rho }\nolimits_{\tilde M \cup \tilde N}^{\tilde \mu, \tilde \nu }$ of the disturbed fuzzy sets $\tilde M$ and $\tilde N$ in the discourse domain $U$ is

with respect to parameter $\mu, \nu$, satisfying $0 < \nu \le \mu \le 1$.

Proof. From (3.7) in Proposition 3.1 and the fundamental properties of sets, we can get

if

Thus

so, by Definition 3.4, we get

□

Theorem 5.2. The upper bound of the roughness measure $\mathop {\tilde \rho }\nolimits_{\tilde M \cup \tilde N}^{\tilde \mu, \tilde \nu }$ of the disturbed fuzzy sets $\tilde M$ and $\tilde N$ in the discourse domain $U$ is

with respect to parameter $\mu, \nu$, satisfying $0 < \nu \le \mu \le 1$ and

Proof. From (3.8) in Proposition 3.1 and the fundamental properties of sets, we can get

Also, according to (3.10) in Proposition 3.1,

In other words, we have

so we can get

Next, according to (3.9) in Proposition 3.1, it is obtained

According to Definition 3.4, we can get

Therefore, to sum up,

when

□

Remark 5.1. The bounds of Theorem 5.1 depend on roughness measures of the disturbed fuzzy sets $\tilde M$ and $\tilde N$, and the bounds of Theorem 5.2 depend on roughness measures of the disturbed fuzzy sets $\tilde M$ and $\tilde N$ as well as ${\left(\underline{S} {\left({\tilde M \cup \tilde N} \right)} \right)_\mu }$ and ${\left({\bar S\left({\tilde M \cap \tilde N} \right)} \right)_\nu }$.

Theorem 5.3. The lower bound of the disturbed fuzzy sets $\tilde M$ and $\tilde N$ in the discourse domain $U$ for the roughness measure $\mathop {\tilde \rho }\nolimits_{\tilde M \cup \tilde N}^{\tilde \mu, \tilde \nu }$ with respect to parameter $\mu, \nu$ is

which satisfies $0 < \nu \le \mu \le 1$, and

Proof. From (4.11) in Property 4.4 and the fundamental properties of sets, it is obtained that

We can obtain

and

According to Definition 3.4 and

we can get

so

Likewise,

we can get

thus,

To sum up,

when

□

Theorem 5.4. The lower bound of the disturbed fuzzy sets $\tilde M$ and $\tilde N$ in the discourse domain $U$ for the roughness measure $\mathop {\tilde \rho }\nolimits_{\tilde M \cap \tilde N}^{\tilde \mu, \tilde \nu }$ with respect to parameter $\mu, \nu$ is

which satisfies $0 < \nu \le \mu \le 1$, and

Proof. From (4.12) in Property 4.4 and the fundamental properties of sets, it is obtained that

if

we can get

According to Definition 3.4 and

we can get

Therefore, define

so

Likewise, for

define

so

Thus, to sum up

when

□

Remark 5.2. The lower bound of $\mathop {\tilde \rho }\nolimits_{\tilde M \cap \tilde N}^{\tilde \mu, \tilde \nu }$ is different from the upper bound of $\mathop {\tilde \rho }\nolimits_{\tilde M \cap \tilde N}^{\tilde \mu, \tilde \nu }$, and the roughness measure depends not only on the disturbation fuzzy sets $\tilde M$ and $\tilde N$, but also on $\left| {{{\left({\bar S\left({\tilde M} \right)} \right)}_\nu }} \right|, \left| {{{\left({\bar S\left({\tilde N} \right)} \right)}_\nu }} \right|, \left| {{{\left(\underline{S} {\left({\tilde M} \right)} \right)}_\mu }} \right|, \left| {{{\left(\underline{S} {\left({\tilde N} \right)} \right)}_\mu }} \right|$, and $\left| {{{\bar X}_{{{\tilde M}_\nu }}}\left({{{\tilde N}_\nu }} \right)} \right|$.

Remark 5.3. In the study of the disturbed fuzzy set, it is fully understood that the roughness measure of the disturbed fuzzy set is bounded, and often roughness comparison can be made by roughly calculating the roughness measure limit of the disturbed fuzzy set, which can greatly reduce the calculation amount.

6.   Practical applications

In the previous section, it has been proved that the roughness measure of perturbed fuzzy sets is bounded, but the bound of the roughness measure of disturbed fuzzy sets can be fully applied in practical problems. Next, the superiority of the theory proposed in this paper is demonstrated more clearly through a practical application of grouping different students in a competition, as shown in Tables 1–5.

Example 6.1. Due to receiving the notice that our province will soon hold a student learning competition to test the learning ability of two subjects of mathematics and Chinese, the school will send 6 students to participate in the competition. It is known that each student's ability level assessment of mathematics and Chinese constitutes a disturbance fuzzy set. The school will formulate two combinations, respectively,

If you want to know which combination is more likely to win, set parameter

(in real life, people usually think that 60 is a passing grade on a 100-point scale, and the parameter selection of different practical questions will be different). Table 1 is the assessment table of students' mathematical and language ability levels. The mathematics of disturbed fuzzy sets and the language of disturbed fuzzy sets are represented by $\tilde M$ and $\tilde N$, respectively.

So, according to Definition 3.4 and Tables 2 and 4,

From Theorems 5.1–5.4, it follows

and to sum up,

Obviously, the roughness of $B$ classification is smaller.

7.   Comparative analysis

If the traditional disturbation fuzzy set roughness measure calculation method is

we need to calculate the number of equivalence classes after the intersection of ${\left(\underline{S}{\left({\tilde M} \right)} \right)_\mu }$ and ${\left(\underline{S}{\left({\tilde N} \right)} \right)_\mu }$.

In Tables 3 and 5, the approximate values of the mathematical and verbal intersection of the disturbed fuzzy set caused by $A$ classification and $B$ classification are listed, respectively. It can be seen that the traditional method is more complicated to calculate. However, it can be seen from the example that using the method proposed in this paper to avoid complex calculation can effectively improve the work efficiency. This paper only lists 2 classification methods for 6 students. In practical problems, there may be tens of thousands of students' classification methods, etc. Therefore, when the sample size is large, the roughness measurement boundary of the disturbation fuzzy set proposed in this paper will greatly reduce the workload in operation. In practical problems with large datasets, such as when we need to do data mining, bioinformatics, cybersecurity, natural language processing, etc., the sample size is often huge. Therefore, it is usually better to determine the range of roughness first and then calculate in a small range.

8.   Conclusions

First, this work effectively solves the problem that the execution subsets are not equal sets, which hindrances the quantitative study of disturbed fuzzy sets.

Second, through quantitative research, the new properties of the disturbation fuzzy set operation and the boundary of the roughness of the disturbation fuzzy set are established effectively, which can effectively reduce the workload in the operation when the actual data capacity is huge.

This paper proposes and proves that the roughness measure of the disturbed fuzzy set is bounded. In practical application, a full understanding of the roughness measure boundary of the disturbed fuzzy set can effectively avoid unnecessary computing space and greatly improve work efficiency. However, the roughness measurement of disturbed fuzzy sets depends on the choice of parameter $\mu, \nu$. The roughness measurement of disturbed fuzzy sets without parameters will be further explored in future work.

Use of AI tools declaration

The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (No. 61603055).

Authors' contributions

Li Li: responsible for the planning, design and implementation of the research, providing financial and technical support. Hangyu Shi: designed research methods, processed and analyzed data, performed theorem proving, and wrote the first draft of the paper. Xiaona Liu: assisted in paper analysis and verification, and participated in paper revision. Jingjun Shi: provide partial data and coordinate the study as a whole.

Conflict of interest

The authors declare no conflicts of interest.