期刊
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS
卷 18, 期 2, 页码 797-803出版社
IEEE COMPUTER SOC
DOI: 10.1109/TCBB.2019.2944809
关键词
Proteins; Protein engineering; Clustering algorithms; Biological system modeling; Computational modeling; Social networking (online); Data models; Protein complexes detection; network embedding; deep learning
类别
资金
- National Natural Science Foundation of China [61877020, 61772211]
The study proposes a semi-supervised network embedding model using graph convolutional networks to effectively detect densely connected subgraphs for protein complexes in protein-protein interaction networks. Experimental results demonstrate that this approach significantly outperforms other methods on various data sizes and densities of PPI networks.
A protein complex is a group of associated polypeptide chains which plays essential roles in the biological process. Given a graph representing protein-protein interactions (PPI) network, it is critical but non-trivial to detect protein complexes, the subsets of proteins that are tightly coupled, from it. Network embedding is a technique to learn low-dimensional representations of vertices in networks. It has been proved quite useful for community detection in social networks in recent years. However, unlike social networks, PPI network does not contain rich metadata, so that existing network embedding methods cannot fully capture the network structure of PPI to improve the effect of protein complexes detection significantly. We propose a semi-supervised network embedding model by adopting graph convolutional networks to detect densely connected subgraphs effectively. We compare the performance of our model with state-of-the-art approaches on three popular PPI networks with various data sizes and densities. The experimental results show that our approach significantly outperforms other approaches on all three PPI networks.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据