Next Article in Journal
Hierarchical Semantic Correspondence Analysis on Feature Classes between Two Geospatial Datasets Using a Graph Embedding Method
Previous Article in Journal
Road Extraction from Very High Resolution Images Using Weakly labeled OpenStreetMap Centerline
Open AccessArticle

Tree-Based and Optimum Cut-Based Origin-Destination Flow Clustering

by Qiuliang Xiang 1,2,3 and Qunyong Wu 1,2,3,*
1
Key Lab of Spatial Data Mining and Information Sharing of Ministry of Education, Fuzhou University, Fuzhou 350108, China
2
National & Local Joint Engineering Research Center of Satellite Geospatial Information Technology, Fuzhou 350108, China
3
The Academy of Digital China (Fujian), Fuzhou 350003, China
*
Author to whom correspondence should be addressed.
ISPRS Int. J. Geo-Inf. 2019, 8(11), 477; https://doi.org/10.3390/ijgi8110477
Received: 28 August 2019 / Revised: 25 September 2019 / Accepted: 20 October 2019 / Published: 24 October 2019
Data about the movements of diverse objects, including human beings, animals, and commodities, are collected in growing amounts as location-aware technologies become pervasive. Clustering has become an increasingly important analytical tool for revealing travel patterns from large-scale movement datasets. Most existing methods for origin-destination (OD) flow clustering focus on the geographic properties of an OD flow but ignore the temporal information preserved in the OD flow, which reflects the dynamic changes in the travel patterns over time. In addition, most methods require some predetermined parameters as inputs and are difficult to adjust considering the changes in the users’ demands. To overcome such limitations, we present a novel OD flow clustering method, namely, TOCOFC (Tree-based and Optimum Cut-based Origin-Destination Flow Clustering). A similarity measurement method is proposed to quantify the spatial similarity relationship between OD flows, and it can be extended to measure the spatiotemporal similarity between OD flows. By constructing a maximum spanning tree and splitting it into several unrelated parts, we effectively remove the noise in the flow data. Furthermore, a recursive two-way optimum cut-based method is utilized to partition the graph composed of OD flows into OD flow clusters. Moreover, a criterion called CSSC (Child tree/Child graph Self-Similarity Criterion) is formulated to determine if the clusters meet the output requirements. By modifying the parameters, TOCOFC can obtain clustering results for different time scales and spatial scales, which makes it possible to study movement patterns from a multiscale perspective. However, TOCOFC has the disadvantages of low efficiency and large memory consumption, and it is not conducive to quickly handling large-scale data. Compared with previous works, TOCOFC has a better clustering performance, which is reflected in the fact that TOCOFC can guarantee a balance between clusters and help to fully understand the corresponding patterns. Being able to perform the spatiotemporal clustering of OD flows is also a highlight of TOCOFC, which will help to capture the differences in the patterns at different times for a deeper analysis. Extensive experiments on both artificial spatial datasets and real-world spatiotemporal datasets have demonstrated the effectiveness and flexibility of TOCOFC. View Full-Text
Keywords: OD flow; spatial clustering; spatiotemporal joint clustering; flow similarity measurement OD flow; spatial clustering; spatiotemporal joint clustering; flow similarity measurement
Show Figures

Figure 1

MDPI and ACS Style

Xiang, Q.; Wu, Q. Tree-Based and Optimum Cut-Based Origin-Destination Flow Clustering. ISPRS Int. J. Geo-Inf. 2019, 8, 477.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop