This Article 
 Bibliographic References 
 Add to: 
2012 IEEE 12th International Conference on Data Mining Workshops
Geosocial Graph-Based Community Detection
Brussels, Belgium Belgium
December 10-December 10
ISBN: 978-1-4673-5164-5
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.
Index Terms:
Communities,Optimization,Clustering algorithms,Standards,Cities and towns,network theory (graphs),Clustering algorithms
Yves van Gennip, Huiyi Hu, Blake Hunter, Mason A. Porter, "Geosocial Graph-Based Community Detection," icdmw, pp.754-758, 2012 IEEE 12th International Conference on Data Mining Workshops, 2012
Usage of this product signifies your acceptance of the Terms of Use.