Yanmei Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yanmei Chen has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Binfan Lin
School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou 510665, China
1 shared publication - Bingo Wing-Kuen Ling
Faculty of Information Engineering, Guangdong University of Technology, Guangzhou, China
1 shared publication Fusheng Zhu
Guangdong Polytechnic Normal University
1 shared publication- Jiajia Chen
School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou, China
1 shared publication Jianwei Dong
College of Medical Information Engineering, Guangdong Pharmaceutical University, Guangzhou, China
1 shared publication- Jianwei Dong
School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou, China
1 shared publication
Latest Publications
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 13848-13855
Affective-CoT: Decomposing Multimodal Emotion Reasoning through a Hierarchical Cognitive Workflow
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 13848-13855
Open AccessAffective-CoT: Decomposing Multimodal Emotion Reasoning through a Hierarchical Cognitive Workflow
- Open Access
A Hierarchical RF-XGBoost Model for Short-Cycle Agricultural Product Sales Forecasting
Short-cycle agricultural product sales forecasting significantly reduces food waste by accurately predicting demand, ensuring producers match supply with consumer needs. However, the forecasting is often subject to uncertain factors, resulting in highly volatile and discontinuous data. To address this, a hierarchical prediction model that combines RF-XGBoost is proposed in this work. It adopts the Random Forest (RF) in the first layer to extract residuals and achieve initial prediction results based on correlation features from Grey Relation Analysis (GRA). Then, a new feature set based on residual clustering features is generated after the hierarchical clustering is applied to classify the characteristics of the residuals. Subsequently, Extreme Gradient Boosting (XGBoost) acts as the second layer that utilizes those residual clustering features to yield the prediction results. The final prediction is by incorporating the results from the first layer and second layer correspondingly. As for the performance evaluation, using agricultural product sales data from a supermarket in China from 1 July 2020 to 30 June 2023, the results demonstrate superiority over standalone RF and XGBoost, with a Mean Absolute Percentage Error (MAPE) reduction of 10% and 12%, respectively, and a coefficient of determination (R2) increase of 22% and 24%, respectively. Additionally, its generalization is validated across 42 types of agricultural products from six vegetable categories, showing its extensive practical ability. Such performances reveal that the proposed model beneficially enhances the precision of short-term agricultural product sales forecasting, with the advantages of optimizing the supply chain from producers to consumers and minimizing food waste accordingly.
Open AccessA Hierarchical RF-XGBoost Model for Short-Cycle Agricultural Product Sales Forecasting
Short-cycle agricultural product sales forecasting significantly reduces food waste by accurately predicting demand, ensuring producers match supply with consumer needs. However, the forecasting is often subject to uncertain factors, resulting in highly volatile and discontinuous data. To address this, a hierarchical prediction model that combines RF-XGBoost is proposed in this work. It adopts the Random Forest (RF) in the first layer to extract residuals and achieve initial prediction results based on correlation features from Grey Relation Analysis (GRA). Then, a new feature set based on residual clustering features is generated after the hierarchical clustering is applied to classify the characteristics of the residuals. Subsequently, Extreme Gradient Boosting (XGBoost) acts as the second layer that utilizes those residual clustering features to yield the prediction results. The final prediction is by incorporating the results from the first layer and second layer correspondingly. As for the performance evaluation, using agricultural product sales data from a supermarket in China from 1 July 2020 to 30 June 2023, the results demonstrate superiority over standalone RF and XGBoost, with a Mean Absolute Percentage Error (MAPE) reduction of 10% and 12%, respectively, and a coefficient of determination (R2) increase of 22% and 24%, respectively. Additionally, its generalization is validated across 42 types of agricultural products from six vegetable categories, showing its extensive practical ability. Such performances reveal that the proposed model beneficially enhances the precision of short-term agricultural product sales forecasting, with the advantages of optimizing the supply chain from producers to consumers and minimizing food waste accordingly.
- 2 January 2024
- Published by Springer Nature
- p. 319-328
Research on Feature Extraction Based on Time Series Images
- 2 January 2024
- Published by Springer Nature
- p. 319-328
Research on Feature Extraction Based on Time Series Images
- Open Access
- 19 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 113414-113418
A Divide-and-Cooperate Machine Learning Model-Based RBF With Its VC Dimension Analysis
In this paper, a Divide-and-Cooperate Machine Learning Model (DCML) based Radial Basis Function Network (RBF) is constructed. This DCML is composed of several sub-RBF networks that take some variables as their inputs. The output of DCML is the sum of sub-RBF networks' outputs. The analysis of VC dimension of DCML shows in theory that its structural complexity is less than conventional Extended Radial Basis Function Network (ENRBF). The experimental results have verified that the DCML outperforms conventional ENRBF.
- 19 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 113414-113418
Open AccessA Divide-and-Cooperate Machine Learning Model-Based RBF With Its VC Dimension Analysis
In this paper, a Divide-and-Cooperate Machine Learning Model (DCML) based Radial Basis Function Network (RBF) is constructed. This DCML is composed of several sub-RBF networks that take some variables as their inputs. The output of DCML is the sum of sub-RBF networks' outputs. The analysis of VC dimension of DCML shows in theory that its structural complexity is less than conventional Extended Radial Basis Function Network (ENRBF). The experimental results have verified that the DCML outperforms conventional ENRBF.
- 8 March 2018
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 58 (3) , 599-612
Relative perturbation bounds for eigenpairs of diagonalizable matrices
- 8 March 2018
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 58 (3) , 599-612
Relative perturbation bounds for eigenpairs of diagonalizable matrices
- 18 January 2018
- Published by Springer Nature in Numerical Algorithms
- Vol. 79 (2) , 657-677
Some refined bounds for the perturbation of the orthogonal projection and the generalized inverse
- 18 January 2018
- Published by Springer Nature in Numerical Algorithms
- Vol. 79 (2) , 657-677
Some refined bounds for the perturbation of the orthogonal projection and the generalized inverse
- 9 December 2016
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 11 (5) , 873-879
A parallel thinning algorithm based on stroke continuity detection
- 9 December 2016
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 11 (5) , 873-879
A parallel thinning algorithm based on stroke continuity detection
- 26 January 2016
- Published by Springer Nature in Numerical Algorithms
- Vol. 73 (2) , 433-444
On perturbation bounds for orthogonal projections
- 26 January 2016
- Published by Springer Nature in Numerical Algorithms
- Vol. 73 (2) , 433-444
On perturbation bounds for orthogonal projections