摘要
Different algorithms, which take both links and link weights into account for the community structure of weighted networks, have been reported recently. Based on the measure of similarity among community structures introduced in our previous work, in this paper, accuracy and precision of three algorithms are investigated. Results show that Potts model based algorithm and weighted extremal optimization (WEO) algorithm work well on both dense or sparse weighted networks, while weighted Girvan-Newman (WGN) algorithm works well only for relatively sparse networks.
- 出版日期2007-4-1
- 单位北京师范大学