452
Views
18
Downloads
12
Crossref
N/A
WoS
14
Scopus
0
CSCD
The identification of communities is imperative in the understanding of network structures and functions. Using community detection algorithms in biological networks, the community structure of biological networks can be determined, which is helpful in analyzing the topological structures and predicting the behaviors of biological networks. In this paper, we analyze the diseasome network using a new method called disease-gene network detecting algorithm based on principal component analysis, which can be used to investigate the connection between nodes within the same group. Experimental results on real-world networks have demonstrated that our algorithm is more efficient in detecting community structures when compared with other well-known results.
The identification of communities is imperative in the understanding of network structures and functions. Using community detection algorithms in biological networks, the community structure of biological networks can be determined, which is helpful in analyzing the topological structures and predicting the behaviors of biological networks. In this paper, we analyze the diseasome network using a new method called disease-gene network detecting algorithm based on principal component analysis, which can be used to investigate the connection between nodes within the same group. Experimental results on real-world networks have demonstrated that our algorithm is more efficient in detecting community structures when compared with other well-known results.
This research was supported in part by the Natural Science Foundation of Education Department of Jiangsu Province (No. 12KJB520019), the National Science Foundation of Jiangsu Province (No. BK20130452), Science and Technology Innovation Foundation of Yangzhou University (No. 2012CXJ026), the National Natural Science Foundation of China (Nos. 61070047, 61070133, and 61003180) and the National Key Basic Research and Development (973) Program of China (No. 2012CB316003).