Yan Xin

Ms. Yan Xin

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
11 May 2022 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
LSLijun Sun
Lijun Sun
BFBinbin Feng
Binbin Feng
TCTianfei Chen
Tianfei Chen
DZDongliang Zhao
Dongliang Zhao
YXYan Xin
Yan Xin
Grey wolf optimizer (GWO) is a global search algorithm based on grey wolf hunting activity. However, the traditional GWO is prone to fall into local optimum, affecting the performance of the algorithm. Therefore, to solve this problem, an equalized grey wolf optimizer with refraction opposite learning (REGWO) is proposed in this study. In REGWO, the issue about the low swarm population variety of GWO in the late iteration is well overcome by the opposing learning of refraction. In addition, the equilibrium pool strategy reduces the likelihood of wolves going to the local extremum. To investigate the effectiveness of REGWO, it is evaluated on 21 widely used benchmark functions and IEEE CEC 2019 test functions. Experimental results show/ that REGWO performs better than the other competitors on most benchmarks.

16 January 2023 in Electronics
Verified
Journal Article
Open access
PDF file
LSLijun Sun
Lijun Sun
YXYan Xin
Yan Xin
TCTianfei Chen
Tianfei Chen
BFBinbin Feng
Binbin Feng
In order to solve the low accuracy in rolling bearing fault diagnosis caused by irrelevant and redundant features, a feature selection method based on a clustering hybrid binary cuckoo search is proposed. First, the measured motor signal is processed by Hilbert–Huang transform technology to extract fault features. Second, a clustering hybrid initialization technique is given for feature selection, combining the Louvain algorithm and the feature number. Third, a mutation strategy based on Levy flight is proposed, which effectively utilizes high-quality information to guide subsequent searches. In addition, a dynamic abandonment probability is proposed based on population sorting, which can effectively retain high-quality solutions and accelerate the convergence of the algorithm. Experimental results from nine UCI datasets show the effectiveness of the proposed improvement strategy. The open-source bearing dataset is used to compare the fault diagnosis accuracy of different algorithms. The experimental results show that the diagnostic error rate of this method is only 1.13%, which significantly improves classification accuracy and effectively realizes feature dimension reduction in fault datasets. Compared to similar methods, the proposed method has better comprehensive performance.