Boyang Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Boyang Wang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Fei Deng
College of Information Engineering, Kunming University, Kunming, Yunnan, China
2 shared publications - Xisong Miao
College of Information Engineering, Kunming University, Kunming, Yunnan, China
2 shared publications - Bowen Zheng
School of Information Engineering, Kunming University, Kunming, Yunnan, China
1 shared publication - Golam Saklain
College of Information Engineering, Kunming University, Kunming, Yunnan, China
1 shared publication Hongyan Jin
College of Information Engineering, Kunming University, Kunming, China
1 shared publicationHuanyu Wei
College of Information Engineering, Kunming University, Kunming, China
1 shared publication
Latest Publications
- 13 November 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 40 (01)
Stability, Monotonicity, and Necessity Analysis of Gradient Method with Penalty Terms for Dynamic Ridge Polynomial Neural Network
In recent years, high-order neural networks (HONNs) have gained widespread usage due to their excellent approximation ability, incorporating both ∑ neurons and ∏ neurons. The dynamic ridge polynomial neural network (DRPNN), as a type of HONN, has been highly valued. However, during the training process of the DRPNN, slow convergence occurs due to the presence of unknown factors. Given this, we propose a method to enhance the DRPNN convergence speed by incorporating a penalty term into the error function and training it using the gradient method. The proposed method significantly improves the convergence speed during network training. To explain the training characteristics of the proposed method, three theorems, namely stability, monotonicity, and necessity, are theoretically proven. More precisely, the whole network is stable over time based on the ultimate training results. The loss function monotonically decreases. Regarding the necessity, the ultimate training results must be an optimal solution. Furthermore, under the condition of the same iteration steps and error accuracy, experiments concerning function simulation and image simulation are advanced to verify the theoretical effectiveness of the proposed method, with the advanced analysis of the corresponding generalizability being discussed.
- 13 November 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 40 (01)
Stability, Monotonicity, and Necessity Analysis of Gradient Method with Penalty Terms for Dynamic Ridge Polynomial Neural Network
In recent years, high-order neural networks (HONNs) have gained widespread usage due to their excellent approximation ability, incorporating both ∑ neurons and ∏ neurons. The dynamic ridge polynomial neural network (DRPNN), as a type of HONN, has been highly valued. However, during the training process of the DRPNN, slow convergence occurs due to the presence of unknown factors. Given this, we propose a method to enhance the DRPNN convergence speed by incorporating a penalty term into the error function and training it using the gradient method. The proposed method significantly improves the convergence speed during network training. To explain the training characteristics of the proposed method, three theorems, namely stability, monotonicity, and necessity, are theoretically proven. More precisely, the whole network is stable over time based on the ultimate training results. The loss function monotonically decreases. Regarding the necessity, the ultimate training results must be an optimal solution. Furthermore, under the condition of the same iteration steps and error accuracy, experiments concerning function simulation and image simulation are advanced to verify the theoretical effectiveness of the proposed method, with the advanced analysis of the corresponding generalizability being discussed.
- Open Access
- 13 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 28-34
The Novel Method About Correlation Calculation Based on An Inequation
Among the many methods of analysing correlation coefficient, the two classical methods are the Spearman correlation coefficient and Pearson correlation coefficient. For the Spearman method, the time complexity is larger because of the sorting data. For the Pearson method, there are also some limited conditions, such as the data are needed to linearly related and continuous, normally distributed or near-normally distributed with a single peak and independent. To avoid the disadvantages about the above correlation coefficients, we propose a novel method about correlation calculation based on an inequation, which derives from inventory model theory and risk pooling theory. Firstly, for the whole dataset, we calculate the sample mean and standard deviation of sub elements and whole datasets respectively. Then, using the inventory model theory, we calculate the total standard deviation of the whole dataset and the sum of standard deviation about sub elements of whole dataset, and obtain the novel inequality. Then, judge this inequality: when “ \(=\) ” is true, conclude that there is no correlation data in the entire dataset \({\rm{X}}\) ; when “ \(>\) ” is true, it is judged that the entire dataset X has relevant data, furthermore, the bigger the difference of left value subtracts right value, the stronger the correlation. The proposed algorithm owns the lower time complexity and much wider range of uses. Finally, the GDP experiment and Gini index experiment demonstrate the effectiveness of the novel method.- 13 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 28-34
Open AccessThe Novel Method About Correlation Calculation Based on An Inequation
Among the many methods of analysing correlation coefficient, the two classical methods are the Spearman correlation coefficient and Pearson correlation coefficient. For the Spearman method, the time complexity is larger because of the sorting data. For the Pearson method, there are also some limited conditions, such as the data are needed to linearly related and continuous, normally distributed or near-normally distributed with a single peak and independent. To avoid the disadvantages about the above correlation coefficients, we propose a novel method about correlation calculation based on an inequation, which derives from inventory model theory and risk pooling theory. Firstly, for the whole dataset, we calculate the sample mean and standard deviation of sub elements and whole datasets respectively. Then, using the inventory model theory, we calculate the total standard deviation of the whole dataset and the sum of standard deviation about sub elements of whole dataset, and obtain the novel inequality. Then, judge this inequality: when “ \(=\) ” is true, conclude that there is no correlation data in the entire dataset \({\rm{X}}\) ; when “ \(>\) ” is true, it is judged that the entire dataset X has relevant data, furthermore, the bigger the difference of left value subtracts right value, the stronger the correlation. The proposed algorithm owns the lower time complexity and much wider range of uses. Finally, the GDP experiment and Gini index experiment demonstrate the effectiveness of the novel method. - Open Access
- 13 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 130426-130438
A Novel Fuzzy Time Series Method Based on Dynamic Ridge Polynomial Neural Network With Penalty Term and Fuzzy Clustering Analysis
Due to the limitations of traditional time series models in handling semantic values and small-scale data, the concept of fuzzy time series forecasting has been introduced in academia. This model performs exceptionally well on fuzzy datasets, prompting many researchers to delve into this field. The general process of fuzzy time series analysis consists of the following stages: (1) domain partitioning; (2) formation of fuzzy sets for fuzzifying data; (3) extraction of fuzzy relationships; and (4) forecasting and defuzzification. Domain partitioning and the extraction of fuzzy relationships have always been crucial components of fuzzy time series forecasting. Until now, neural networks have been less commonly applied in the step of determining fuzzy relationships. Some researchers have attempted to utilize the Pi-Sigma neural network for the determination of fuzzy relationships. However, due to the fixed network structure that Pi-Sigma neural networks cannot adapt to changes over time, it has been indicated that it is not a universal approximator. Its performance in handling complex dynamic time series has not been satisfactory. In this paper, we utilize Fuzzy C-Means Clustering (FCM) to partition the domain into unequal-length intervals and employ a high-order dynamic neural network known as Dynamic Ridge Polynomial Neural Network (DRPNN). This network can start with a small basic structure and gradually increase its structural complexity as learning progresses until it achieves the required task accuracy, which demonstrates superior performance in handling complex time series data. During the training process, we employ a novel gradient descent training algorithm with penalty terms. We conducted tests on this algorithm using nine real-world datasets and performed Friedman and Bonferroni-Dunn tests to ensure that the proposed algorithm exhibits statistical performance superiority compared to other methods in the literature. The results indicate that our algorithm outperforms those from other studies.
- 13 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 130426-130438
Open AccessA Novel Fuzzy Time Series Method Based on Dynamic Ridge Polynomial Neural Network With Penalty Term and Fuzzy Clustering Analysis
Due to the limitations of traditional time series models in handling semantic values and small-scale data, the concept of fuzzy time series forecasting has been introduced in academia. This model performs exceptionally well on fuzzy datasets, prompting many researchers to delve into this field. The general process of fuzzy time series analysis consists of the following stages: (1) domain partitioning; (2) formation of fuzzy sets for fuzzifying data; (3) extraction of fuzzy relationships; and (4) forecasting and defuzzification. Domain partitioning and the extraction of fuzzy relationships have always been crucial components of fuzzy time series forecasting. Until now, neural networks have been less commonly applied in the step of determining fuzzy relationships. Some researchers have attempted to utilize the Pi-Sigma neural network for the determination of fuzzy relationships. However, due to the fixed network structure that Pi-Sigma neural networks cannot adapt to changes over time, it has been indicated that it is not a universal approximator. Its performance in handling complex dynamic time series has not been satisfactory. In this paper, we utilize Fuzzy C-Means Clustering (FCM) to partition the domain into unequal-length intervals and employ a high-order dynamic neural network known as Dynamic Ridge Polynomial Neural Network (DRPNN). This network can start with a small basic structure and gradually increase its structural complexity as learning progresses until it achieves the required task accuracy, which demonstrates superior performance in handling complex time series data. During the training process, we employ a novel gradient descent training algorithm with penalty terms. We conducted tests on this algorithm using nine real-world datasets and performed Friedman and Bonferroni-Dunn tests to ensure that the proposed algorithm exhibits statistical performance superiority compared to other methods in the literature. The results indicate that our algorithm outperforms those from other studies.