Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
