Yulei Huang

Dr. Yulei Huang

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
21 December 2023 in Axioms
Verified
Journal Article
Open access
PDF file
ZMZiping Ma
Ziping Ma
YHYulei Huang
Yulei Huang
HLHuirong Li
Huirong Li
JWJingyu Wang
Jingyu Wang
With the exponential growth of high dimensional unlabeled data, unsupervised feature selection (UFS) has attracted considerable attention due to its excellent performance in machine learning. Existing UFS methods implicitly assigned the same attribute score to each sample, which disregarded the distinctiveness of features and weakened the clustering performance of UFS methods to some extent. To alleviate these issues, a novel UFS method is proposed, named unsupervised feature selection with latent relationship penalty term (LRPFS). Firstly, latent learning is innovatively designed by assigning explicitly an attribute score to each sample according to its unique importance in clustering results. With this strategy, the inevitable noise interference can be removed effectively while retaining the intrinsic structure of data samples. Secondly, an appropriate sparse model is incorporated into the penalty term to further optimize its roles as follows: (1) It imposes potential constraints on the feature matrix to guarantee the uniqueness of the solution. (2) The interconnection between data instances is established by a pairwise relationship situation. Extensive experiments on benchmark datasets demonstrate that the proposed method is superior to relevant state-of-the-art algorithms with an average improvement of 10.17% in terms of accuracy.

16 August 2024 in Digital Signal Processing
Verified
Journal Article
Closed access
ZMZiping Ma
Ziping Ma
YWYilong Wei
Yilong Wei
YHYulei Huang
Yulei Huang
JWJingyu Wang
Jingyu Wang

22 September 2023 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
ZMZiping Ma
Ziping Ma
JWJingyu Wang
Jingyu Wang
HLHuirong Li
Huirong Li
YHYulei Huang
Yulei Huang

26 April 2025 in Digital Signal Processing
Verified
Journal Article
Closed access
ZMZiping Ma
Ziping Ma
YHYulei Huang
Yulei Huang
JMJinlin Ma
Jinlin Ma
HLHuirong Li
Huirong Li

19 June 2025 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
YHYulei Huang
Yulei Huang
JMJinlin Ma
Jinlin Ma
ZMZiping Ma
Ziping Ma
KLKe Lu
Ke Lu

22 January 2025 in Entropy
Verified
Journal Article
Open access
PDF file
YWYilong Wei
Yilong Wei
JMJinlin Ma
Jinlin Ma
ZMZiping Ma
Ziping Ma
YHYulei Huang
Yulei Huang
Subspace learning has achieved promising performance as a key technique for unsupervised feature selection. The strength of subspace learning lies in its ability to identify a representative subspace encompassing a cluster of features that are capable of effectively approximating the space of the original features. Nonetheless, most existing unsupervised feature selection methods based on subspace learning are constrained by two primary challenges. (1) Many methods only predominantly focus on the relationships between samples in the data space but ignore the correlated information between features in the feature space, which is unreliable for exploiting the intrinsic spatial structure. (2) Graph-based methods typically only take account of one-order neighborhood structures, neglecting high-order neighborhood structures inherent in original data, thereby failing to accurately preserve local geometric characteristics of the data. To pursue filling this gap in research, taking dual high-order graph learning into account, we propose a framework called subspace learning for dual high-order graph learning based on Boolean weight (DHBWSL). Firstly, a framework for unsupervised feature selection based on subspace learning is proposed, which is extended by dual-graph regularization to fully investigate geometric structure information on dual spaces. Secondly, the dual high-order graph is designed by embedding Boolean weights to learn a more extensive node from the original space such that the appropriate high-order adjacency matrix can be selected adaptively and flexibly. Experimental results on 12 public datasets demonstrate that the proposed DHBWSL outperforms the nine recent state-of-the-art algorithms.