Vector Field k-Means: Clustering Trajectories by Fitting Multiple Vector Fields

被引:67
作者
Ferreira, Nivan [1 ]
Klosowski, James T.
Scheidegger, Carlos E.
Silva, Claudio T. [1 ]
机构
[1] NYU, Polytech Inst, New York, NY 10003 USA
基金
美国国家科学基金会;
关键词
VISUALIZATION; AGGREGATION;
D O I
10.1111/cgf.12107
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Scientists study trajectory data to understand trends in movement patterns, such as human mobility for traffic analysis and urban planning. In this paper, we introduce a novel trajectory clustering technique whose central idea is to use vector fields to induce a notion of similarity between trajectories, letting the vector fields themselves define and represent each cluster. We present an efficient algorithm to find a locally optimal clustering of trajectories into vector fields, and demonstrate how vector-field k-means can find patterns missed by previous methods. We present experimental evidence of its effectiveness and efficiency using several datasets, including historical hurricane data, GPS tracks of people and vehicles, and anonymous cellular radio handoffs from a large service provider.
引用
收藏
页码:201 / 210
页数:10
相关论文
共 36 条
[1]  
Andrienko Gennady, 2009, Proceedings of the 2009 IEEE Symposium on Visual Analytics Science and Technology. VAST 2009. Held co-jointly with VisWeek 2009, P3, DOI 10.1109/VAST.2009.5332584
[2]  
Andrienko G., 2011, Proceedings of the 2011 IEEE Symposium on Visual Analytics Science and Technology, P159
[3]  
Andrienko G., 2007, ACM SIGKDD Explorations Newsletter, V9, P38, DOI [DOI 10.1145/1345448.1345455, 10.1145/1345448.1345455]
[4]   Spatio-temporal Aggregation for Visual Analysis of Movements [J].
Andrienko, Gennady ;
Andrienko, Natalia .
IEEE SYMPOSIUM ON VISUAL ANALYTICS SCIENCE AND TECHNOLOGY 2008, PROCEEDINGS, 2008, :51-58
[5]   Spatial Generalization and Aggregation of Massive Movement Data [J].
Andrienko, Natalia ;
Andrienko, Gennady .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2011, 17 (02) :205-219
[6]  
[Anonymous], COMP GRAPH FOR P EUR
[7]  
[Anonymous], 2007, P 18 ANN ACM SIAM S
[8]  
[Anonymous], 1999, SPRINGER SCI
[9]  
[Anonymous], NAT HURR CTR N ATL H
[10]  
[Anonymous], P VIS INF COMM INT S