Linzi Yin

Dr. Linzi Yin

Associate Professor, School of Physics and Electronics, Central South University, Changsha 410017, China
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
17 May 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Linzi YinLinzi Yin
Linzi Yin
KCken chen
ken chen
Zhaohui JiangZhaohui Jiang
Zhaohui Jiang
XXxuemei xu
xuemei xu
To improve the computational efficiency and classification accuracy in the context of big data, an optimized parallel random forest algorithm is proposed based on the Spark computing framework. First, a new Gini coefficient is defined to reduce the impact of feature redundancy for higher classification accuracy. Next, to reduce the number of candidate split points and Gini coefficient calculations for continuous features, an approximate equal-frequency binning method is proposed to determine the optimal split points efficiently. Finally, based on Apache Spark computing framework, the forest sampling index (FSI) table is defined to speed up the parallel training process of decision trees and reduce data communication overhead. Experimental results show that the proposed algorithm improves the efficiency of constructing random forests while ensuring classification accuracy, and is superior to Spark-MLRF in terms of performance and scalability.

1 June 2024 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
Linzi YinLinzi Yin
Linzi Yin
KCKe Cao
Ke Cao
ZJZhaohui Jiang
Zhaohui Jiang
ZLZhanqi Li
Zhanqi Li

Verified
Journal Article
Open access
PDF file
JHJun He
Jun He
ZLZhanqi Li
Zhanqi Li
Linzi YinLinzi Yin
Linzi Yin
Random Forests are powerful machine learning models widely applied in classification and regression tasks due to their robust predictive performance. Nevertheless, traditional Random Forests face computational challenges during tree construction, particularly in high-dimensional data or on resource-constrained devices. In this paper, a novel node-splitting algorithm, BayesSplit, is proposed to accelerate decision tree construction via a Bayesian-based impurity estimation framework. BayesSplit treats impurity reduction as a Bernoulli event with Beta-conjugate priors for each split point and incorporates two main strategies. First, Dynamic Posterior Parameter Refinement updates the Beta parameters based on observed impurity reductions in batch iterations. Second, Posterior-Derived Confidence Bounding establishes statistical confidence intervals, efficiently filtering out suboptimal splits. Theoretical analysis demonstrates that BayesSplit converges to optimal splits with high probability, while experimental results show up to a 95% reduction in training time compared to baselines and maintains or exceeds generalization performance. Compared to the state-of-the-art MABSplit, BayesSplit achieves similar accuracy on classification tasks and reduces regression training time by 20–70% with lower MSEs. Furthermore, BayesSplit enhances feature importance stability by up to 40%, making it particularly suitable for deployment in computationally constrained environments.

6 March 2025 in Technologies
Verified
Journal Article
Open access
PDF file
Linzi YinLinzi Yin
Linzi Yin
CLCong Luo
Cong Luo
LLLing Liu
Ling Liu
JCJunfeng Cui
Junfeng Cui
ZLZhiming Liu
Zhiming Liu
GSGuoying Sun
Guoying Sun
In order to solve the testing and verification problems at the early development stage of a high-speed Maglev positioning and speed measurement system (MPSS), a hardware-in-the-loop (HIL) simulation platform is presented, which includes induction loops, transmitting antennas, a power driver unit, a simulator based on a field-programmable gate array (FPGA), a host computer, etc. This HIL simulation platform simulates the operation of a high-speed Maglev train and generates the related loop-induced signals to test the performance of a real ground signal processing unit (GSPU). Furthermore, an absolute position detection method based on Gray-coded loops is proposed to identify which Gray-coded period the train is in. A relative position detection method based on height compensation is also proposed to calculate the exact position of the train in a Gray-coded period. The experimental results show that the positioning error is only 2.58 mm, and the speed error is 6.34 km/h even in the 600 km/h condition. The proposed HIL platform also effectively simulates the three kinds of operation modes of high-speed Maglev trains, which verifies the effectiveness and practicality of the HIL simulation strategy. This provides favorable conditions for the development and early validation of high-speed MPSS.

31 March 2023 in Entropy
Verified
Journal Article
Open access
PDF file
RCRui Cheng
Rui Cheng
Linzi YinLinzi Yin
Linzi Yin
Zhaohui JiangZhaohui Jiang
Zhaohui Jiang
XXxuemei xu
xuemei xu
Gate-level circuit partitioning is an important development trend for improving the efficiency of simulation in EDA software. In this paper, a gate-level circuit partitioning algorithm, based on clustering and an improved genetic algorithm, is proposed for the gate-level simulation task. First, a clustering algorithm based on betweenness centrality is proposed to quickly identify clusters in the original circuit and achieve the circuit coarse. Next, a constraint-based genetic algorithm is proposed which provides absolute and probabilistic genetic strategies for clustered circuits and other circuits, respectively. This new genetic strategy guarantees the integrity of clusters and is effective for realizing the fine partitioning of gate-level circuits. The experimental results using 12 ISCAS ‘89 and ISCAS ‘85 benchmark circuits show that the proposed algorithm is 5% better than Metis, 80% better than KL, and 61% better than traditional genetic algorithms for finding the minimum number of connections between subsets.

17 July 2020 in Symmetry
Verified
Journal Article
Open access
PDF file
Linzi YinLinzi Yin
Linzi Yin
Zhaohui JiangZhaohui Jiang
Zhaohui Jiang
Attribute reduction is one of the challenging problems in rough set theory. To accomplish an efficient reduction algorithm, this paper analyzes the shortcomings of the traditional methods based on attribute significance, and suggests a novel reduction way where the traditional attribute significance calculation is replaced by a special core attribute calculation. A decision table called the positive region sort ascending decision table (PR-SADT) is defined to optimize some key steps of the novel reduction method, including the special core attribute calculation, positive region calculation, etc. On this basis, a fast reduction algorithm is presented to obtain a complete positive region reduct. Experimental tests demonstrate that the novel reduction algorithm achieves obviously high computational efficiency.