Abstract
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been proposed, with different degrees of complexity. All these measures assume that trajectories are error-free, which is essentially not true. Uncertainty is present in trajectory data, which is usually obtained through a series of GPS of GSM observations. Trajectories are then reconstructed, typically using linear interpolation. A well-known model to deal with uncertainty in a trajectory sample, uses the notion of space-time prisms (also called beads), to estimate the positions where the object could have been, given a maximum speed. Thus, we can replace a (reconstructed) trajectory by a necklace (intuitively, a a chain of prisms), connecting consecutive trajectory sample points. When it comes to clustering, the notion of uncertainty requires appropriate distance functions. The main contribution of this paper is the definition of a distance function that accounts for uncertainty, together with the proof that this function is also a metric, and therefore it can be used in clustering. We also present an algorithm that computes the distance between the chains of prisms corresponding to two trajectory samples. Finally, we discuss some preliminary results, obtained clustering a set of trajectories of cars in the center of the city of Milan, using the distance function introduced in this paper.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Lin, K., Sawhney, H.S., Shim, K.: Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In: VLDB, pp. 490–501 (1995)
Ankerst, M., Breunig, M., Kriegel, H.P., Sander, J.: Optics: Ordering points to identify the clustering structure. In: SIGMOD Conference, pp. 49–60 (1999)
Egenhofer, M.: Approximation of geopatial lifelines. In: SpadaGIS, Workshop on Spatial Data and Geographic Information Systems (2003)
Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, pp. 226–231 (1996)
Faloutsos, C., Lin, K.L.: Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: SIGMOD Conference, pp. 163–174 (1995)
Gaffney, S., Smyth, P.: Trajectory clustering with mixtures of regression models. In: KDD, pp. 63–72 (1999)
Güting, R.H., Schneider, M.: Moving Objects Databases. Morgan Kaufmann, San Francisco (2005)
Hägerstrand, T.: What about people in regional science? Papers of the Regional Science Association 24, 7–21 (1970)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2000)
Ketterlin, A.: Clustering sequences of complex objects. In: KDD, pp. 215–218 (1997)
Kuijpers, B., Othman, W.: Modelling uncertainty of moving objects on road networks via space-time prisms. International Journal of Geographical Information Science (to appear, 2009)
Miller, H.: Modeling accessibility using space-time prism concepts within geographical information systems. International Journal of Geographical Information Systems 5, 287–301 (1991)
Miller, H., Wu, Y.: GIS software for measuring space-time accessibility in transportation planning and analysis. GeoInformatica 4, 141–159 (2000)
Nanni, M.: Clustering Methods for Spatio-Temporal Data. PhD thesis, Computer Science Departrment, University of Pisa (2002)
Nanni, M., Pedreschi, D.: Time-focused clustering of trajectories of moving objects. Journal of Intelligent Information Systems 27(3), 267–289 (2006)
Nanni, M., Kuijpers, B., Körner, C., May, M., Pedreschi, D.: Spatiotemporal data mining. In: Mobility, Data Mining and Privacy, pp. 267–296 (2008)
Pfoser, D., Jensen, C.S.: Capturing the uncertainty of moving-object representations. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, pp. 111–132. Springer, Heidelberg (1999)
Rinzivillo, S., Pedreschi, D., Nanni, M., Giannotti, F., Andrienko, N., Andrienko, G.: Visually driven analysis of movement data by progressive clustering. Information Visualization 7, 225–239 (2008)
Vlachos, M.G.D., George Kollios, G.: Discovering similar multidimensional trajectories. In: ICDE, pp. 673–684 (2002)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Wolfson, O.: Moving objects information management: The database challenge. In: Halevy, A.Y., Gal, A. (eds.) NGITS 2002. LNCS, vol. 2382, pp. 75–89. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuijpers, B., Moelans, B., Othman, W., Vaisman, A. (2009). Analyzing Trajectories Using Uncertainty and Background Information. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds) Advances in Spatial and Temporal Databases. SSTD 2009. Lecture Notes in Computer Science, vol 5644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02982-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-02982-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02981-3
Online ISBN: 978-3-642-02982-0
eBook Packages: Computer ScienceComputer Science (R0)