A Seed Expansion Graph Clustering Method for Protein Complexes Detection in Protein Interaction Networks.

Most proteins perform their biological functions while interacting as complexes. The detection of protein complexes is an important task not only for understanding the relationship between functions and structures of biological network, but also for predicting the function of unknown proteins. We present a new nodal metric by integrating its local topological information. The metric reflects its representability in a larger local neighborhood to a cluster of a protein interaction (PPI) network. Based on the metric, we propose a seed-expansion graph clustering algorithm (SEGC) for protein complexes detection in PPI networks. A roulette wheel strategy is used in the selection of the seed to enhance the diversity of clustering. For a candidate node , we define its closeness to a cluster , denoted as (, ), by combing the density of a cluster and the connection between a node and . In SEGC, a cluster which initially consists of only a seed node, is extended by adding nodes recursively from its neighbors according to the closeness, until all neighbors fail the process of expansion. We compare the -measure and accuracy of the proposed SEGC algorithm with other algorithms on protein interaction networks. The experimental results show that SEGC outperforms other algorithms under full coverage.