Lin Yang

Dr. Lin Yang

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
13 June 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
LYLin Yang
Lin Yang
ZXZhe Xu
Zhe Xu
YLYanting Liu
Yanting Liu
GTGuozhong Tian
Guozhong Tian
Big Data is impacting and changing the way we live, and its core lies in the use of machine learning to extract valuable information from huge amounts of data. Optimization problems are a common problem in many steps of machine learning. In the face of complex optimization problems, evolutionary computation has shown advantages over traditional methods. Therefore, many researchers are working on improving the performance of algorithms for solving various optimization problems in machine learning. The equilibrium optimizer (EO) is a member of evolutionary computation and is inspired by the mass balance model in environmental engineering. Using particles and their concentrations as search agents, it simulates the process of finding equilibrium states for optimization. In this paper, we propose an improved equilibrium optimizer (IEO) based on a decreasing equilibrium pool. IEO provides more sources of information for particle updates and maintains a higher population diversity. It can discard some exploration in later stages to enhance exploitation, thus achieving a better search balance. The performance of IEO is verified using 29 benchmark functions from IEEE CEC2017, a dynamic economic dispatch problem, a spacecraft trajectory optimization problem, and an artificial neural network model training problem. In addition, the changes in population diversity and computational complexity brought by the proposed method are analyzed.

27 November 2025 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
ZXZhe Xu
Zhe Xu
BZBaohang Zhang
Baohang Zhang
JYJiatianyi Yu
Jiatianyi Yu
LYLin Yang
Lin Yang
FYFenggang Yuan
Fenggang Yuan
Shangce GaoShangce Gao
Shangce Gao
Feature selection (FS) is a critical preprocessing step that enhances classification performance while reducing computational cost and overfitting. Among various evolutionary algorithms, the artificial bee colony (ABC) algorithm shows promising performance for FS tasks. However, existing ABC-based FS methods often suffer from duplicate individuals in the population. These duplicates waste computational resources, slow convergence, and reduce population diversity. Complex feature interactions further compound these challenges and the risk of premature convergence, making it difficult to maintain an effective balance between exploration and exploitation. To address these limitations, we propose an improved ABC algorithm called DABC, which introduces a dedicated deduplication mechanism to enhance diversity and convergence efficiency. This mechanism consists of two tightly integrated stages: (i) a novel duplicate bee identifier that marks redundant individuals based on objective-level similarity, and (ii) a differential analysis that evaluates dissimilarities between duplicate bees and the overall population, guiding their adaptive update through weighted bitwise recombination. This joint strategy significantly reduces redundant evaluations, promotes diversity, and enhances the algorithm’s capacity to escape local optima. DABC is evaluated against seven state-of-the-art evolutionary algorithms across 24 benchmark classification datasets. Experimental results demonstrate that DABC achieves superior classification accuracy, faster convergence, and more compact feature subsets. It achieves the lowest mean classification error on nine datasets and ranks second on 11 others. Wilcoxon rank-sum tests confirm its statistical superiority over six baselines. AUC analysis further highlights its discriminative power, achieving 0.994 on Breast, 0.971 on MUSK1, and AUC \(\ge\) 0.91 on multi-class datasets such as URBAN1 and Vehicle. The effectiveness of its diversity-guided deduplication process is further validated through ablation studies and population diversity analysis. Overall, DABC presents a robust and efficient solution for FS, particularly in complex, high-dimensional settings.

27 February 2025 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
ZXZhe Xu
Zhe Xu
JYJiatianyi Yu
Jiatianyi Yu
BZBaohang Zhang
Baohang Zhang
LYLin Yang
Lin Yang
YLYanting Liu
Yanting Liu
Shangce GaoShangce Gao
Shangce Gao

23 January 2025 in Electronics
Verified
Journal Article
Open access
PDF file
LYLin Yang
Lin Yang
ZXZhe Xu
Zhe Xu
FYFenggang Yuan
Fenggang Yuan
YLYanting Liu
Yanting Liu
GTGuozhong Tian
Guozhong Tian
Numerous optimization problems exist in the design and operation of power systems, critical for efficient energy use, cost minimization, and system stability. With increasing energy demand and diversifying energy structures, these problems grow increasingly complex. Metaheuristic algorithms have been highlighted for their flexibility and effectiveness in addressing such complex problems. To further explore the theoretical support of metaheuristic algorithms for optimization problems in power systems, this paper proposes a novel algorithm, the Boston Consulting Group Matrix-based Equilibrium Optimizer (BCGEO), which integrates the Equilibrium Optimizer (EO) with the classic economic decision-making model, the Boston Consulting Group Matrix. This matrix is utilized to construct a model for evaluating the potential of individuals, aiding in the rational allocation of computational resources, thereby achieving a better balance between exploration and exploitation. In comparative experiments across various dimensions on CEC2017, the BCGEO demonstrated superior search performance over its peers. Furthermore, in dynamic economic dispatch, the BCGEO has shown strong optimization capabilities and potential in power system optimization problems. Additionally, the experimental results in the spacecraft trajectory optimization problem suggest its potential for broader application across various fields.

24 August 2026 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
PDF file
XQXiaosha Qi
Xiaosha Qi
LYLizhu Yang
Lizhu Yang
LYLin Yang
Lin Yang
ZXZhe Xu
Zhe Xu
GJGenlin Ji
Genlin Ji
In response to the challenge that industrial images contain excessively small defects, where anomalous images with subtle imperfections are prone to false detection or missed detection, especially when background content dominates and anomalous training samples are scarce, this paper proposes a method for industrial defect detection and localization based on small-sized objects. The proposed method comprises three stages: data preprocessing, training, and testing. In the data preprocessing stage, to more effectively extract informative regions, we employ a YOLOv11-guided object detector to crop regions of interest, eliminating redundant background information and reducing false positives. Additionally, to balance normal and anomalous data, we design a noise module that applies feature-space Gaussian perturbations to generate synthetic anomaly samples, enabling the model to better learn discriminative features. In the training stage, we freeze a WideResNet-50-2 backbone as a feature extractor, extract layer-2 and layer-3 patch embeddings, align and aggregate them, and train a lightweight discriminator with an H-Swish activation function and a margin loss. The H-Swish activation alleviates gradient explosion and vanishing, thereby improving representational capacity and training efficiency. In the testing stage, the discriminator classifies input images and produces pixel-wise anomaly scores for localization. We evaluate the proposed method on the detector-preprocessed MVTec AD dataset (all 15 classes) under a fixed schedule and single seed. Our method achieves 99.67% image AUROC, 99.63% image AUPR, 97.75% pixel AUROC and 58.61% pixel AUPR, substantially outperforming the SimpleNet baseline. On the VisA dataset (all 12 categories), our method attains 95.53% image AUROC, 96.98% image AUPR, 97.04% pixel AUROC, and 39.87% pixel AUPR. A controlled computational study shows that the downstream anomaly stage has 72.821 million parameters, 48.083 GFLOPs, and runs at 9.841 ms/image, comparable to the supplied SimpleNet baseline. Furthermore, same-checkpoint activation analysis reveals that H-Swish reduces the zero-gradient ratio from 75.193% to 53.611% and the zero-activation ratio from 50.293% to 0.902%, confirming its effectiveness at the discriminator level. Experimental results demonstrate that our method can effectively focus on important features of small targets while suppressing noise, leading to improved detection and localization accuracy. The achieved image-level AUROC of 99.67% (MVTec AD) shows significant performance improvement over related approaches in binary classification tasks.

14 November 2026 in Energies
Verified
Journal Article
Open access
PDF file
ZXZhe Xu
Zhe Xu
BZBaohang Zhang
Baohang Zhang
LYLin Yang
Lin Yang
FYFenggang Yuan
Fenggang Yuan
HZHan Zhang
Han Zhang
Previous studies have applied particle swarm optimization to coupled offshore wind farm layout and cable design and used geometry-guided genetic search to preserve spatial configurations during crossover. Transferring a successful relocation between layouts requires reassessing its wake and cable effects in the receiving layout. We propose cross-swarm recombination particle swarm optimization (CSRPSO) for offshore layouts with embedded capacity-constrained routing under a levelized cost of energy (LCOE) objective. Two swarms use wake interactions and cable connections to guide turbine relocations. Successful relocations are reconstructed in the other swarm’s personal-best layouts and compared with candidates generated from current layouts using complete LCOE evaluations. Six algorithms were compared across eight wind-farm cases over 30 repetitions per case, using matched seeds and initial populations, populations of 30 and 15,000 complete evaluations including initialization. CSRPSO achieved the lowest mean and median LCOE in every case, reducing mean LCOE by 0.041–0.697% versus adaptive replacement strategy-incorporated genetic learning particle swarm optimization (AGPSO), the closest baseline. At 10,000 evaluations, one-third below budget, its mean LCOE was below AGPSO’s final mean in every case. Mean annual energy production exceeded AGPSO’s in all eight cases, and mean cable expenditure was lower in six.