Journal
MATHEMATICAL AND COMPUTER MODELLING
Volume 52, Issue 11-12, Pages 2066-2074Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.mcm.2010.06.015
Keywords
Spectral clustering; Protein complex; PPI networks
Ask authors/readers for more resources
In this paper, we study spectral clustering for detecting protein complexes in PPI (protein-protein interaction) networks, focusing on two open issues: (i) constructing similarity graphs; and (ii) determining the number of clusters. First, we study four similarity graphs to construct graph Laplacian matrices. Then we propose a method to determine the number of clusters based on the properties of PPI networks. Experimental results on PPI networks from DIP data and MIPS data indicate that each similarity graph shows its strengths and disadvantages, and our finding of the number of clusters improves the clustering quality. Finally, spectral clustering obtains results in detecting protein complexes that are comparable to those obtained from several other typical algorithms. (C) 2010 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available