A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
An Overlapping Communities Detection Algorithm via Maxing Modularity in Opportunistic Networks
2016
ITM Web of Conferences
Community detection in opportunistic networks has been a significant and hot issue, which is used to understand characteristics of networks through analyzing structure of it. Community is used to represent a group of nodes in a network where nodes inside the community have more internal connections than external connections. However, most of the existing community detection algorithms focus on binary networks or disjoint community detection. In this paper, we propose a novel algorithm via
doi:10.1051/itmconf/20160705007
fatcat:oqbbawfeajhh5g5ysvwed4prci