Community Detection Using Spectral Clustering on Sparse Geosocial Data

DOI10.1137/120882093MaRDI QIDQ4923316zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Yves van Gennip, Blake Hunter, Raymond Ahn, Kyle Luh, Megan Halvorson, Shannon Reid, Matthew Valasik, James Wo, George E. Tita, P. Jeffrey Brantingham, Peter D. T. A. Elliott, Andrea L. Bertozzi

Publication date 6 June 2013

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.4969

zbMATH Keywords

community detectiondata clusteringrank-one matrix updatesocial networksspectral clusteringstability analysisstreet gangs

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to social sciences (62P25) Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30)

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.

Recommendations

• Spectral clustering for community detection
• Social network community detection using agglomerative spectral clustering
• Spectral clustering-based community detection using graph distance and node attributes
• A spectral clustering-based framework for detecting community structures in complex networks
• Community detection based on spectral clustering with node attributes
• Community detection in networks via a spectral heuristic based on the clustering coefficient
• A signal-diffusion-based spectral clustering method for community detection
• Spectral clustering-based network community detection with node attributes

Cited in

(9)

• Modularity maximization using completely positive programming
• A geo-clustering approach for the detection of areas-of-interest and their underlying semantics
• A unified framework for harmonic analysis of functions on directed graphs and changing data
• A convection-diffusion model for gang territoriality
• A divisive spectral method for network community detection
• Asymptotic analysis of the Ginzburg–Landau functional on point clouds
• Incremental methods for community detection in both fully and growing dynamic networks
• Motif-based mix-order nonnegative matrix factorization for community detection
• Local transfer learning from one data space to another

Describes a project that uses

Uses Software

• GenLouvain

This page was built for publication: Community Detection Using Spectral Clustering on Sparse Geosocial Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923316)