2019
DOI: 10.1080/13658816.2019.1566551
|View full text |Cite
|
Sign up to set email alerts
|

Detecting clusters over intercity transportation networks using K-shortest paths and hierarchical clustering: a case study of mainland China

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 46 publications
0
2
0
Order By: Relevance
“…Many scholars have applied and innovated around these fundamental tasks, and these studies mainly focus on complex network community discovery based on modularity and spectral clustering (Lei, Zhou, & Shi, 2019;Newman, 2003), link prediction and centrality analysis (Trouillon, Welbl, Riedel, Gaussier, & Bouchard, 2016), influence calculation and heterogeneous network alignment (Chauhan, Ram, Hari, & Jolly, 2021;. It also includes some work at the algorithmic level of graph space optimization, using the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm to extract and merge traffic flow networks to form better complex network graph layouts (Von Landesberger et al, 2015;Wang, Zhang, Zheng, & Hu, 2022) and combining K-shortest paths & hierarchical clustering to parse urban transportation network structure Yue et al, 2019).…”
Section: Related Workmentioning
confidence: 99%
“…Many scholars have applied and innovated around these fundamental tasks, and these studies mainly focus on complex network community discovery based on modularity and spectral clustering (Lei, Zhou, & Shi, 2019;Newman, 2003), link prediction and centrality analysis (Trouillon, Welbl, Riedel, Gaussier, & Bouchard, 2016), influence calculation and heterogeneous network alignment (Chauhan, Ram, Hari, & Jolly, 2021;. It also includes some work at the algorithmic level of graph space optimization, using the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm to extract and merge traffic flow networks to form better complex network graph layouts (Von Landesberger et al, 2015;Wang, Zhang, Zheng, & Hu, 2022) and combining K-shortest paths & hierarchical clustering to parse urban transportation network structure Yue et al, 2019).…”
Section: Related Workmentioning
confidence: 99%
“…e comparison between PTN clusters and urban agglomerations can be used to estimate whether the PTNs are capable of supporting these human distributions [69]. Identifying under-and overserviced areas can also help in policy decisions, including infrastructure planning and local development [70].…”
Section: Link Building Process In Ptnsmentioning
confidence: 99%
“…Among them, community detection models can more effectively and accurately reveal the grouping effect in urban networks, including Girvan-Newman [20], Walktrap [21], Label Propagation [22], Infomap [23], etc. However, these models only consider the network topological relationship, failing to consider the impact of the geographical distance on the connection strength [24]. For this reason, Chen et al [25] introduced the geographical distance into the calculation of modularity, i.e., geographical modularity.…”
Section: Introductionmentioning
confidence: 99%
“…For example, Wan et al [29] employed the DASSCAN algorithm based on density clustering to merge spatially adjacent nodes with similar structures into communities, but this method was only used for homogeneous spatial networks within partitions. To address the aforementioned issues, Yue et al [24] proposed the Transportation Cluster Detection (TCD) community detection algorithm based on K-shortest paths and hierarchical clustering. The algorithm utilizes K-shortest paths to reflect real travel behaviors, employs a bottom-up hierarchical clustering approach to explore node-merging processes, and incorporates geographical modularity to identify the optimal communities.…”
Section: Introductionmentioning
confidence: 99%