HAGEN: Homophily-Aware Graph Convolutional Recurrent Network for Crime Forecasting

• URL: http://arxiv.org/abs/2109.12846v1
• Date: Mon, 27 Sep 2021 07:46:05 GMT
• Title: HAGEN: Homophily-Aware Graph Convolutional Recurrent Network for Crime Forecasting
• Authors: Chenyu Wang, Zongyu Lin, Xiaochen Yang, Jiao Sun, Mingxuan Yue, Cyrus Shahabi
• Abstract summary: We propose an end-to-end graph convolutional recurrent network called HAGEN with several novel designs for crime prediction. Based on the homophily assumption of GNN, we propose a homophily-aware constraint to regularize the optimization of the region graph. It also incorporates crime embedding to model the interdependencies between regions and crime categories.
• Score: 11.469930516486901
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The crime forecasting is an important problem as it greatly contributes to urban safety. Typically, the goal of the problem is to predict different types of crimes for each geographical region (like a neighborhood or censor tract) in the near future. Since nearby regions usually have similar socioeconomic characteristics which indicate similar crime patterns, recent state-of-the-art solutions constructed a distance-based region graph and utilized Graph Neural Network (GNN) techniques for crime forecasting, because the GNN techniques could effectively exploit the latent relationships between neighboring region nodes in the graph. However, this distance-based pre-defined graph cannot fully capture crime correlation between regions that are far from each other but share similar crime patterns. Hence, to make an accurate crime prediction, the main challenge is to learn a better graph that reveals the dependencies between regions in crime occurrences and meanwhile captures the temporal patterns from historical crime records. To address these challenges, we propose an end-to-end graph convolutional recurrent network called HAGEN with several novel designs for crime prediction. Specifically, our framework could jointly capture the crime correlation between regions and the temporal crime dynamics by combining an adaptive region graph learning module with the Diffusion Convolution Gated Recurrent Unit (DCGRU). Based on the homophily assumption of GNN, we propose a homophily-aware constraint to regularize the optimization of the region graph so that neighboring region nodes on the learned graph share similar crime patterns, thus fitting the mechanism of diffusion convolution. It also incorporates crime embedding to model the interdependencies between regions and crime categories. Empirical experiments and comprehensive analysis on two real-world datasets showcase the effectiveness of HAGEN.

Related papers

• An Event-centric Framework for Predicting Crime Hotspots with Flexible Time Intervals [15.749155522310941]
  FlexiCrime is a novel event framework for predicting crime hotspots with flexible time intervals. It incorporates a continuous-time attention network to capture correlations between crime events, which learns crime context features. It measures the risk of specific crime types at a given time and location by considering frequency of past crime events.
  arXiv  Detail & Related papers  (2024-11-02T04:38:10Z)
• Spatial-Temporal Mixture-of-Graph-Experts for Multi-Type Crime Prediction [26.79981325208879]
  We propose a Spatial-Temporal Mixture-of-Graph-Experts (ST-MoGE) framework for collective multiple-type crime prediction. We introduce an attentive-gated Mixture-of-Graph-Experts (MGEs) module to capture the distinctive and shared crime patterns of each crime category. Then, we propose Cross-Expert Contrastive Learning( CECL) to update the MGEs and force each expert to focus on specific pattern modeling.
  arXiv  Detail & Related papers  (2024-09-24T05:41:11Z)
• Resisting Graph Adversarial Attack via Cooperative Homophilous Augmentation [60.50994154879244]
  Recent studies show that Graph Neural Networks are vulnerable and easily fooled by small perturbations. In this work, we focus on the emerging but critical attack, namely, Graph Injection Attack. We propose a general defense framework CHAGNN against GIA through cooperative homophilous augmentation of graph data and model.
  arXiv  Detail & Related papers  (2022-11-15T11:44:31Z)
• Model Inversion Attacks against Graph Neural Networks [65.35955643325038]
  We study model inversion attacks against Graph Neural Networks (GNNs) In this paper, we present GraphMI to infer the private training graph data. Our experimental results show that such defenses are not sufficiently effective and call for more advanced defenses against privacy attacks.
  arXiv  Detail & Related papers  (2022-09-16T09:13:43Z)
• Spatial-Temporal Sequential Hypergraph Network for Crime Prediction [56.41899180029119]
  We propose Spatial-Temporal Sequential Hypergraph Network (ST-SHN) to collectively encode complex crime spatial-temporal patterns. In particular, to handle spatial-temporal dynamics under the long-range and global context, we design a graph-structured message passing architecture. We conduct extensive experiments on two real-world datasets, showing that our proposed ST-SHN framework can significantly improve the prediction performance.
  arXiv  Detail & Related papers  (2022-01-07T12:46:50Z)
• Generalizing Graph Neural Networks on Out-Of-Distribution Graphs [51.33152272781324]
  Graph Neural Networks (GNNs) are proposed without considering the distribution shifts between training and testing graphs. In such a setting, GNNs tend to exploit subtle statistical correlations existing in the training set for predictions, even though it is a spurious correlation. We propose a general causal representation framework, called StableGNN, to eliminate the impact of spurious correlations.
  arXiv  Detail & Related papers  (2021-11-20T18:57:18Z)
• Line Graph Neural Networks for Link Prediction [71.00689542259052]
  We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. In this formalism, a link prediction problem is converted to a graph classification task. We propose to seek a radically different and novel path by making use of the line graphs in graph theory. In particular, each node in a line graph corresponds to a unique edge in the original graph. Therefore, link prediction problems in the original graph can be equivalently solved as a node classification problem in its corresponding line graph, instead of a graph classification task.
  arXiv  Detail & Related papers  (2020-10-20T05:54:31Z)
• Exploring Spatio-Temporal and Cross-Type Correlations for Crime Prediction [48.1813701535167]
  We perform crime prediction exploiting the cross-type and-temporal correlations of urban crimes. We propose a coherent framework to mathematically model these correlations for crime prediction. Further experiments have been conducted to understand the importance of different correlations in crime prediction.
  arXiv  Detail & Related papers  (2020-01-20T00:34:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.