本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2004
摘要
We propose and study a set of algorithms for discovering community structure in 網絡s-natural divisions of 網絡 nodes into densely connected subgroups. Our algorithms all share two definitive features: first, they involve iterative removal of edges from the 網絡 to split it into communities, the edges removed being identified using any one of a number of possible "betweenness" measures, and second, these measures are, crucially, recalculated after each removal. We also propose a measure for the strength of the community structure found by our algorithms, which gives us an objective metric for choosing the number of communities into which a 網絡 should be divided. We demonstrate that our algorithms are highly effective at discovering community structure in both computer-generated and real-world 網絡
※ 此為已發表論文，全文需透過期刊付費取得