Xiayong Liu

Dr. Xiayong Liu

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

1 October 2021 in Sustainable Energy Technologies and Assessments
Verified
Journal Article
Closed access
XSXianhao Shen
Xianhao Shen
Haitao YuHaitao Yu
Haitao Yu
XLXiayong Liu
Xiayong Liu
BQBin Qiu
Bin Qiu
ALAshish kr. Luhach
Ashish kr. Luhach
VSVijayalakshmi Saravanan
Vijayalakshmi Saravanan

14 October 2022 in Frontiers in Genetics
Verified
Journal Article
Open access
YZYue Zhang
Yue Zhang
YHYuqing Hu
Yuqing Hu
Huihui LiHuihui Li
Huihui Li
XLXiayong Liu
Xiayong Liu
During the process of drug discovery, exploring drug-protein interactions (DPIs) is a key step. With the rapid development of biological data, computer-aided methods are much faster than biological experiments. Deep learning methods have become popular and are mainly used to extract the characteristics of drugs and proteins for further DPIs prediction. Since the prediction of DPIs through machine learning cannot fully extract effective features, in our work, we propose a deep learning framework that uses variational autoencoders and attention mechanisms; it utilizes convolutional neural networks (CNNs) to obtain local features and attention mechanisms to obtain important information about drugs and proteins, which is very important for predicting DPIs. Compared with some machine learning methods on the C.elegans and human datasets, our approach provides a better effect. On the BindingDB dataset, its accuracy (ACC) and area under the curve (AUC) reach 0.862 and 0.913, respectively. To verify the robustness of the model, multiclass classification tasks are performed on Davis and KIBA datasets, and the ACC values reach 0.850 and 0.841, respectively, thus further demonstrating the effectiveness of the model.

6 August 2015 in Circuits, Systems, and Signal Processing
Verified
Journal Article
Closed access
PDF file
XQXuan Qin
Xuan Qin
HFHuajing Fang
Huajing Fang
XLXiayong Liu
Xiayong Liu

10 December 2018 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
XLXiayong Liu
Xiayong Liu
AOAijia Ouyang
Aijia Ouyang
ZYZhong-hua Yun
Zhong-hua Yun
This paper proposes a fuzzy weighted least squares support vector regression (FW-LSSVR) with data reduction for nonlinear system modeling based only on the measured data. The proposed method combines the advantages of data reduction with some ideas of fuzzy weighted mechanism. It not only possesses the capability of illuminating local characteristic of the modeled plant but also can deal with the problem of boundary effects resulted from local LSSVR method when the modeled data is at the boundary of whole data subset. Furthermore, in comparison of the SVR, the proposed method only utilizes fewer hyperparameters to construct model, and the overlap factor λ can be chosen in relatively smaller value than SVR to further reduce more computational time. First of all, distilling the original input space into several regions with fuzzy partition by applying Gustafson-Kessel clustering algorithm (GKCA) is a foundation for data reduction and the overlap factor is introduced to reduce the size of subsets. Following that, those subset regression models (SRMs) which can be simultaneously solved by LSSVR are integrated into an overall output of the estimated nonlinear system by fuzzy weighted. Finally, the proposed method is demonstrated by experimental analysis and compared with local LSSVR, weighted SVR, and global LSSVR methods by using the index of computational time and root-mean-square error (RMSE).

6 September 2025 in Processes
Verified
Journal Article
Open access
PDF file
XLXiayong Liu
Xiayong Liu
QLQingyao Liu
Qingyao Liu
SLShunqiang Liu
Shunqiang Liu
GYGenglong Yan
Genglong Yan
FZFabin Zhang
Fabin Zhang
XYXiaoliu Yang
Xiaoliu Yang
This paper presents a novel support vector machine (SVM) classification approach that simultaneously accounts for both overall and extreme misclassification errors via a dual-norm regularization strategy. Traditional SVMs minimize the L1-norm of slack variables to control global misclassification, while least squares SVM (LSSVM) minimizes the sum of squared errors. In contrast, our method preserves the classical L1-norm penalty to maintain overall classification fidelity and incorporates an additional L∞-norm term to penalize the largest slack variable, thereby constraining the worst-case margin violation. This composite objective yields a more robust and generalizable classifier, particularly effective when occasional large deviations disproportionately affect decision boundaries. The resulting optimization problem minimizes a regularized objective combining the model norm, the sum of slack variables, and the maximum slack variable, with two hyperparameters, C1 and C2, balancing global error against extremal robustness. By formulating the problem under convex constraints, the optimization remains tractable and guarantees a globally optimal solution. Experimental evaluations on benchmark datasets demonstrate that the proposed method achieves comparable or superior classification accuracy while reducing the impact of outliers and maintaining a sparse model structure. These results underscore the advantage of jointly enforcing L1 and L∞ penalties, providing an effective mechanism to balance average performance with worst-case error sensitivity in support vector classification.