By Topic

A grid-based clustering method for mining frequent trips from large-scale, event-based telematics datasets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Qing Cao ; Computing and Decision Sciences, GE Global Research Center, One Research Circle, Niskayuna, NY 12309 ; Bouchra Bouqata ; Patricia D. Mackenzie ; Daniel Messier
more authors

Telematics systems that integrate wireless communications with sensor-based monitoring and location-aware applications have been widely deployed for mobile asset tracking and condition monitoring. In asset tracking field, exploring the data that relate to asset behaviors is critical to understand asset utilization, efficiency, distribution, operation, and many other important aspects in the supply chain. Prior work on analyzing GPS-based patterns has mainly been performed on time-based datasets. In this paper, we describe a scalable clustering algorithm to discover frequently repeated trips from large-scale, event-based telematics datasets collected via a satellite-based tracking system. We first transform GPS traces into a list of trips. Then we present a grid-based hierarchical clustering algorithm to discover frequent spatial patterns among all trips. We evaluate the effectiveness of the proposed algorithm against a large-scale, real-world dataset collected from tracking over a hundred of thousand assets and prove its feasibility. Through these experimental results, we show that the proposed algorithm significantly reduces the computational time needed for clustering as opposed to the traditional hierarchical clustering based on pair-wise comparison.

Published in:

Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on

Date of Conference:

11-14 Oct. 2009