Zhenxia Xue

Dr. Zhenxia Xue


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
2 November 2018 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
ZXZhenxia Xue
Zhenxia Xue
RZRoxin Zhang
Roxin Zhang
CQChuandong Qin
Chuandong Qin
XZXiaoqing Zeng
Xiaoqing Zeng

19 September 2024 in Symmetry
Verified
Journal Article
Open access
PDF file
ZXZhenxia Xue
Zhenxia Xue
YWYan Wang
Yan Wang
YRYuwen Ren
Yuwen Ren
XZXinyuan Zhang
Xinyuan Zhang
As a novel learning algorithm for feedforward neural networks, the twin extreme learning machine (TELM) boasts advantages such as simple structure, few parameters, low complexity, and excellent generalization performance. However, it employs the squared L2-norm metric and an unbounded hinge loss function, which tends to overstate the influence of outliers and subsequently diminishes the robustness of the model. To address this issue, scholars have proposed the bounded capped L2,p-norm metric, which can be flexibly adjusted by varying the p value to adapt to different data and reduce the impact of noise. Therefore, we substitute the metric in the TELM with the capped L2,p-norm metric in this paper. Furthermore, we propose a bounded, smooth, symmetric, and noise-insensitive squared fractional loss (SF-loss) function to replace the hinge loss function in the TELM. Additionally, the TELM neglects statistical information in the data; thus, we incorporate the Fisher regularization term into our model to fully exploit the statistical characteristics of the data. Drawing upon these merits, a squared fractional loss-based robust supervised twin extreme learning machine (SF-RSTELM) model is proposed by integrating the capped L2,p-norm metric, SF-loss, and Fisher regularization term. The model shows significant effectiveness in decreasing the impacts of noise and outliers. However, the proposed model’s non-convexity poses a formidable challenge in the realm of optimization. We use an efficient iterative algorithm to solve it based on the concave-convex procedure (CCCP) algorithm and demonstrate the convergence of the proposed algorithm. Finally, to verify the algorithm’s effectiveness, we conduct experiments on artificial datasets, UCI datasets, image datasets, and NDC large datasets. The experimental results show that our model is able to achieve higher ACC and F1 scores across most datasets, with improvements ranging from 0.28% to 4.5% compared to other state-of-the-art algorithms.

23 May 2018 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
ZXZhenxia Xue
Zhenxia Xue
RZRoxin Zhang
Roxin Zhang
CQChuandong Qin
Chuandong Qin
XZXiaoqing Zeng
Xiaoqing Zeng

5 June 2024 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
ZXZhenxia Xue
Zhenxia Xue
CZChongning Zhao
Chongning Zhao
SWShuqing Wei
Shuqing Wei
JMJun Ma
Jun Ma
SLShouhe Lin
Shouhe Lin

1 January 2009
Verified
Conference Paper
Closed access
ZXZhenxia Xue
Zhenxia Xue
SLSanyang Liu
Sanyang Liu
With the help of some labeled samples and rough C-means clustering, a rough-based semi-supervised outlier detection (RBSSOD) is proposed, which integrates the advantage of semi-supervised outlier detection (SSOD) and rough C-means clustering. This method takes into account the information of labeled points, as well as the points located in boundary area of each cluster, which can be further discussed the possibility to be reassigned as outliers. Experiment results show that our method not only keep, or improve precision and false alarm rate but also speed up the learning process.

6 October 2013 in Multidimensional Systems and Signal Processing
Verified
Journal Article
Closed access
PDF file
ZYZhuliang Yu
Zhuliang Yu
BFBao Feng
Bao Feng
ZGZhenghui Gu
Zhenghui Gu
ZXZhenxia Xue
Zhenxia Xue
YLYuanqing Li
Yuanqing Li
CWCong Wang
Cong Wang