Comparing Community Detection Algorithms in Transport Networks via Points of Interest

Abstract

Passengers travel in transport networks with diverse interests represented by linked points of interest (POIs) and drive urban regions to group into network communities. Previous studies focused on applying community detection methods (CDMs) to discover spatial mobility patterns or using POIs to explain the decision making of human mobility, without comparing the effectiveness of CDMs for detecting network communities. In this paper, we analyze the relationship between POIs and network communities of human mobility over diverse CDMs. Taking the taxi systems of Shanghai and Beijing as case studies, we construct transport networks with urban regions as nodes and the connections between them as links weighted by mobility flows. The spatial communities are identified based on the movement strength among regions. POIs are mapped into nodes in the network and are considered as independent variables for classifying the spatial community categories. Our study suggests that communities detected with two specific CMDs (namely, the Combo algorithm and the Walktrap algorithm) correlate to POIs, and the correlation of the Combo is the best ($R^{2}=0.3$for Shanghai and$R^{2}=0.48$for Beijing). In this regard, this paper can provide valuable insight into understanding the formation of spatial communities and assist in selecting reasonable CDMs.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 37 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.