Xudong Gao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xudong Gao has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Jun Chen
School of Electronics and Information, Northwestern Polytechnical University, Xian, China
5 shared publications - Jia Rong
Monash University
4 shared publications Xiaoguang Gao
School of Electronics and Information, Northwestern Polytechnical University, Xian, China
3 shared publications- Xiaolei Li
Yanshan University
2 shared publications - Yifeng Niu
National University of Defense Technology
2 shared publications Jia Rong
1 shared publication
Latest Publications
- 9 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 34 (6) , 1935-1948
Convergence Conditions for Sigmoid-Based Fuzzy General Gray Cognitive Maps: A Theoretical Study
Fuzzy General gray Cognitive Maps (FGGCMs) extend Fuzzy Cognitive Maps (FCMs) and Fuzzy gray Cognitive Maps (FGCMs) by employing general gray numbers to handle uncertainty arising from multi-interval data. While the convergence properties of FCMs and FGCMs are well-established, the convergence behavior of FGGCMs, especially those employing the widely adopted sigmoid activation function, remains insufficiently explored. Investigating sigmoid-based FGGCMs is of critical importance, as the unique handling of kernel and grayness for general gray numbers under the sigmoid function leads to convergence criteria fundamentally different from those derived for the tanh function. This work addresses the gap by developing a theoretical framework to analyze the convergence of sigmoid FGGCMs. By applying the Banach fixed-point theorem, sufficient conditions are derived to ensure global convergence to a unique fixed point, with separate criteria established for the kernel and grayness components. It is found that the convergence of grayness is contingent upon the convergence of the kernel. This relationship contrasts with the grayness convergence behavior exhibited in tanh-based FGGCMs. The proposed theorems generalize and subsume existing convergence results for FCMs and FGCMs. The theoretical results are validated by generalizing a classic Web Experience model into FGCM and FGGCM, indicating that smaller sigmoid steepness parameters ensure system convergence to a fixed point, whereas larger values tend to induce limit cycles. This study establishes a foundational convergence theory to support the development of reliable learning algorithms and to enable the application of FGGCMs in prediction, control, and decision-support systems operating under uncertainty.
- 9 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 34 (6) , 1935-1948
Convergence Conditions for Sigmoid-Based Fuzzy General Gray Cognitive Maps: A Theoretical Study
Fuzzy General gray Cognitive Maps (FGGCMs) extend Fuzzy Cognitive Maps (FCMs) and Fuzzy gray Cognitive Maps (FGCMs) by employing general gray numbers to handle uncertainty arising from multi-interval data. While the convergence properties of FCMs and FGCMs are well-established, the convergence behavior of FGGCMs, especially those employing the widely adopted sigmoid activation function, remains insufficiently explored. Investigating sigmoid-based FGGCMs is of critical importance, as the unique handling of kernel and grayness for general gray numbers under the sigmoid function leads to convergence criteria fundamentally different from those derived for the tanh function. This work addresses the gap by developing a theoretical framework to analyze the convergence of sigmoid FGGCMs. By applying the Banach fixed-point theorem, sufficient conditions are derived to ensure global convergence to a unique fixed point, with separate criteria established for the kernel and grayness components. It is found that the convergence of grayness is contingent upon the convergence of the kernel. This relationship contrasts with the grayness convergence behavior exhibited in tanh-based FGGCMs. The proposed theorems generalize and subsume existing convergence results for FCMs and FGCMs. The theoretical results are validated by generalizing a classic Web Experience model into FGCM and FGGCM, indicating that smaller sigmoid steepness parameters ensure system convergence to a fixed point, whereas larger values tend to induce limit cycles. This study establishes a foundational convergence theory to support the development of reliable learning algorithms and to enable the application of FGGCMs in prediction, control, and decision-support systems operating under uncertainty.
- 14 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 33 (10) , 3651-3665
On the Convergence of Tanh Fuzzy General Gray Cognitive Maps
Fuzzy Cognitive Maps (FCMs) are widely used for modeling complex systems but are limited in handling uncertainty from imprecise or multi-interval data. To address this, extended models such as Fuzzy Grey Cognitive Maps (FGCMs) and Fuzzy General Grey Cognitive Maps (FGGCMs) have been developed. In particular, FGGCMs can process general grey numbers (GGNs), enabling more effective modeling of uncertainty. However, the convergence properties of FGGCMs remain underexplored, limiting their reliability in applications involving prediction, control, and decision-making. This paper addresses this gap by establishing a rigorous theoretical framework for analyzing the convergence of FGGCMs using the tanh activation function. First, we define the metric and vector space structure of GGN and prove their completeness. Based on this, Banach's fixed-point theorem is employed to derive sufficient conditions for the global convergence of FGGCMs to a unique fixed point. Moreover, convergence criteria are separately established for the kernel and greyness components. Finally, we show that existing convergence results for FCMs and FGCMs are special cases of the broader theorems proposed in this work. The main finding is the convergence theorems of tanh FGGCM and the results provide a solid mathematical foundation for future developments in learning algorithms and FCM-based modeling under uncertainty.
- 14 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 33 (10) , 3651-3665
On the Convergence of Tanh Fuzzy General Gray Cognitive Maps
Fuzzy Cognitive Maps (FCMs) are widely used for modeling complex systems but are limited in handling uncertainty from imprecise or multi-interval data. To address this, extended models such as Fuzzy Grey Cognitive Maps (FGCMs) and Fuzzy General Grey Cognitive Maps (FGGCMs) have been developed. In particular, FGGCMs can process general grey numbers (GGNs), enabling more effective modeling of uncertainty. However, the convergence properties of FGGCMs remain underexplored, limiting their reliability in applications involving prediction, control, and decision-making. This paper addresses this gap by establishing a rigorous theoretical framework for analyzing the convergence of FGGCMs using the tanh activation function. First, we define the metric and vector space structure of GGN and prove their completeness. Based on this, Banach's fixed-point theorem is employed to derive sufficient conditions for the global convergence of FGGCMs to a unique fixed point. Moreover, convergence criteria are separately established for the kernel and greyness components. Finally, we show that existing convergence results for FCMs and FGCMs are special cases of the broader theorems proposed in this work. The main finding is the convergence theorems of tanh FGGCM and the results provide a solid mathematical foundation for future developments in learning algorithms and FCM-based modeling under uncertainty.
- 23 March 2025
- Published by Elsevier in Neurocomputing
- Vol. 637
HB-net: Holistic bursting cell cluster integrated network for occluded multi-objects recognition
- 23 March 2025
- Published by Elsevier in Neurocomputing
- Vol. 637
HB-net: Holistic bursting cell cluster integrated network for occluded multi-objects recognition
- Open Access
- 9 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 98665-98678
The Dynamic Extensions of Fuzzy Grey Cognitive Maps
Fuzzy Cognitive Map is recognized as an important model in soft computing. The Fuzzy Cognitive Map theory studies often treat uncertainty modeling and dynamic modeling separately. So far, there is no single Fuzzy Cognitive Map that can deal with uncertain data and dynamic environments simultaneously. This paper proposed an environment model to describe the link between changing weights and the dynamic environment. As the extensions of the classic Fuzzy Grey Cognitive Map, two dynamic models were designed and implemented in this work: Dynamic Fuzzy Grey Cognitive Map and Dynamic Fuzzy General Grey Map. In this work, we also analyze the characteristics of the two models and evaluate their performance using industrial control problems. The results showed that the proposed models could well handle uncertain data in dynamic environments.
- 9 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 98665-98678
Open AccessThe Dynamic Extensions of Fuzzy Grey Cognitive Maps
Fuzzy Cognitive Map is recognized as an important model in soft computing. The Fuzzy Cognitive Map theory studies often treat uncertainty modeling and dynamic modeling separately. So far, there is no single Fuzzy Cognitive Map that can deal with uncertain data and dynamic environments simultaneously. This paper proposed an environment model to describe the link between changing weights and the dynamic environment. As the extensions of the classic Fuzzy Grey Cognitive Map, two dynamic models were designed and implemented in this work: Dynamic Fuzzy Grey Cognitive Map and Dynamic Fuzzy General Grey Map. In this work, we also analyze the characteristics of the two models and evaluate their performance using industrial control problems. The results showed that the proposed models could well handle uncertain data in dynamic environments.
- 13 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 801-806
Hybrid FCM learning algorithm based on particle swarm optimization and gradient descent algorithm
The learning algorithm of fuzzy cognitive map(FCM) is mainly based on expert intervention or effective historical data to learn the weight value in weight matrix W. With the increase of the number of nodes, the number of weights need to be learned will also increase square, the performance of the learning algorithm will decline sharply. Therefore, it is an important task to design a high-performance learning algorithm which depends on expert knowledge as little as possible. A single learning algorithm has some limitations, such as easy local optimization, slow learning rate and so on. Among them, particle swarm optimization algorithm has strong global optimization ability, which can quickly optimize the weight matrix to a certain accuracy, but the follow-up optimization time is too long. For the gradient descent algorithm, when the initial value is chosen properly, its can approach the global optimal solution quickly. In this paper, we design particle swarm optimization (PSO) and gradient descent algorithm (GDA) to learn FCM respectively. According to the characteristics of the two algorithms, a hybrid algorithm(HA) is proposed: first, the PSO algorithm is used to optimize weight matrix to a certain accuracy, then the gradient descent method is added, which makes up for the disadvantage that the error of single PSO algorithm decreases slowly in the later stage. Experimental results show that the hybrid algorithm proposed in this paper has a significant improvement in both accuracy and speed.
- 13 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 801-806
Hybrid FCM learning algorithm based on particle swarm optimization and gradient descent algorithm
The learning algorithm of fuzzy cognitive map(FCM) is mainly based on expert intervention or effective historical data to learn the weight value in weight matrix W. With the increase of the number of nodes, the number of weights need to be learned will also increase square, the performance of the learning algorithm will decline sharply. Therefore, it is an important task to design a high-performance learning algorithm which depends on expert knowledge as little as possible. A single learning algorithm has some limitations, such as easy local optimization, slow learning rate and so on. Among them, particle swarm optimization algorithm has strong global optimization ability, which can quickly optimize the weight matrix to a certain accuracy, but the follow-up optimization time is too long. For the gradient descent algorithm, when the initial value is chosen properly, its can approach the global optimal solution quickly. In this paper, we design particle swarm optimization (PSO) and gradient descent algorithm (GDA) to learn FCM respectively. According to the characteristics of the two algorithms, a hybrid algorithm(HA) is proposed: first, the PSO algorithm is used to optimize weight matrix to a certain accuracy, then the gradient descent method is added, which makes up for the disadvantage that the error of single PSO algorithm decreases slowly in the later stage. Experimental results show that the hybrid algorithm proposed in this paper has a significant improvement in both accuracy and speed.
- Open Access
- 4 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 163844-163856
Enhance the Uncertainty Modeling Ability of Fuzzy Grey Cognitive Maps by General Grey Number
In real-life systems, people cannot get precise data. The data are represented in the forms of interval or multiple intervals in many cases. Most intelligent algorithms are designed for precise data in algorithm research. People always use a real number contained in the interval or multiple intervals as the candidate for the precise data. However, such a measure will lose lots of information contained in the interval or multiple intervals. Fuzzy Cognitive Map (FCM) is one of the famous intelligent algorithms. The Fuzzy Grey Cognitive Map (FGCM) was proposed to enable FCM to do interval computation. But FGCM can only deal with a single interval, as for multiple intervals, the FGCM is powerless. Thus, this paper aims to enhance the FGCM to make it can cope with multiple intervals. The paper introduces the general grey number and deduces the new activation functions according to Grey System Theory (GST) and Taylor series. Finally, an industrial process control problem is applied to verify the new algorithm. The results show that the new algorithm is not only compatible with the original FGCM and FCM, but can process more uncertain knowledge and data. In general, the new algorithm inherits most of FGCM’s characteristics and can cope with the data expressed by multiple intervals, which means it can be used in environments with more uncertain knowledge and data.
- 4 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 163844-163856
Open AccessEnhance the Uncertainty Modeling Ability of Fuzzy Grey Cognitive Maps by General Grey Number
In real-life systems, people cannot get precise data. The data are represented in the forms of interval or multiple intervals in many cases. Most intelligent algorithms are designed for precise data in algorithm research. People always use a real number contained in the interval or multiple intervals as the candidate for the precise data. However, such a measure will lose lots of information contained in the interval or multiple intervals. Fuzzy Cognitive Map (FCM) is one of the famous intelligent algorithms. The Fuzzy Grey Cognitive Map (FGCM) was proposed to enable FCM to do interval computation. But FGCM can only deal with a single interval, as for multiple intervals, the FGCM is powerless. Thus, this paper aims to enhance the FGCM to make it can cope with multiple intervals. The paper introduces the general grey number and deduces the new activation functions according to Grey System Theory (GST) and Taylor series. Finally, an industrial process control problem is applied to verify the new algorithm. The results show that the new algorithm is not only compatible with the original FGCM and FCM, but can process more uncertain knowledge and data. In general, the new algorithm inherits most of FGCM’s characteristics and can cope with the data expressed by multiple intervals, which means it can be used in environments with more uncertain knowledge and data.