✦ LIBER ✦

A spectral clustering-based framework for detecting community structures in complex networks

✍ Scribed by Jeffrey Q. Jiang; Andreas W.M. Dress; Genke Yang

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 566 KB
Volume: 22
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.02.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A very fast algorithm for detecting comm

A very fast algorithm for detecting community structures in complex networks

✍ Xutao Wang; Guanrong Chen; Hongtao Lu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 362 KB

Detecting community structure in complex

Detecting community structure in complex networks based on a measure of information discrepancy

✍ Junhua Zhang; Shihua Zhang; Xiang-Sun Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Spectral clustering for detecting protei

Spectral clustering for detecting protein complexes in protein–protein interaction (PPI) networks

✍ Guimin Qin; Lin Gao 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 416 KB

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

A vector partitioning approach to detect

A vector partitioning approach to detecting community structure in complex networks

✍ Gaoxia Wang; Yi Shen; Ming Ouyang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 665 KB

In recent years, the problem of community structure detection has attracted more and more attention and many approaches have been proposed. Recently, Newman pointed out that this issue can be transformed into the problem of constrained maximization of the assignment matrix over possible divisions of