Community detection in dynamic networks with spark

Priyangika R. Piyasinghe and J. Morris Chang

International Journal of Data Science, 2018, vol. 3, issue 3, 236-254

Abstract: Detecting the evolution of communities within dynamically changing networks is important to understand the latent structure of complex large graphs. In this paper, we present an algorithm to detect real-time communities in dynamically changing networks. We demonstrate the proposed methodology through a case study in peer-to-peer (P2P) botnet detection which is one of the major threats to network security for serving as the infrastructure that is responsible for various cyber crimes. Our method considers online community structure from time to time and improves efficiency by maintaining the same level of accuracy of community detection over time. Experimental evaluation on Apache Spark implementation of the method showed that the execution time improves over dynamic version of Girvan-Newman community detection algorithm while having a higher accuracy level.

Keywords: dynamic networks; community detection; Girvan-Newman algorithm; large graphs; spark. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=94505 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdsci:v:3:y:2018:i:3:p:236-254

Access Statistics for this article

More articles in International Journal of Data Science from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().