ScaleFC:一种基于尺度感知的异构始发目的地数据地理流聚类算法

IF 8.3 1区 地球科学 Q1 ENVIRONMENTAL STUDIES
Huan Chen , Zhipeng Gui , Dehua Peng , Yuhang Liu , Yuncheng Ma , Huayi Wu
{"title":"ScaleFC:一种基于尺度感知的异构始发目的地数据地理流聚类算法","authors":"Huan Chen ,&nbsp;Zhipeng Gui ,&nbsp;Dehua Peng ,&nbsp;Yuhang Liu ,&nbsp;Yuncheng Ma ,&nbsp;Huayi Wu","doi":"10.1016/j.compenvurbsys.2025.102338","DOIUrl":null,"url":null,"abstract":"<div><div>Exploring the cluster pattern of geographical flow facilitates the understanding of the underlying process of geographical phenomena among spatial locations. Despite recent advancements in identifying flow clusters, challenges remain when handling flow data with uneven length, heterogeneous density and weak connectivity. To solve the issues, this study proposes a Scale-aware Flow Clustering algorithm (ScaleFC). It identifies flow clusters of arbitrary lengths by employing an analytical scale to generate an adjustable neighborhood range of each flow. Meanwhile, inspired by the idea of boundary-seeking clustering, ScaleFC introduces partitioning flows to identify flow clusters with different densities, and separate the weakly-connected clusters. To validate the effectiveness, we compared ScaleFC with three mainstream baselines, i.e., AFC, FlowLF and FlowDBSCAN, on six synthetic datasets. The results presented that ScaleFC can accurately identify the clusters with complex structures, achieving an average accuracy improvement of 27 %, 17 %, and 15 % over the three competitors, respectively. The application on bike-sharing data with 16,140 flow pairs from Shanghai City demonstrated that ScaleFC is capable to capture both long-distance and short-distance movements, thereby providing a more comprehensive understanding to multi-scale human mobility patterns in geographical space.</div></div>","PeriodicalId":48241,"journal":{"name":"Computers Environment and Urban Systems","volume":"122 ","pages":"Article 102338"},"PeriodicalIF":8.3000,"publicationDate":"2025-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ScaleFC: A scale-aware geographical flow clustering algorithm for heterogeneous origin-destination data\",\"authors\":\"Huan Chen ,&nbsp;Zhipeng Gui ,&nbsp;Dehua Peng ,&nbsp;Yuhang Liu ,&nbsp;Yuncheng Ma ,&nbsp;Huayi Wu\",\"doi\":\"10.1016/j.compenvurbsys.2025.102338\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Exploring the cluster pattern of geographical flow facilitates the understanding of the underlying process of geographical phenomena among spatial locations. Despite recent advancements in identifying flow clusters, challenges remain when handling flow data with uneven length, heterogeneous density and weak connectivity. To solve the issues, this study proposes a Scale-aware Flow Clustering algorithm (ScaleFC). It identifies flow clusters of arbitrary lengths by employing an analytical scale to generate an adjustable neighborhood range of each flow. Meanwhile, inspired by the idea of boundary-seeking clustering, ScaleFC introduces partitioning flows to identify flow clusters with different densities, and separate the weakly-connected clusters. To validate the effectiveness, we compared ScaleFC with three mainstream baselines, i.e., AFC, FlowLF and FlowDBSCAN, on six synthetic datasets. The results presented that ScaleFC can accurately identify the clusters with complex structures, achieving an average accuracy improvement of 27 %, 17 %, and 15 % over the three competitors, respectively. The application on bike-sharing data with 16,140 flow pairs from Shanghai City demonstrated that ScaleFC is capable to capture both long-distance and short-distance movements, thereby providing a more comprehensive understanding to multi-scale human mobility patterns in geographical space.</div></div>\",\"PeriodicalId\":48241,\"journal\":{\"name\":\"Computers Environment and Urban Systems\",\"volume\":\"122 \",\"pages\":\"Article 102338\"},\"PeriodicalIF\":8.3000,\"publicationDate\":\"2025-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers Environment and Urban Systems\",\"FirstCategoryId\":\"89\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0198971525000912\",\"RegionNum\":1,\"RegionCategory\":\"地球科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENVIRONMENTAL STUDIES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers Environment and Urban Systems","FirstCategoryId":"89","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0198971525000912","RegionNum":1,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENVIRONMENTAL STUDIES","Score":null,"Total":0}
引用次数: 0

摘要

探索地理流动的集群模式有助于理解空间区位间地理现象的内在过程。尽管最近在识别流簇方面取得了进展,但在处理长度不均匀、密度不均匀和连通性弱的流数据时仍然存在挑战。为了解决这一问题,本研究提出了一种规模感知流聚类算法(ScaleFC)。它通过采用分析尺度来生成每个流的可调邻域范围来识别任意长度的流簇。同时,受边界寻找聚类思想的启发,ScaleFC引入分区流来识别不同密度的流簇,并分离弱连接的簇。为了验证其有效性,我们在六个合成数据集上将ScaleFC与三个主流基线(即AFC, FlowLF和FlowDBSCAN)进行了比较。结果表明,ScaleFC可以准确地识别具有复杂结构的聚类,平均准确率比三个竞争对手分别提高27%,17%和15%。在上海市16140对共享单车流量数据上的应用表明,ScaleFC能够捕捉长距离和短距离的移动,从而更全面地了解地理空间中多尺度的人类移动模式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
ScaleFC: A scale-aware geographical flow clustering algorithm for heterogeneous origin-destination data
Exploring the cluster pattern of geographical flow facilitates the understanding of the underlying process of geographical phenomena among spatial locations. Despite recent advancements in identifying flow clusters, challenges remain when handling flow data with uneven length, heterogeneous density and weak connectivity. To solve the issues, this study proposes a Scale-aware Flow Clustering algorithm (ScaleFC). It identifies flow clusters of arbitrary lengths by employing an analytical scale to generate an adjustable neighborhood range of each flow. Meanwhile, inspired by the idea of boundary-seeking clustering, ScaleFC introduces partitioning flows to identify flow clusters with different densities, and separate the weakly-connected clusters. To validate the effectiveness, we compared ScaleFC with three mainstream baselines, i.e., AFC, FlowLF and FlowDBSCAN, on six synthetic datasets. The results presented that ScaleFC can accurately identify the clusters with complex structures, achieving an average accuracy improvement of 27 %, 17 %, and 15 % over the three competitors, respectively. The application on bike-sharing data with 16,140 flow pairs from Shanghai City demonstrated that ScaleFC is capable to capture both long-distance and short-distance movements, thereby providing a more comprehensive understanding to multi-scale human mobility patterns in geographical space.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
13.30
自引率
7.40%
发文量
111
审稿时长
32 days
期刊介绍: Computers, Environment and Urban Systemsis an interdisciplinary journal publishing cutting-edge and innovative computer-based research on environmental and urban systems, that privileges the geospatial perspective. The journal welcomes original high quality scholarship of a theoretical, applied or technological nature, and provides a stimulating presentation of perspectives, research developments, overviews of important new technologies and uses of major computational, information-based, and visualization innovations. Applied and theoretical contributions demonstrate the scope of computer-based analysis fostering a better understanding of environmental and urban systems, their spatial scope and their dynamics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信