Loading...

Near linear-time community detection in networks with hardly detectable community structure

Rezaei, A ; Sharif University of Technology | 2015

477 Viewed
  1. Type of Document: Article
  2. DOI: 10.1145/2808797.2808903
  3. Publisher: Association for Computing Machinery, Inc , 2015
  4. Abstract:
  5. Identifying communities has always been a fundamental task in analysis of complex networks. Many methods have been devised over the last decade for detection of communities. Amongst them, the label propagation algorithm brings great scalability together with high accuracy. However, it has one major flaw; when the community structure in the network is not clear enough, it will assign every node the same label, thus detecting the whole graph as one giant community. We have addressed this issue by setting a capacity for communities, starting from a small value and gradually increasing it over time. Preliminary results show that not only our extension improves the detection capability of the classic label propagation algorithm when communities are not clearly detectable, but also improves the overall quality of the identified clusters in complex networks with a clear community structure
  6. Keywords:
  7. Complex networks ; Social sciences ; Community detection ; Community structures ; Detection capability ; High-accuracy ; In networks ; Label propagation ; Near-linear time ; Overall quality ; Computer networks
  8. Source: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, 25 August 2015 through 28 August 2015 ; 2015 , Pages 65-72 ; 9781450338547 (ISBN)
  9. URL: http://dl.acm.org/citation.cfm?doid=2808797.2808903