A probabilistic method for inferring common routes from mobile communication network traffic data is presented. Besides providing mobility information, valuable in a multitude of application areas, the method has the dual purpose of enabling efficient coarse-graining as well as anonymisation by mapping individual sequences onto common routes. The approach is to represent spatial trajectories by Cell ID sequences that are grouped into routes using locality-sensitive hashing and graph clustering. The method is demonstrated to be scalable, and to accurately group sequences using an evaluation set of GPS tagged data. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Görnerup, O. (2012). Scalable mining of common routes in mobile communication network traffic data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7319 LNCS, pp. 99–106). https://doi.org/10.1007/978-3-642-31205-2_7
Mendeley helps you to discover research relevant for your work.