Yulei Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yulei Huang has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Ziping Ma
School of Mathematics and Information Science, North Minzu University, Yinchuan, China
9 shared publications - Huirong Li
School of Mathematics and Computer Application, Shangluo University, Shangluo 726000, China
3 shared publications - Huanpu Zhang
School of computer science and engineering, North Minzu University, Yinchuan, China
2 shared publications - Jingyu Wang
School of Mathematics and Information Science, North Minzu University, Yinchuan 750030, China
2 shared publications Jinlin Ma
2 shared publicationsLibo Liu
2 shared publications
Latest Publications
- 8 April 2026
- Published by Elsevier in Advances In Space Research
- Vol. 77 (12) , 11801-11817
Deep feature learning framework embedded with latent relationship penalty term for remote sensing image classification
- 8 April 2026
- Published by Elsevier in Advances In Space Research
- Vol. 77 (12) , 11801-11817
Deep feature learning framework embedded with latent relationship penalty term for remote sensing image classification
- 25 March 2026
- Published by Elsevier in Information Sciences
- Vol. 745
Soft-label guided unsupervised feature selection with orthogonal anchor basis
- 25 March 2026
- Published by Elsevier in Information Sciences
- Vol. 745
Soft-label guided unsupervised feature selection with orthogonal anchor basis
- 1 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. 22 (6) , 2477-2490
SSC-PPI: A Subspace Structure Consistency-Based Method for Protein-Protein Interactions Prediction
Protein-protein interactions (PPIs) play an indispensable role in understanding disease-causing mechanisms, and the basic laws of food and drugs on life. Contemporary research on this issue, however, is incapable of guaranteeing structure consistency between extracted features and raw data, and fails to fully investigate the interconnection information of features. Thus, this paper proposes a subspace structure consistency-based method for protein-protein interactions prediction. SSC-PPI is not only capable of investigating the coherent relations between the encoded features generated from amino acid composition and conjoint triad numeric composition of F-vector, composition and transition descriptors, but also fully maintains the latent geometrical structure consistency between feature subspace and data space. Numerous comparative experiments demonstrate its excellent predictable performance with significant accuracies of 100%, 99.95%, 99.98%, 100% and 100% respectively on Helicobacter pylori, Human, Saccharomyces cerevisiae (core subset), Human-Bacillus Anthracis and Human-Yersinia pestis datasets, significantly outperforming the comparative models by average increases of 12.96%, 5.50%, 7.38%, 6.23% and 9.37% respectively. Additionally, SSC-PPI offers an efficient and reliable framework for large-scale prediction tasks such as drug-drug and drugfood interactions.
- 1 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. 22 (6) , 2477-2490
SSC-PPI: A Subspace Structure Consistency-Based Method for Protein-Protein Interactions Prediction
Protein-protein interactions (PPIs) play an indispensable role in understanding disease-causing mechanisms, and the basic laws of food and drugs on life. Contemporary research on this issue, however, is incapable of guaranteeing structure consistency between extracted features and raw data, and fails to fully investigate the interconnection information of features. Thus, this paper proposes a subspace structure consistency-based method for protein-protein interactions prediction. SSC-PPI is not only capable of investigating the coherent relations between the encoded features generated from amino acid composition and conjoint triad numeric composition of F-vector, composition and transition descriptors, but also fully maintains the latent geometrical structure consistency between feature subspace and data space. Numerous comparative experiments demonstrate its excellent predictable performance with significant accuracies of 100%, 99.95%, 99.98%, 100% and 100% respectively on Helicobacter pylori, Human, Saccharomyces cerevisiae (core subset), Human-Bacillus Anthracis and Human-Yersinia pestis datasets, significantly outperforming the comparative models by average increases of 12.96%, 5.50%, 7.38%, 6.23% and 9.37% respectively. Additionally, SSC-PPI offers an efficient and reliable framework for large-scale prediction tasks such as drug-drug and drugfood interactions.
- 5 July 2025
- Published by Elsevier in Neurocomputing
- Vol. 650
Enhanced non-negative matrix factorization via adaptive weighted bipartite graph learning for clustering problems
- 5 July 2025
- Published by Elsevier in Neurocomputing
- Vol. 650
Enhanced non-negative matrix factorization via adaptive weighted bipartite graph learning for clustering problems
- 19 June 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 158
Cascaded dimensionality reduction nonnegative matrix factorization for data representation
- 19 June 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 158
Cascaded dimensionality reduction nonnegative matrix factorization for data representation
- 26 April 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 164
Sparse dual-graph regularized quadratic dimensionality reduction algorithm based on subspace learning
- 26 April 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 164
Sparse dual-graph regularized quadratic dimensionality reduction algorithm based on subspace learning
- Open Access
Subspace Learning for Dual High-Order Graph Learning Based on Boolean Weight
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.
Open AccessSubspace Learning for Dual High-Order Graph Learning Based on Boolean Weight
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.
- 16 August 2024
- Published by Elsevier in Digital Signal Processing
- Vol. 155
Unsupervised feature selection based on minimum-redundant subspace learning with self-weighted adaptive graph
- 16 August 2024
- Published by Elsevier in Digital Signal Processing
- Vol. 155
Unsupervised feature selection based on minimum-redundant subspace learning with self-weighted adaptive graph
- Open Access
Unsupervised Feature Selection with Latent Relationship Penalty Term
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.
Open AccessUnsupervised Feature Selection with Latent Relationship Penalty Term
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.
- 22 September 2023
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (23) , 28054-28073
Adaptive graph regularized non-negative matrix factorization with self-weighted learning for data clustering
- 22 September 2023
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (23) , 28054-28073
Adaptive graph regularized non-negative matrix factorization with self-weighted learning for data clustering