期刊名称：International Journal of Security and Its Applications
印刷版ISSN：1738-9976
出版年度：2012
卷号：6
期号：2
出版社：SERSC
摘要：Detecting protein complexes is an important way to discover the relationship between network topological structure and its functional features in protein-protein interaction (PPI) network. The spectral clustering method is a popular approach. However, how to select its optimal Laplacian matrix is still an open problem. Here, we analyzed the performances of three graph Laplacian matrices (unnormalized symmetric graph Laplacians,, normalized symmetric graph Laplacians and normalized random walk graph Laplacians, respectively) in yeast PPI network. The comparison shows that the performances of unnormalized and normalized symmetric graph Laplacian matrices are similar, and they are better than that of normalized random walk graph Laplacian matrix. It is helpful to choose proper graph Laplacian matrix for PPI networks’ analysis.
关键词：Protein-protein interaction network; Protein complex; Spectral clustering;method; Graph Laplacian matrix
