Community detection using spectral clustering on sparse geosocial data
Authors:
- Kyle LuhKLKyle Luh
- Megan HalvorsonMHMegan Halvorson
- Shannon ReidSRShannon Reid
- Matt ValasikMVMatt Valasik
- James WoJWJames Wo
- George E. TitaGTGeorge E. Tita
Preprint
Abstract
In this article we identify social communities among gang members in the Hollenbeck policing district in Los Angeles, based on sparse observations of a combination of social interactions and geographic locations of the individuals. This information, coming from LAPD Field Interview cards, is used to construct a similarity graph for the individuals. We use spectral clustering to identify clusters in the graph, corresponding to communities in Hollenbeck, and compare these with the LAPD's knowledge of the individuals' gang membership. We discuss different ways of encoding the geosocial information using a graph structure and the influence on the resulting clusterings. Finally we analyze the robustness of this technique with respect to noisy and incomplete data, thereby providing suggestions about the relative importance of quantity versus quality of collected data.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Geosocial Graph-Based Community Detection2012
- THE ECOLOGY OF GANG TERRITORIAL BOUNDARIES*Criminology, 2012
- Geographical influences of an emerging network of gang rivalriesPhysica A: Statistical Mechanics and its Applications, 2011
- Spatializing the Social Networks of Gangs to Explore Patterns of ViolenceJournal of Quantitative Criminology, 2011
- Community Structure in Time-Dependent, Multiscale, and Multiplex NetworksScience, 2010
- Spatializing Social Networks: Using Social Network Analysis to Investigate Geographies of Gang Rivalry, Territoriality, and Violence in Los AngelesAnnals of the American Association of Geographers, 2010
- Literature Search through Mixed-Membership Community DiscoveryLecture Notes in Computer Science, 2010
- Finding and evaluating community structure in networksPhysical Review E, 2004
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Rank-one modification of the symmetric eigenproblemNumerische Mathematik, 1978