Wenming Wu

Wenming Wu

Auto-generated profile, based on publicly available information

Wenming Wu

School of Computer Science and Technology, Xidian University, Xian, Shaanxi, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
22 March 2022 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
WWWenming Wu
Wenming Wu
Xiaoke MaXiaoke Ma
Xiaoke Ma
Vast majority of current algorithms identify cell types by directly clustering transcriptional profiles, which ignore indirected relations among cells, resulting in an undesirable performance on cell type discovery and trajectory inference. In this study, we propose a network-based structural learning nonnegative matrix factorization algorithm (aka SLNMF) for the identification of cell types in scRNA-seq, which is transformed into a constrained optimization problem. SLNMF first constructs the similarity network for cells, and then extracts latent features of cell by exploiting the topological structure of cell-cell network. To improve the clustering performance, structural constraint is imposed on the model to learn the latent features of cells by preserving the structural information of the networks, thereby significantly improving performance of algorithms. Finally, we track the trajectory of cells by exploring the relation among cell types. Fourteen scRNA-seq datasets are adopted to validate the performance of algorithms with the number of single cells varying from 49 to 26,484. The experimental results demonstrate that SLNMF significantly outperforms thirteen state-of-the-art methods with an average 16.81% improvement in terms of accuracy, and it accurately identifies the trajectories of cells. The proposed model and methods provide an effective strategy to analyze scRNA-seq data.

24 July 2023 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
WWWenming Wu
Wenming Wu
WZWensheng Zhang
Wensheng Zhang
WHWeimin Hou
Weimin Hou
Xiaoke MaXiaoke Ma
Xiaoke Ma
Advances in single-cell biotechnologies have generated the single-cell RNA sequencing (scRNA-seq) of gene expression profiles at cell levels, providing an opportunity to study cellular distribution. Although significant efforts developed in their analysis, many problems remain in studying cell types distribution because of the heterogeneity, high dimensionality, and noise of scRNA-seq. In this study, a multi-view clustering with graph learning algorithm ( MCGL ) for scRNA-seq data is proposed, which consists of multi-view learning, graph learning, and cell type clustering. In order to avoid a single feature space of scRNA-seq being inadequate to comprehensively characterize the functions of cells, MCGL constructs the multiple feature spaces and utilizes multi-view learning to comprehensively characterize scRNA-seq data from different perspectives. MCGL adaptively learns the similarity graphs of cells that overcome the dependence on fixed similarity, transforming scRNA-seq analysis into the analysis of multi-view clustering. MCGL decomposes the networks of cells into view-specific and common networks in multi-view learning, which better characterizes the topological relationship of cells. MCGL simultaneously utilizes multiple types of cell-cell networks and fully exploits the connection relationship between cells through the complementarity between networks to improve clustering performance. The graph learning, graph factorization, and cell -type clustering processes are accomplished simultaneously under one optimization framework. The performance of the MCGL algorithm is validated with ten scRNA-seq datasets from different scales, and experimental results imply that the proposed algorithm significantly outperforms fourteen state-of-the-art scRNA-seq algorithms.

24 May 2022 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
Xiaoke MaXiaoke Ma
Xiaoke Ma
WZWei Zhao
Wei Zhao
WWWenming Wu
Wenming Wu
Multi-layer networks provide an effective and efficient tool to model and characterize the complex systems with multiple types of interactions, which differ greatly from the traditional single-layer networks. Graph clustering in multi-layer networks is highly non-trivial since it is difficult to balance the connectivity of clusters and connection of various layers. The current algorithms for the layer-specific clusters are criticized for the low accuracy and sensitivity to the perturbation of networks. To overcome these issues, a novel algorithm for layer-specific module in multi-layer networks based on nonnegative matrix factorization (LSNMF) is proposed by explicitly exploring the specific features of vertices. LSNMF first extract features of vertices in multi-layer networks by using nonnegative matrix factorization (NMF), and then decompose features of vertices into the common and specific components. The orthogonality constraint is imposed on the specific components to ensure the specificity of features of vertices, which provides a better strategy to characterize and model the structure of layer-specific modules. The extensive experiments demonstrate that the proposed algorithm dramatically outperforms state-of-the-art baselines in terms various measurements. Furthermore, LSNMF efficiently extracts stage-specific modules, which are more likely to enrich the known functions, and also associate with survival time of patients.

14 March 2022 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
WWWenming Wu
Wenming Wu
Maoguo GongMaoguo Gong
Maoguo Gong
Xiaoke MaXiaoke Ma
Xiaoke Ma
Complex systems in nature and society consist of various types of interactions, where each type of interaction belongs to a layer, resulting in the so-called multilayer networks. Identifying specific modules for each layer is of great significance for revealing the structure-function relations in multilayer networks. However, the available approaches are criticized undesirable because they fail to explicitly the specificity of modules, and balance the specificity and connectivity of modules. To overcome these drawbacks, we propose an accurate and flexible algorithm by joint learning matrix factorization and sparse representation (jMFSR) for specific modules in multilayer networks, where matrix factorization extracts features of vertices and sparse representation discovers specific modules. To exploit the discriminative latent features of vertices in multilayer networks, jMFSR incorporates linear discriminant analysis (LDA) into non-negative matrix factorization (NMF) to learn features of vertices that distinguish the categories. To explicitly measure the specificity of features, jMFSR decomposes features of vertices into common and specific parts, thereby enhancing the quality of features. Then, jMFSR jointly learns feature extraction, common-specific feature factorization, and clustering of multilayer networks. The experiments on 11 datasets indicate that jMFSR significantly outperforms state-of-the-art baselines in terms of various measurements.

31 May 2021 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
XYXiaohui Yang
Xiaohui Yang
WWWenming Wu
Wenming Wu
XXXin Xin
Xin Xin
LSLimin Su
Limin Su
LXLiugen Xue
Liugen Xue

28 November 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
WWWenming Wu
Wenming Wu
WZWensheng Zhang
Wensheng Zhang
MGMaoguo Gong
Maoguo Gong
Xiaoke MaXiaoke Ma
Xiaoke Ma
Multi-layer networks treat various types of interactions at each level to model complex systems in nature and society, and clustering of them is of great significance for revealing mechanisms of systems. Vast majority of current algorithms focus on identifying the common communities in clear multi-layer networks, and few attempt has been devoted to the detection of layer-specific communities in noised ones. To address these issues, a joint learning algorithm with G raph D enoising and S tructure L earning (called GDSL ) for the detection of layer-specific communities in noised multi-layer networks is proposed, which simultaneously integrates graph denoising, structure learning, and module detection. To remove noise of networks, GDSL re-constructs affinity graphs for the original ones by preserving community structure. To enhance robustness and discriminative of features, GDSL explores the relations of features among various layers with the Hilbert-Schmidt Independence Criterion and structure learning. Finally, GDSL joins all these procedures with an objective function, and deduces optimization rules. The results show that GDSL not only significantly outperforms baselines but also enhances the robustness of the algorithm, providing an effective model for community detection in noised multi-layer networks.