Geosocial Graph-Based Community Detection
arXiv:1211.5837 · doi:10.1109/ICDMW.2012.63
Abstract
We apply spectral clustering and multislice modularity optimization to a Los Angeles Police Department field interview card data set. To detect communities (i.e., cohesive groups of vertices), we use both geographic and social information about stops involving street gang members in the LAPD district of Hollenbeck. We then compare the algorithmically detected communities with known gang identifications and argue that discrepancies are due to sparsity of social connections in the data as well as complex underlying sociological factors that blur distinctions between communities.
arXiv comment5 pages, 4 figures Workshop paper for the IEEE International Conference on Data Mining 2012: Workshop on Social Media Analysis and Mining
References in corpus (6)
- Fast unfolding of communities in large networks
- Finding and evaluating community structure in networks
- Resolution limit in community detection
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Statistical Mechanics of Community Detection
- Comparing Community Structure to Characteristics in Online Collegiate Social Networks