Advertisement

Unsupervised Trajectory Sampling

  • Nikos Pelekis
  • Ioannis Kopanakis
  • Costas Panagiotakis
  • Yannis Theodoridis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6323)

Abstract

A novel methodology for efficiently sampling Trajectory Databases (TD) for mobility data mining purposes is presented. In particular, a three-step unsupervised trajectory sampling methodology is proposed, that initially adopts a symbolic vector representation of a trajectory which, using a similarity-based voting technique, is transformed to a continuous function that describes the representativeness of the trajectory in the TD. This vector representation is then relaxed by a merging algorithm, which identifies the maximal representative portions of each trajectory, at the same time preserving the space-time mobility pattern of the trajectory. Finally, a novel sampling algorithm operating on the previous representation is proposed, allowing us to select a subset of a TD in an unsupervised way encapsulating the behavior (in terms of mobility patterns) of the original TD. An experimental evaluation over synthetic and real TD demonstrates the efficiency and effectiveness of our approach.

Keywords

Trajectory Databases Sampling Symbolic Trajectories 

References

  1. 1.
    Anagnostopoulos, A., Vlachos, M., Hadjieleftheriou, M., Keogh, E., Yu, P.S.: Global distance-based segmentation of trajectories. In: Proc. of KDD (2006)Google Scholar
  2. 2.
    Andrienko, G., Andrienko, N., Wrobel, S.: Visual Analytics Tools for Analysis of Movement Data. ACM SIGKDD Explorations 9(2) (2007)Google Scholar
  3. 3.
    Andrienko, G., Andrienko, N., Rinzivillo, S., Nanni, M., Pedreschi, D.: A visual analytics toolkit for cluster-based classification of mobility data. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) Advances in Spatial and Temporal Databases. LNCS, vol. 5644, pp. 432–435. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Andrienko, G., Andrienko, N., Rinzivillo, S., Nanni, M., Pedreschi, D., Giannotti, F.: Interactive visual clustering of large collections of trajectories. In: Proc of VAST (2009)Google Scholar
  5. 5.
    Gaffney, S., Smyth, P.: Trajectory Clustering with Mixtures of Regression Models. In: Proc. of SIGKDD (1999)Google Scholar
  6. 6.
    Frentzos, E., Gratsias, K., Pelekis, N., Theodoridis, Y.: Algorithms for Nearest Neighbor Search on Moving Object Trajectories. Geoinformatica 11, 159–193 (2007)CrossRefGoogle Scholar
  7. 7.
    Giannotti, F., Nanni, M., Pedreschi, D., Pinelli, F.: Trajectory Pattern Mining. In: Proc. of SIGKDD (2007)Google Scholar
  8. 8.
    Giannotti, F., Pedreschi, D.: Mobility, Data Mining and Privacy, Geographic Knowledge Discovery. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  9. 9.
    Gudmundsson, J., Kreveld, M.J., Speckmann, B.: Efficient detection of patterns in 2d trajectories of moving points. GeoInformatica 11(2), 195–215 (2007)CrossRefGoogle Scholar
  10. 10.
    Kalnis, P., Mamoulis, N., Bakiras, S.: On discovering moving clusters in spatio-temporal data. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 364–381. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Kollios, G., Gunopulos, D., Koudas, N., Berchtold, S.: Efficient biased sampling for approximate clustering and outlier detection in large datasets. TKDE 15(5) (2003)Google Scholar
  12. 12.
    Lee, J.-G., Han, J., Whang, K.-Y.: Trajectory clustering: a partition-and-group framework. In: Proc. of SIGMOD (2007)Google Scholar
  13. 13.
    Lee, J.-G., Han, J., Li, X.: Trajectory Outlier Detection: A Partition-and-Detect Framework. In: Proc. of ICDE (2008)Google Scholar
  14. 14.
    Li, Y., Han, J., Yang, J.: Clustering moving objects. In: Proc. of KDD (2004)Google Scholar
  15. 15.
    Nanni, M., Pedreschi, D.: Time-focused clustering of trajectories of moving objects. Journal of Intelligent Information Systems 27(3) (2006)Google Scholar
  16. 16.
    Nanopoulos, A., Theodoridis, Y., Manolopoulos, Y.: Indexed-based density biased sampling for clustering applications. Data and Knowledge Engineering 57(1), 37–63 (2006)CrossRefGoogle Scholar
  17. 17.
    Palmer, R., Faloutsos, C.: Density biased sampling: An improved method for data mining and clustering. In: Proc of SIGMOD (2000)Google Scholar
  18. 18.
    Panagiotakis, C., Pelekis, N., Kopanakis, I.: Trajectory voting and classification based on spatiotemporal similarity in moving object databases. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, J.-F. (eds.) IDA 2009. LNCS, vol. 5772, pp. 131–142. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  19. 19.
    Pelekis, N., Kopanakis, I., Kotsifakos, E., Frentzos, E., Theodoridis, Y.: Clustering Trajectories of Moving Objects in an Uncertain World. In: Proc. of ICDM (2009)Google Scholar
  20. 20.
    Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the Generation of Spatiotemporal Datasets. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, p. 147. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  21. 21.
    Yuan, J., Bo, L., Wang, K., Yu, T.: Adaptive spherical gaussian kernel in sparse bayesian learning framework for nonlinear regression. Expert Syst. Appl. 36(2) (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Nikos Pelekis
    • 1
  • Ioannis Kopanakis
    • 2
  • Costas Panagiotakis
    • 3
  • Yannis Theodoridis
    • 4
  1. 1.Dept. of Statistics and Insurance ScienceUniv. of PiraeusGreece
  2. 2.Tech. Educational Inst. of CreteGreece
  3. 3.Dept. of Computer ScienceUniv. of CreteGreece
  4. 4.Dept. of InformaticsUniv. of PiraeusGreece

Personalised recommendations