Maoqiang Xie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Maoqiang Xie has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
Xin Fan
Nankai University
3 shared publicationsYalou Huang
Tianjin International Joint Academy of Biomedicine
3 shared publications- Yalou Huang
College of Software, Nankai University, Tianjin, China
3 shared publications Yaogong Zhang
Nankai University
3 shared publicationsJiahui Liu
College of Software, Nankai University, Tianjin, 300071, China
2 shared publicationsLin Wang
College of Software, Nankai University, Tianjin, China
2 shared publications
Latest Publications
- Open Access
- 1 December 2022
- Published by Springer Nature in BMC Genomics
- Vol. 23 (S6) , 1-15
Mining functional gene modules by multi-view NMF of phenome-genome association
Background: Mining functional gene modules from genomic data is an important step to detect gene members of pathways or other relations such as protein-protein interactions. This work explores the plausibility of detecting functional gene modules by factorizing gene-phenotype association matrix from the phenotype ontology data rather than the conventionally used gene expression data. Recently, the hierarchical structure of phenotype ontologies has not been sufficiently utilized in gene clustering while functionally related genes are consistently associated with phenotypes on the same path in phenotype ontologies. Results: This work demonstrates a hierarchical Nonnegative Matrix Factorization (NMF) framework, called Consistent Multi-view Nonnegative Matrix Factorization (CMNMF), which factorizes genome-phenome association matrix at consecutive levels of the hierarchical structure in phenotype ontology to mine functional gene modules. CMNMF constrains the gene clusters from the association matrices at two consecutive levels to be consistent since the genes are annotated with both the child-level phenotypes and the parent-level phenotypes in two levels. CMNMF also restricts the identified gene clusters to be densely connected in the phenotype ontology hierarchy. In the experiments on mining functionally related genes from mouse phenotype ontology and human phenotype ontology, CMNMF effectively improves clustering performance over the baseline methods. Gene ontology enrichment analysis is also conducted to verify its practical effectiveness to reveal meaningful gene modules. Conclusions: Utilizing the information in the hierarchical structure of phenotype ontology, CMNMF can identify functional gene modules with more biological significance than conventional methods. CMNMF can also be a better tool for predicting members of gene pathways and protein-protein interactions.
- 1 December 2022
- Published by Springer Nature in BMC Genomics
- Vol. 23 (S6) , 1-15
Open AccessMining functional gene modules by multi-view NMF of phenome-genome association
Background: Mining functional gene modules from genomic data is an important step to detect gene members of pathways or other relations such as protein-protein interactions. This work explores the plausibility of detecting functional gene modules by factorizing gene-phenotype association matrix from the phenotype ontology data rather than the conventionally used gene expression data. Recently, the hierarchical structure of phenotype ontologies has not been sufficiently utilized in gene clustering while functionally related genes are consistently associated with phenotypes on the same path in phenotype ontologies. Results: This work demonstrates a hierarchical Nonnegative Matrix Factorization (NMF) framework, called Consistent Multi-view Nonnegative Matrix Factorization (CMNMF), which factorizes genome-phenome association matrix at consecutive levels of the hierarchical structure in phenotype ontology to mine functional gene modules. CMNMF constrains the gene clusters from the association matrices at two consecutive levels to be consistent since the genes are annotated with both the child-level phenotypes and the parent-level phenotypes in two levels. CMNMF also restricts the identified gene clusters to be densely connected in the phenotype ontology hierarchy. In the experiments on mining functionally related genes from mouse phenotype ontology and human phenotype ontology, CMNMF effectively improves clustering performance over the baseline methods. Gene ontology enrichment analysis is also conducted to verify its practical effectiveness to reveal meaningful gene modules. Conclusions: Utilizing the information in the hierarchical structure of phenotype ontology, CMNMF can identify functional gene modules with more biological significance than conventional methods. CMNMF can also be a better tool for predicting members of gene pathways and protein-protein interactions.
- 9 May 2021
- Published by Springer Nature
- p. 117-128
A Hierarchical Structure-Aware Embedding Method for Predicting Phenotype-Gene Associations
- 9 May 2021
- Published by Springer Nature
- p. 117-128
A Hierarchical Structure-Aware Embedding Method for Predicting Phenotype-Gene Associations
- 19 June 2018
- Published by Springer Nature
- p. 348-360
Neighborhood Constraint Matrix Completion for Drug-Target Interaction Prediction
- 19 June 2018
- Published by Springer Nature
- p. 348-360
Neighborhood Constraint Matrix Completion for Drug-Target Interaction Prediction
- 24 April 2018
- Published by Springer Nature in Interdisciplinary Sciences: Computational Life Sciences
- Vol. 10 (3) , 572-582
GC $^2$ 2 NMF: A Novel Matrix Factorization Framework for Gene–Phenotype Association PredictionGene–phenotype association prediction can be applied to reveal the inherited basis of human diseases and facilitate drug development. Gene–phenotype associations are related to complex biological processes and influenced by various factors, such as relationship between phenotypes and that among genes. While due to sparseness of curated gene–phenotype associations and lack of integrated analysis of the joint effect of multiple factors, existing applications are limited to prediction accuracy and potential gene–phenotype association detection. In this paper, we propose a novel method by exploiting weighted graph constraint learned from hierarchical structures of phenotype data and group prior information among genes by inheriting advantages of Non-negative Matrix Factorization (NMF), called Weighted Graph Constraint and Group Centric Non-negative Matrix Factorization (GC\(^2\)NMF). Specifically, first we introduce the depth of parent–child relationships between two adjacent phenotypes in hierarchical phenotypic data as weighted graph constraint for a better phenotype understanding. Second, we utilize intra-group correlation among genes in a gene group as group constraint for gene understanding. Such information provides us with the intuition that genes in a group probably result in similar phenotypes. The model not only allows us to achieve a high-grade prediction performance, but also helps us to learn interpretable representation of genes and phenotypes simultaneously to facilitate future biological analysis. Experimental results on biological gene–phenotype association datasets of mouse and human demonstrate that GC\(^2\)NMF can obtain superior prediction accuracy and good understandability for biological explanation over other state-of-the-arts methods.- 24 April 2018
- Published by Springer Nature in Interdisciplinary Sciences: Computational Life Sciences
- Vol. 10 (3) , 572-582
GC $^2$ 2 NMF: A Novel Matrix Factorization Framework for Gene–Phenotype Association PredictionGene–phenotype association prediction can be applied to reveal the inherited basis of human diseases and facilitate drug development. Gene–phenotype associations are related to complex biological processes and influenced by various factors, such as relationship between phenotypes and that among genes. While due to sparseness of curated gene–phenotype associations and lack of integrated analysis of the joint effect of multiple factors, existing applications are limited to prediction accuracy and potential gene–phenotype association detection. In this paper, we propose a novel method by exploiting weighted graph constraint learned from hierarchical structures of phenotype data and group prior information among genes by inheriting advantages of Non-negative Matrix Factorization (NMF), called Weighted Graph Constraint and Group Centric Non-negative Matrix Factorization (GC\(^2\)NMF). Specifically, first we introduce the depth of parent–child relationships between two adjacent phenotypes in hierarchical phenotypic data as weighted graph constraint for a better phenotype understanding. Second, we utilize intra-group correlation among genes in a gene group as group constraint for gene understanding. Such information provides us with the intuition that genes in a group probably result in similar phenotypes. The model not only allows us to achieve a high-grade prediction performance, but also helps us to learn interpretable representation of genes and phenotypes simultaneously to facilitate future biological analysis. Experimental results on biological gene–phenotype association datasets of mouse and human demonstrate that GC\(^2\)NMF can obtain superior prediction accuracy and good understandability for biological explanation over other state-of-the-arts methods.- Open Access
- 8 February 2018
- Published by Springer Nature in BMC Bioinformatics
- Vol. 19 (1) , 1-12
Prioritizing disease genes with an improved dual label propagation framework
Prioritizing disease genes is trying to identify potential disease causing genes for a given phenotype, which can be applied to reveal the inherited basis of human diseases and facilitate drug development. Our motivation is inspired by label propagation algorithm and the false positive protein-protein interactions that exist in the dataset. To the best of our knowledge, the false positive protein-protein interactions have not been considered before in disease gene prioritization. Label propagation has been successfully applied to prioritize disease causing genes in previous network-based methods. These network-based methods use basic label propagation, i.e. random walk, on networks to prioritize disease genes in different ways. However, all these methods can not deal with the situation in which plenty false positive protein-protein interactions exist in the dataset, because the PPI network is used as a fixed input in previous methods. This important characteristic of data source may cause a large deviation in results. A novel network-based framework IDLP is proposed to prioritize candidate disease genes. IDLP effectively propagates labels throughout the PPI network and the phenotype similarity network. It avoids the method falling when few disease genes are known. Meanwhile, IDLP models the bias caused by false positive protein interactions and other potential factors by treating the PPI network matrix and the phenotype similarity matrix as the matrices to be learnt. By amending the noises in training matrices, it improves the performance results significantly. We conduct extensive experiments over OMIM datasets, and IDLP has demonstrated its effectiveness compared with eight state-of-the-art approaches. The robustness of IDLP is also validated by doing experiments with disturbed PPI network. Furthermore, We search the literatures to verify the predicted new genes got by IDLP are associated with the given diseases, the high prediction accuracy shows IDLP can be a powerful tool to help biologists discover new disease genes. IDLP model is an effective method for disease gene prioritization, particularly for querying phenotypes without known associated genes, which would be greatly helpful for identifying disease genes for less studied phenotypes.
- 8 February 2018
- Published by Springer Nature in BMC Bioinformatics
- Vol. 19 (1) , 1-12
Open AccessPrioritizing disease genes with an improved dual label propagation framework
Prioritizing disease genes is trying to identify potential disease causing genes for a given phenotype, which can be applied to reveal the inherited basis of human diseases and facilitate drug development. Our motivation is inspired by label propagation algorithm and the false positive protein-protein interactions that exist in the dataset. To the best of our knowledge, the false positive protein-protein interactions have not been considered before in disease gene prioritization. Label propagation has been successfully applied to prioritize disease causing genes in previous network-based methods. These network-based methods use basic label propagation, i.e. random walk, on networks to prioritize disease genes in different ways. However, all these methods can not deal with the situation in which plenty false positive protein-protein interactions exist in the dataset, because the PPI network is used as a fixed input in previous methods. This important characteristic of data source may cause a large deviation in results. A novel network-based framework IDLP is proposed to prioritize candidate disease genes. IDLP effectively propagates labels throughout the PPI network and the phenotype similarity network. It avoids the method falling when few disease genes are known. Meanwhile, IDLP models the bias caused by false positive protein interactions and other potential factors by treating the PPI network matrix and the phenotype similarity matrix as the matrices to be learnt. By amending the noises in training matrices, it improves the performance results significantly. We conduct extensive experiments over OMIM datasets, and IDLP has demonstrated its effectiveness compared with eight state-of-the-art approaches. The robustness of IDLP is also validated by doing experiments with disturbed PPI network. Furthermore, We search the literatures to verify the predicted new genes got by IDLP are associated with the given diseases, the high prediction accuracy shows IDLP can be a powerful tool to help biologists discover new disease genes. IDLP model is an effective method for disease gene prioritization, particularly for querying phenotypes without known associated genes, which would be greatly helpful for identifying disease genes for less studied phenotypes.
- Open Access
Mining Functional Modules by Multiview-NMF of Phenome-Genome Association
Background: Mining gene modules from genomic data is an important step to detect gene members of pathways or other relations such as protein-protein interactions. In this work, we explore the plausibility of detecting gene modules by factorizing gene-phenotype associations from a phenotype ontology rather than the conventionally used gene expression data. In particular, the hierarchical structure of ontology has not been sufficiently utilized in clustering genes while functionally related genes are consistently associated with phenotypes on the same path in the phenotype ontology. Results: We propose a hierarchal Nonnegative Matrix Factorization (NMF)-based method, called Consistent Multiple Nonnegative Matrix Factorization (CMNMF), to factorize genome-phenome association matrix at two levels of the hierarchical structure in phenotype ontology for mining gene functional modules. CMNMF constrains the gene clusters from the association matrices at two consecutive levels to be consistent since the genes are annotated with both the child phenotype and the parent phenotype in the consecutive levels. CMNMF also restricts the identified phenotype clusters to be densely connected in the phenotype ontology hierarchy. In the experiments on mining functionally related genes from mouse phenotype ontology and human phenotype ontology, CMNMF effectively improved clustering performance over the baseline methods. Gene ontology enrichment analysis was also conducted to reveal interesting gene modules. Conclusions: Utilizing the information in the hierarchical structure of phenotype ontology, CMNMF can identify functional gene modules with more biological significance than the conventional methods. CMNMF could also be a better tool for predicting members of gene pathways and protein-protein interactions. Availability: https://github.com/nkiip/CMNMF
Open AccessMining Functional Modules by Multiview-NMF of Phenome-Genome Association
Background: Mining gene modules from genomic data is an important step to detect gene members of pathways or other relations such as protein-protein interactions. In this work, we explore the plausibility of detecting gene modules by factorizing gene-phenotype associations from a phenotype ontology rather than the conventionally used gene expression data. In particular, the hierarchical structure of ontology has not been sufficiently utilized in clustering genes while functionally related genes are consistently associated with phenotypes on the same path in the phenotype ontology. Results: We propose a hierarchal Nonnegative Matrix Factorization (NMF)-based method, called Consistent Multiple Nonnegative Matrix Factorization (CMNMF), to factorize genome-phenome association matrix at two levels of the hierarchical structure in phenotype ontology for mining gene functional modules. CMNMF constrains the gene clusters from the association matrices at two consecutive levels to be consistent since the genes are annotated with both the child phenotype and the parent phenotype in the consecutive levels. CMNMF also restricts the identified phenotype clusters to be densely connected in the phenotype ontology hierarchy. In the experiments on mining functionally related genes from mouse phenotype ontology and human phenotype ontology, CMNMF effectively improved clustering performance over the baseline methods. Gene ontology enrichment analysis was also conducted to reveal interesting gene modules. Conclusions: Utilizing the information in the hierarchical structure of phenotype ontology, CMNMF can identify functional gene modules with more biological significance than the conventional methods. CMNMF could also be a better tool for predicting members of gene pathways and protein-protein interactions. Availability: https://github.com/nkiip/CMNMF
- 8 April 2017
- Published by Springer Nature in Interdisciplinary Sciences: Computational Life Sciences
- Vol. 10 (1) , 189-194
Metrical Consistency NMF for Predicting Gene–Phenotype Associations
Discovering gene–phenotype associations is significant to understand the disease mechanisms. Nonnegative matrix factorization (NMF) has been widely used in computational biology for its good performance and interpretability. In this paper, we proposed a novel metrical consistency NMF (MCNMF) method for candidate gene prioritization. The MCNMF method assume that phenotype similarities, calculated from various independent ways, should be consistent in case that the associations between genes and phenotypes are completely known. Experiment results show that our method can recover the gene–phenotype associations effectively and outperform the comparative methods.
- 8 April 2017
- Published by Springer Nature in Interdisciplinary Sciences: Computational Life Sciences
- Vol. 10 (1) , 189-194
Metrical Consistency NMF for Predicting Gene–Phenotype Associations
Discovering gene–phenotype associations is significant to understand the disease mechanisms. Nonnegative matrix factorization (NMF) has been widely used in computational biology for its good performance and interpretability. In this paper, we proposed a novel metrical consistency NMF (MCNMF) method for candidate gene prioritization. The MCNMF method assume that phenotype similarities, calculated from various independent ways, should be consistent in case that the associations between genes and phenotypes are completely known. Experiment results show that our method can recover the gene–phenotype associations effectively and outperform the comparative methods.
- 26 October 2012
- Published by Springer Nature in Soft Computing
- Vol. 17 (3) , 421-429
Supervised rank aggregation based on query similarity for document retrieval
- 26 October 2012
- Published by Springer Nature in Soft Computing
- Vol. 17 (3) , 421-429
Supervised rank aggregation based on query similarity for document retrieval
- 9 August 2012
- Published by Elsevier in Information Processing & Management
- Vol. 49 (1) , 158-168
Rank hash similarity for fast similarity search
- 9 August 2012
- Published by Elsevier in Information Processing & Management
- Vol. 49 (1) , 158-168
Rank hash similarity for fast similarity search
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1149-1152
New Class Recognition Based on Support Vector Data Description
In online classification tasks, such as credit evaluation, spam detection and intrusion detection, new class of patterns sometimes emerges. In order to adapt classifier to the change of distribution, recognition of new class becomes a key problem. To deal with this problem, this paper proposes a novel method based on support vector data description. This method detects and recognizes new class by the description of known classes. The experimental results show that the proposed method can recognize new class well, and on the basis of this technology online classifier is adapted to the change well
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1149-1152
New Class Recognition Based on Support Vector Data Description
In online classification tasks, such as credit evaluation, spam detection and intrusion detection, new class of patterns sometimes emerges. In order to adapt classifier to the change of distribution, recognition of new class becomes a key problem. To deal with this problem, this paper proposes a novel method based on support vector data description. This method detects and recognizes new class by the description of known classes. The experimental results show that the proposed method can recognize new class well, and on the basis of this technology online classifier is adapted to the change well