Zheming Gao
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
Zheming Gao has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Jian Luo
International Business School, Hainan University, Haikou 570228, China
4 shared publications - Shu-Cherng Fang
Edward P. Fitts Department of Industrial and Systems Engineering, North Carolina State University, Raleigh, NC, USA
3 shared publications - Haochen Luo
Texas A&M University
2 shared publications - Jin Xu
School of Management, Huazhong University of Science and Technology, Wuhan, China
2 shared publications - Min Huang
Northeastern University
2 shared publications Qian Wu
2 shared publications
Latest Publications
- Open Access
- 29 June 2026
- Published by Elsevier in SSRN Electronic Journal
An Ensemble Learning Approach Based on Random Sparse Quadratic Twin Parametric-Margin SVMs
Ensemble learning methods based on support vector machines (SVMs) have shown promising generalization ability in nonlinear classification tasks. However, the heteroscedastic noise in real-world datasets, simple classifier of base SVMs learners, kernel selection and kernel parameter tuning limit the classifying performance of SVMs with kernels and their related ensemble learning methods. To address these issues, we first propose a least squares kernel-free quadratic twin parametric-margin SVM model (LSQTPSVM) as the base learner within an ensemble framework. The proposed model introduces a parametric-margin term to handle heteroscedastic noise and employs two quadratic surfaces to capture complex data distributions to improve its robustness. Then we introduce a novel diversification strategy that randomly alters the parameters associated with linear, interaction and quadratic terms of two quadratic surfaces yielded by base learners, to develop an ensemble learning method based on the LSQTPSVM model. Comprehensive numerical results on synthetic and public benchmark datasets indicate that the proposed ensemble classification method outperforms commonly-used classification models and ensemble methods in terms of classification accuracy. Finally, we apply the ensemble learning method to credit risk assessment for validating its effectiveness in handling such real-world problems.
- 29 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAn Ensemble Learning Approach Based on Random Sparse Quadratic Twin Parametric-Margin SVMs
Ensemble learning methods based on support vector machines (SVMs) have shown promising generalization ability in nonlinear classification tasks. However, the heteroscedastic noise in real-world datasets, simple classifier of base SVMs learners, kernel selection and kernel parameter tuning limit the classifying performance of SVMs with kernels and their related ensemble learning methods. To address these issues, we first propose a least squares kernel-free quadratic twin parametric-margin SVM model (LSQTPSVM) as the base learner within an ensemble framework. The proposed model introduces a parametric-margin term to handle heteroscedastic noise and employs two quadratic surfaces to capture complex data distributions to improve its robustness. Then we introduce a novel diversification strategy that randomly alters the parameters associated with linear, interaction and quadratic terms of two quadratic surfaces yielded by base learners, to develop an ensemble learning method based on the LSQTPSVM model. Comprehensive numerical results on synthetic and public benchmark datasets indicate that the proposed ensemble classification method outperforms commonly-used classification models and ensemble methods in terms of classification accuracy. Finally, we apply the ensemble learning method to credit risk assessment for validating its effectiveness in handling such real-world problems.
- Open Access
- 4 January 2025
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 11 (1) , 1-12
A quadratic $\nu $-support vector regression approach for load forecasting- 4 January 2025
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 11 (1) , 1-12
Open AccessA quadratic $\nu $-support vector regression approach for load forecasting - 22 February 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 316 (1) , 46-60
A distributionally robust chance-constrained kernel-free quadratic surface support vector machine
- 22 February 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 316 (1) , 46-60
A distributionally robust chance-constrained kernel-free quadratic surface support vector machine
- 25 August 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 237
Distributed dynamic pricing of multiple perishable products using multi-agent reinforcement learning
- 25 August 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 237
Distributed dynamic pricing of multiple perishable products using multi-agent reinforcement learning
- 18 May 2023
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 181
A novel Markov model for near-term railway delay prediction
- 18 May 2023
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 181
A novel Markov model for near-term railway delay prediction
- 12 February 2023
- Published by Springer Nature in Soft Computing
- Vol. 27 (9) , 5567-5586
Sparse L1-norm quadratic surface support vector machine with Universum data
- 12 February 2023
- Published by Springer Nature in Soft Computing
- Vol. 27 (9) , 5567-5586
Sparse L1-norm quadratic surface support vector machine with Universum data
- 26 July 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 127
A kernel-free fuzzy reduced quadratic surface ν -support vector machine with applications
- 26 July 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 127
A kernel-free fuzzy reduced quadratic surface ν -support vector machine with applications
- 14 June 2022
- Published by Elsevier in International Journal of Forecasting
- Vol. 39 (2) , 1005-1020
A robust support vector regression model for electric load forecasting
- 14 June 2022
- Published by Elsevier in International Journal of Forecasting
- Vol. 39 (2) , 1005-1020
A robust support vector regression model for electric load forecasting
- Open Access
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
A Novel Markov Model for Near-Term Railway Delay Prediction
Predicting the near-future delay with accuracy for trains is momentous for railway operations and passengers’ traveling experience. This work aims to design prediction models for train delays based on Netherlands Railway data. We first develop a chi-square test to show that the delay evolution over stations follows a first-order Markov chain. We then propose a delay prediction model based on non-homogeneous Markov chains. To deal with the sparsity of the transition matrices of the Markov chains, we propose a novel matrix recovery approach that relies on Gaussian kernel density estimation. Our numerical tests show that this recovery approach outperforms other heuristic approaches in prediction accuracy. The Markov chain model we propose also shows to be better than other widely-used time series models with respect to both interpretability and prediction accuracy. Moreover, our proposed model does not require a complicated training process, which is capable of handling large-scale forecasting problems.
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Novel Markov Model for Near-Term Railway Delay Prediction
Predicting the near-future delay with accuracy for trains is momentous for railway operations and passengers’ traveling experience. This work aims to design prediction models for train delays based on Netherlands Railway data. We first develop a chi-square test to show that the delay evolution over stations follows a first-order Markov chain. We then propose a delay prediction model based on non-homogeneous Markov chains. To deal with the sparsity of the transition matrices of the Markov chains, we propose a novel matrix recovery approach that relies on Gaussian kernel density estimation. Our numerical tests show that this recovery approach outperforms other heuristic approaches in prediction accuracy. The Markov chain model we propose also shows to be better than other widely-used time series models with respect to both interpretability and prediction accuracy. Moreover, our proposed model does not require a complicated training process, which is capable of handling large-scale forecasting problems.