Show simple item record

dc.contributor.authorFerreira, Nivanen_US
dc.contributor.authorKlosowski, James T.en_US
dc.contributor.authorScheidegger, Carlos E.en_US
dc.contributor.authorSilva, Cláudio T.en_US
dc.contributor.editorB. Preim, P. Rheingans, and H. Theiselen_US
dc.date.accessioned2015-02-28T15:30:31Z
dc.date.available2015-02-28T15:30:31Z
dc.date.issued2013en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/cgf.12107en_US
dc.description.abstractScientists 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.en_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.subjectI.5.3 [Pattern Recognition]en_US
dc.subjectClusteringen_US
dc.subjectAlgorithmsen_US
dc.titleVector Field k-Means: Clustering Trajectories by Fitting Multiple Vector Fieldsen_US
dc.description.seriesinformationComputer Graphics Forumen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record