Mining for geographically disperse communities in social networks by leveraging distance modularity

Authors:
Paulo Shakarian;Patrick Roos;Devon Callahan;Cory Kirk
Affiliations:
U.S. Military Academy, West Point, NY, USA;University of Maryland, College Park, MD, USA;U.S. Military Academy, West Point, NY, USA;U.S. Military Academy, West Point, NY, USA
Venue:
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Year:
2013

Citing 6
Cited 0

On Modularity Clustering

IEEE Transactions on Knowledge and Data Engineering
Community detection in large-scale social networks

Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Artificial Intelligence with Uncertainty

Artificial Intelligence with Uncertainty
Combining link and content for community detection: a discriminative approach

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Friendship and mobility: user movement in location-based social networks

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Tweeque: Spatio-Temporal Analysis of Social Networks for Location Mining Using Graph Partitioning

SOCIALINFORMATICS '12 Proceedings of the 2012 International Conference on Social Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Social networks where the actors occupy geospatial locations are prevalent in military, intelligence, and policing operations such as counter-terrorism, counter-insurgency, and combating organized crime. These networks are often derived from a variety of intelligence sources. The discovery of communities that are geographically disperse stems from the requirement to identify higher-level organizational structures, such as a logistics group that provides support to various geographically disperse terrorist cells. We apply a variant of Newman-Girvan modularity to this problem known as distance modularity. To address the problem of finding geographically disperse communities, we modify the well-known Louvain algorithm to find partitions of networks that provide near-optimal solutions to this quantity. We apply this algorithm to numerous samples from two real-world social networks and a terrorism network data set whose nodes have associated geospatial locations. Our experiments show this to be an effective approach and highlight various practical considerations when applying the algorithm to distance modularity maximization. Several military, intelligence, and law-enforcement organizations are working with us to further test and field software for this emerging application.