NEAT: Road Network Aware Trajectory Clustering

Binh Han, Ling Liu, E. Omiecinski
{"title":"NEAT: Road Network Aware Trajectory Clustering","authors":"Binh Han, Ling Liu, E. Omiecinski","doi":"10.1109/ICDCS.2012.31","DOIUrl":null,"url":null,"abstract":"Mining trajectory data has been gaining significant interest in recent years. However, existing approaches to trajectory clustering are mainly based on density and Euclidean distance measures. We argue that when the utility of spatial clustering of mobile object trajectories is targeted at road network aware location based applications, density and Euclidean distance are no longer the effective measures. This is because traffic flows in a road network and the flow-based density characterization become important factors for finding interesting trajectory clusters of mobile objects travelling in road networks. In this paper, we propose NEAT-a road network aware approach for fast and effective clustering of spatial trajectories of mobile objects travelling in road networks. Our method takes into account the physical constraints of the road network, the network proximity and the traffic flows among consecutive road segments to organize trajectories into spatial clusters. The clusters discovered by NEAT are groups of sub-trajectories which describe both dense and highly continuous traffic flows of mobile objects. We perform extensive experiments with mobility traces generated using different scales of real road network maps. Our experimental results demonstrate that the NEAT approach is highly accurate and runs orders of magnitude faster than existing density-based trajectory clustering approaches.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"10 1","pages":"142-151"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 32nd International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2012.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 55

Abstract

Mining trajectory data has been gaining significant interest in recent years. However, existing approaches to trajectory clustering are mainly based on density and Euclidean distance measures. We argue that when the utility of spatial clustering of mobile object trajectories is targeted at road network aware location based applications, density and Euclidean distance are no longer the effective measures. This is because traffic flows in a road network and the flow-based density characterization become important factors for finding interesting trajectory clusters of mobile objects travelling in road networks. In this paper, we propose NEAT-a road network aware approach for fast and effective clustering of spatial trajectories of mobile objects travelling in road networks. Our method takes into account the physical constraints of the road network, the network proximity and the traffic flows among consecutive road segments to organize trajectories into spatial clusters. The clusters discovered by NEAT are groups of sub-trajectories which describe both dense and highly continuous traffic flows of mobile objects. We perform extensive experiments with mobility traces generated using different scales of real road network maps. Our experimental results demonstrate that the NEAT approach is highly accurate and runs orders of magnitude faster than existing density-based trajectory clustering approaches.
道路网络感知轨迹聚类
近年来,采矿轨迹数据引起了人们极大的兴趣。然而,现有的轨迹聚类方法主要基于密度和欧氏距离度量。本文认为,当移动目标轨迹空间聚类应用于基于道路网络的位置感知应用时,密度和欧氏距离不再是有效的度量。这是因为路网中的交通流和基于流的密度表征成为寻找路网中移动物体有趣轨迹簇的重要因素。在本文中,我们提出了一种道路网络感知方法neat,用于快速有效地聚类道路网络中移动物体的空间轨迹。我们的方法考虑了道路网络的物理约束、网络邻近性和连续路段之间的交通流,将轨迹组织成空间集群。NEAT发现的簇是一组描述移动物体密集和高度连续交通流的子轨迹。我们对使用不同比例尺的真实道路网络地图生成的移动轨迹进行了广泛的实验。我们的实验结果表明,NEAT方法是高度精确的,运行速度比现有的基于密度的轨迹聚类方法快几个数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信