期刊文献+

出租车OD序列聚类的城市功能区识别算法研究

Urban Functional Regions Recognition Algorithm for Taxi OD Series Clustering
下载PDF
导出
摘要 提出一种由添加窗口约束的规整路径距离改进的K中心聚类算法(LDTW-K-medoids),通过构造时间序列、动态时间规整、时间序列聚类、聚类结果解读的流程来识别城市功能区。将算法应用在纽约市城市功能区识别中,对50万条出租车OD数据进行处理,将265个交通小区划分为五大功能区,并结合出租车全局流动模式、建筑物面积指数和富集指数来定量识别功能性质。与谷歌地图和卫星影像对比的结果表明,算法能够有效识别城市功能区,总体精度为83.8%。 In this paper,we provided a method that using warp path distance with window limits to improve K-medoids clustering algorithm(LDTW-K-medoids),which could identify urban functional regions by constructing orientation-destination(OD)series,using limited dynamic time warping,time series clustering and interpretation of clustering results.We applied the algorithm to identify urban functional regions in New York City,used 506625 taxi OD records to divide 265 traffic districts into five functional regions,and combined the global flow pattern of taxis,building area index and enrichment index to quantitatively identify the functional properties.Compared with Google maps and satellite images,the result shows that the algorithm can effectively identify urban functional regions,with overall accuracy of 83.8%.
作者 高蕴灵 李英冰 何阳 栾梦杰 李欣然 GAO Yunling;LI Yingbing;HE Yang;LUAN Mengjie;LI Xinran(School of Geodesy and Geomatics,Wuhan University,Wuhan 430070,China;China Railway First Survey and Design Institute Group Co.,Ltd.,Xi’an 710043,China)
出处 《地理空间信息》 2024年第2期8-12,共5页 Geospatial Information
基金 国家重点研发计划项目(2018YFC0807000)。
关键词 城市功能区 OD序列 动态时间规整 规整路径距离 K中心聚类 建筑物数据 urban functional region OD series dynamic time warp warp path distance K-medoids clustering building data
  • 相关文献

参考文献6

二级参考文献60

  • 1关金平,朱竑.基于FCD的出租车空驶时空特性及成因研究——以深圳国贸CBD为例[J].中山大学学报(自然科学版),2010,49(S1):29-36. 被引量:10
  • 2SHAW ShihLung.Modeling of taxi drivers’ experience for routing applications[J].Science China(Technological Sciences),2010,53(S1):44-51. 被引量:2
  • 3Wong K I,Wong S C,Bell M G,et al.Modeling the bilateral micro-searching behavior for urban taxi services using the absorbing markov chain approach[J].Journal of Advanced Transportation,2005,39(1):81-104.
  • 4Li B,Zhang D,Sun L,et al.Hunting or waiting? Discovering passenger-finding strategies from a large-scale real-world taxi dataset[C].2011 IEEE International Conference on Pervasive Computing and Communications Workshops,2011:63-68.
  • 5Liu L,Andris C,Ratti C.Uncovering cabdrivers’ behavior patterns from their digital traces[J].Computers,Environment and Urban Systems,2010,34(6):541-548.
  • 6Phithakkitnukoon S,Veloso M,Bento C,et al.Taxi-aware map:Identifying and predicting vacant taxis in the city[J].Lecture Notes in Computer Science,2010,6439:86-95.
  • 7Yamamoto K,Uesugi K,Watanabe T.Adaptive routing of multiple taxis by mutual exchange of pathways[J].Inderscience Publishers,2010,2(1):57-69.
  • 8Yuan N J,Zheng Y,Zhang L,et al.T-finder:A recommender system for finding passengers and vacant Taxis[J].IEEE Transactions on Knowledge and Data Engineering,2012,25(10):2390-2403.
  • 9Zheng X,Liang X,Xu K.Where to wait for taxi[C].Proceedings of the ACM SIGKDD International Workshop on Urban Computing.2012:149-156.
  • 10Elmasri R,Lee J.Implementation options for time-series Data[J].Lecture Notes in Computer Science,1998,1339:115-128.

共引文献62

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部