Yuan-Hai Shao
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
Yuan-Hai Shao has a total of 136 co-authors. Here are the top co-authors by number of shared publications:
- Chun-Na Li
School of Mathematics and Statistics, Hainan University, Haikou, China
31 shared publications - Wei-Jie Chen
State Key Laboratory for Development and Utilization of Forest Food Resources, Zhejiang A&F University, Hangzhou 311300, China
22 shared publications Chun-Na Li
16 shared publicationsNai-Yang Deng
16 shared publications- Zhen Wang
Inner Mongolia University
13 shared publications - Nai-Yang Deng
China Agricultural University
10 shared publications
Latest Publications
- 16 July 2026
- Published by Elsevier in Neurocomputing
- Vol. 701
Convex combination Universum support vector machine with multiple Universum
- 16 July 2026
- Published by Elsevier in Neurocomputing
- Vol. 701
Convex combination Universum support vector machine with multiple Universum
- 5 May 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 334 (3) , 751-763
A novel support vector machine with hillside loss and margin distribution
- 5 May 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 334 (3) , 751-763
A novel support vector machine with hillside loss and margin distribution
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 7 (7) , 3965-3978
$\ell_{0}$-Norm Penalty Embedded Feature Selection in Universum Learning
Universum learning exploits an auxiliary dataset, whose samples lie within the same domain as the target classes but are not labeled as either, thereby injecting valuable prior knowledge into the learning process. In high-dimensional settings, however, a significant challenge arises regarding whether the Universum has positive effects on effectively constraining the space of admissible models. To settle this problem, this paper introduces an ℓ0-norm penalty into the Universum support vector machine, enabling the classifier to implement Universum in an essentially lower-dimensional space constituted by the most relevant variables. To derive practical solutions of the prosed NP-hard problem, we establish the existence of an optimal solution and subsequently formulate necessary and sufficient optimality conditions by introducing two types of stationary points. These optimality conditions facilitate a practical approach for solving the proposed model. Accordingly, we develop an effective alternating direction method of multipliers algorithm. The convergence of this algorithm is demonstrated under specific conditions in both theory and practice. Numerical experiments across various datasets demonstrate the effectiveness of our proposed method.
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 7 (7) , 3965-3978
$\ell_{0}$-Norm Penalty Embedded Feature Selection in Universum Learning
Universum learning exploits an auxiliary dataset, whose samples lie within the same domain as the target classes but are not labeled as either, thereby injecting valuable prior knowledge into the learning process. In high-dimensional settings, however, a significant challenge arises regarding whether the Universum has positive effects on effectively constraining the space of admissible models. To settle this problem, this paper introduces an ℓ0-norm penalty into the Universum support vector machine, enabling the classifier to implement Universum in an essentially lower-dimensional space constituted by the most relevant variables. To derive practical solutions of the prosed NP-hard problem, we establish the existence of an optimal solution and subsequently formulate necessary and sufficient optimality conditions by introducing two types of stationary points. These optimality conditions facilitate a practical approach for solving the proposed model. Accordingly, we develop an effective alternating direction method of multipliers algorithm. The convergence of this algorithm is demonstrated under specific conditions in both theory and practice. Numerical experiments across various datasets demonstrate the effectiveness of our proposed method.
- Open Access
SETrLUSI: Stochastic Ensemble Multi-Source Transfer Learning Using Statistical Invariant
In transfer learning, a source domain often carries diverse knowledge, and different domains usually emphasize different types of knowledge. Different from handling only a single type of knowledge from all domains in traditional transfer learning methods, we introduce an ensemble learning framework with a weak mode of convergence in the form of Statistical Invariant (SI) for multi-source transfer learning, formulated as Stochastic Ensemble Multi-Source Transfer Learning Using Statistical Invariant (SETrLUSI). The proposed SI extracts and integrates various types of knowledge from both source and target domains, which not only effectively utilizes diverse knowledge but also accelerates the convergence process. Further, SETrLUSI incorporates stochastic SI selection, proportional source domain sampling, and target domain bootstrapping, which improves training efficiency while enhancing model stability. Experiments show that SETrLUSI has good convergence and outperforms related methods with a lower time cost.
Open AccessSETrLUSI: Stochastic Ensemble Multi-Source Transfer Learning Using Statistical Invariant
In transfer learning, a source domain often carries diverse knowledge, and different domains usually emphasize different types of knowledge. Different from handling only a single type of knowledge from all domains in traditional transfer learning methods, we introduce an ensemble learning framework with a weak mode of convergence in the form of Statistical Invariant (SI) for multi-source transfer learning, formulated as Stochastic Ensemble Multi-Source Transfer Learning Using Statistical Invariant (SETrLUSI). The proposed SI extracts and integrates various types of knowledge from both source and target domains, which not only effectively utilizes diverse knowledge but also accelerates the convergence process. Further, SETrLUSI incorporates stochastic SI selection, proportional source domain sampling, and target domain bootstrapping, which improves training efficiency while enhancing model stability. Experiments show that SETrLUSI has good convergence and outperforms related methods with a lower time cost.
- 19 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 30 (3) , 2153-2166
Recursive Statistical Invariants Elimination for High-Risk Disease Diagnosis With Feature Selection
Feature selection for high-risk disease diagnosis is critical for accurate risk assessment, yet existing methods fail to incorporate medical domain knowledge, potentially leading to suboptimal diagnostic decisions. To address this limitation, we propose recursive statistical invariants elimination (RSIE), a novel framework that systematically integrates medical domain knowledge into feature selection. RSIE comprises three complementary components: learning using statistical invariants (LUSI) for extracting reliable diagnostic patterns from domain knowledge, kernel alignment for establishing meaningful correlations between domain knowledge and dataset features, and recursive feature elimination (RFE) for systematic feature ranking and selection. We evaluate RSIE on 15 high-risk disease datasets spanning cardiovascular, neurological, and oncological conditions. Experimental results show that RSIE achieves an average accuracy of 88.74% across all datasets compared to 83.28% for traditional SVM-RFE, representing a 5.46% improvement. Specifically, the LUSI-RFE* variant achieves superior performance, reducing feature dimensions by 45%-74% while maintaining high classification accuracy. The experiments simultaneously demonstrate the stability of RSIE against high noise conditions, computational efficiency, and model interpretability for high-risk disease diagnosis.
- 19 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 30 (3) , 2153-2166
Recursive Statistical Invariants Elimination for High-Risk Disease Diagnosis With Feature Selection
Feature selection for high-risk disease diagnosis is critical for accurate risk assessment, yet existing methods fail to incorporate medical domain knowledge, potentially leading to suboptimal diagnostic decisions. To address this limitation, we propose recursive statistical invariants elimination (RSIE), a novel framework that systematically integrates medical domain knowledge into feature selection. RSIE comprises three complementary components: learning using statistical invariants (LUSI) for extracting reliable diagnostic patterns from domain knowledge, kernel alignment for establishing meaningful correlations between domain knowledge and dataset features, and recursive feature elimination (RFE) for systematic feature ranking and selection. We evaluate RSIE on 15 high-risk disease datasets spanning cardiovascular, neurological, and oncological conditions. Experimental results show that RSIE achieves an average accuracy of 88.74% across all datasets compared to 83.28% for traditional SVM-RFE, representing a 5.46% improvement. Specifically, the LUSI-RFE* variant achieves superior performance, reducing feature dimensions by 45%-74% while maintaining high classification accuracy. The experiments simultaneously demonstrate the stability of RSIE against high noise conditions, computational efficiency, and model interpretability for high-risk disease diagnosis.
- 29 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1-12
Domain Adaptation via Learning Using Statistical Invariant
Domain adaptation has found widespread applications in real-life scenarios, especially when the target domain has limited labeled samples. However, most of the domain adaptation models only utilize one type of knowledge from the source domain, which is usually achieved by strong mode of convergence. To fully incorporate multiple knowledge from the source domain, for binary classification, this paper studies a novel learning paradigm for Domain Adaptation via Learning Using Statistical Invariant by simultaneously combining the strong and weak modes of convergence in a Hilbert space. The strong mode of convergence undertakes the mission of learning a least squares probability output binary classification task in a general hypothesis space, while the weak mode of convergence integrates diverse knowledge by constructing meaningful statistical invariants that embody the concept of intelligence. The utilization of weak convergence shrinks the admissible set of approximation functions, and subsequently accelerates the learning process. In this paper, several statistical invariants that represent sample, feature and parameter information from the source domain are constructed. By taking an appropriate statistical invariant, DLUSI realizes some existing methods. Experimental results on synthetic data as well as the widely used Amazon Reviews and 20 News data demonstrate the superiority of the proposed method.
- 29 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1-12
Domain Adaptation via Learning Using Statistical Invariant
Domain adaptation has found widespread applications in real-life scenarios, especially when the target domain has limited labeled samples. However, most of the domain adaptation models only utilize one type of knowledge from the source domain, which is usually achieved by strong mode of convergence. To fully incorporate multiple knowledge from the source domain, for binary classification, this paper studies a novel learning paradigm for Domain Adaptation via Learning Using Statistical Invariant by simultaneously combining the strong and weak modes of convergence in a Hilbert space. The strong mode of convergence undertakes the mission of learning a least squares probability output binary classification task in a general hypothesis space, while the weak mode of convergence integrates diverse knowledge by constructing meaningful statistical invariants that embody the concept of intelligence. The utilization of weak convergence shrinks the admissible set of approximation functions, and subsequently accelerates the learning process. In this paper, several statistical invariants that represent sample, feature and parameter information from the source domain are constructed. By taking an appropriate statistical invariant, DLUSI realizes some existing methods. Experimental results on synthetic data as well as the widely used Amazon Reviews and 20 News data demonstrate the superiority of the proposed method.
- 24 April 2025
- Published by Springer Nature in Machine Learning
- Vol. 114 (6) , 1-23
Group feature selection using non-class data
- 24 April 2025
- Published by Springer Nature in Machine Learning
- Vol. 114 (6) , 1-23
Group feature selection using non-class data
- 3 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 25254-25268
MIEL: Enhancing Long- and Ultra-Long-Term Time-Series Forecasting With Multiscale Input and Ensemble Linear Networks
Deep learning methodologies have shown impressive effectiveness in tackling time-series tasks; nevertheless, a significant issue revolves around the inherent tradeoff between the length of the look-back window (data input length) and prediction accuracy. In general, expanding the look-back window tends to positively influence predictive tasks. However, the fixed nature of the look-back window restricts both the accuracy and temporal scope of predictive models. Consequently, this article introduces a novel approach named the multiscale input ensemble linear network (MIEL), aimed at leveraging historical time-series data comprehensively while addressing the complexities of ultra-long time-series prediction. MIEL generates multiscale time-series inputs through random forward sampling, thus extending the predictive capabilities of the model for extended time-series. Simultaneously, the model integration strategy, which uses the same parameters to process data at different scales, reduces the number of parameters and memory usage when handling multiscale data. Empirical results demonstrate that MIEL outperforms the eight most recent methodologies in terms of prediction accuracy especially for ultra-long time-series prediction, while only marginally increasing memory utilization. The code has been released to github.
- 3 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 25254-25268
MIEL: Enhancing Long- and Ultra-Long-Term Time-Series Forecasting With Multiscale Input and Ensemble Linear Networks
Deep learning methodologies have shown impressive effectiveness in tackling time-series tasks; nevertheless, a significant issue revolves around the inherent tradeoff between the length of the look-back window (data input length) and prediction accuracy. In general, expanding the look-back window tends to positively influence predictive tasks. However, the fixed nature of the look-back window restricts both the accuracy and temporal scope of predictive models. Consequently, this article introduces a novel approach named the multiscale input ensemble linear network (MIEL), aimed at leveraging historical time-series data comprehensively while addressing the complexities of ultra-long time-series prediction. MIEL generates multiscale time-series inputs through random forward sampling, thus extending the predictive capabilities of the model for extended time-series. Simultaneously, the model integration strategy, which uses the same parameters to process data at different scales, reduces the number of parameters and memory usage when handling multiscale data. Empirical results demonstrate that MIEL outperforms the eight most recent methodologies in terms of prediction accuracy especially for ultra-long time-series prediction, while only marginally increasing memory utilization. The code has been released to github.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 32 (10709908) , 1031-1035
Distribution Metric Based $V$-Matrix Support Vector Machine
The V -matrix Support Vector Machine (VSVM) is an innovative machine learning method recently proposed by Vapnik and Izmailov, which integrates positional relationships among training samples into the model learning, yielding the decision via conditional probability. But it overlooks the distribution information hidden in the data which plays a pivotal role in the training process and neglects the utilization of testing samples. To fully exploit the distribution information of the data, this paper proposes a novel Distribution Metric Based V - matrix Support Vector Machine (DVSVM) building upon VSVM. DVSVM incorporates the distributional information implicit in the data by measuring the distances between samples using the Wasserstein distance. Compared to VSVM, it also additionally accounts for the positional relationships of testing samples. It is further theoretically proved that VSVM can degenerate from DVSVM under certain conditions. Experimental results on several synthetic datasets and real-world disease datasets demonstrate the superiority of DVSVM.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 32 (10709908) , 1031-1035
Distribution Metric Based $V$-Matrix Support Vector Machine
The V -matrix Support Vector Machine (VSVM) is an innovative machine learning method recently proposed by Vapnik and Izmailov, which integrates positional relationships among training samples into the model learning, yielding the decision via conditional probability. But it overlooks the distribution information hidden in the data which plays a pivotal role in the training process and neglects the utilization of testing samples. To fully exploit the distribution information of the data, this paper proposes a novel Distribution Metric Based V - matrix Support Vector Machine (DVSVM) building upon VSVM. DVSVM incorporates the distributional information implicit in the data by measuring the distances between samples using the Wasserstein distance. Compared to VSVM, it also additionally accounts for the positional relationships of testing samples. It is further theoretically proved that VSVM can degenerate from DVSVM under certain conditions. Experimental results on several synthetic datasets and real-world disease datasets demonstrate the superiority of DVSVM.
- 22 November 2024
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
- Vol. 42 (04)
A CVaR-Based Programming for Support Vector Machine with Uncertain Information
For the parallel support vector machine problem with uncertain information on the observation, by characterizing the violation of the positive class training data to the “upper” support hyperplane and that of the negative class training data to the “lower” support hyperplane via the conditional value-at-risk (CVaR), we establish a CVaR-based optimization model. For the model, we first show that it is a good convex approximation to the basic chance-constrained optimization model for the problem, then with the help of Lagrange duality theory, we transform it into a deterministic semi-definite programming (SDP) which can be numerically solved by the state-of-the-art SDP solvers. Numerical experiments conducted on the artificial and the real benchmark datasets show the validity and the efficiency of the proposed model.
- 22 November 2024
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
- Vol. 42 (04)
A CVaR-Based Programming for Support Vector Machine with Uncertain Information
For the parallel support vector machine problem with uncertain information on the observation, by characterizing the violation of the positive class training data to the “upper” support hyperplane and that of the negative class training data to the “lower” support hyperplane via the conditional value-at-risk (CVaR), we establish a CVaR-based optimization model. For the model, we first show that it is a good convex approximation to the basic chance-constrained optimization model for the problem, then with the help of Lagrange duality theory, we transform it into a deterministic semi-definite programming (SDP) which can be numerically solved by the state-of-the-art SDP solvers. Numerical experiments conducted on the artificial and the real benchmark datasets show the validity and the efficiency of the proposed model.