本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2004
摘要
The discovery and analysis of community structure in 網絡s is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large 網絡s because of their 計算 cost. Here we present a hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a 網絡 with n vertices and m edges is O(mdlog n) where d is the depth of the dendrogram describing the community structure. Many real-world 網絡s are sparse and hierarchical, with m n and d log n, in which case our algorithm runs in essentially linear time, O(n log2 n). As an example of the application of this algorithm we use it to analyze a 網絡 of items for sale on the web-site of a large online retailer, items in the 網
※ 此為已發表論文，全文需透過期刊付費取得