Elio Masciari
ABSTRACT
Trajectory data streams are huge amounts of data pertaining to time and position of moving objects. They are continuously generated by different sources exploiting a wide variety of technologies (e.g., RFID tags, GPS, GSM networks). Mining such amount of data is a challenging problem, since the possibility to extract useful information from this peculiar kind of data is crucial in many application scenarios such as vehicle traffic management, hand-off in cellular networks, supply chain management. Moreover, spatial data streams pose interesting challenges for their proper representation, thus making the mining process harder than for classical point data. In this paper, we address the problem of trajectory data streams clustering, that revealed really intriguing as we deal with a kind of data (trajectories) for which the order of elements is relevant. We propose a complete framework starting from data preparation task that allows us to make the mining step quite effective. Since the validation of data mining approaches has to be experimental we performed several tests on real world datasets that confirmed the efficiency and effectiveness of the proposed technique.
- D. Arthur and S. Vassilvitskii. k-means++ the advantages of careful seeding. In SODA, pages 1027--1035, 2007. Google Scholar
Digital Library
- T. S. Chihara. An Introduction to Orthogonal Polynomials. Gordon and Breach, 1978.Google Scholar
- M. Ester, H. P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, 1996.Google ScholarDigital Library
- F. Giannotti, M. Nanni, F. Pinelli, and D. Pedreschi. Trajectory pattern mining. In KDD, pages 330--339, 2007. Google ScholarDigital Library
- H. Gonzalez, J. Han, X. Li, and D. Klabjan. Warehousing and Analyzing Massive RFID Data Sets. In ICDE, 2006. Google ScholarDigital Library
- J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000. Google ScholarDigital Library
- J. G. Lee, J. Han, X. Li, and H. Gonzalez. TraClass: trajectory classification using hierarchical region-based and trajectory-based clustering. PVLDB, 1(1), 2008. Google ScholarDigital Library
- J. G. Lee, J. Han, and K. Y. Whang. Trajectory clustering: a partition-and-group framework. In SIGMOD, 2007. Google ScholarDigital Library
- Z. Li, J. G. Lee, X. Li, and J. Han. Incremental clustering for trajectories. In DASFAA (2), pages 32--46, 2010. Google ScholarDigital Library
- Y. Liu, L. Chen, J. Pei, Q. Chen, and Y. Zhao. Mining frequent trajectory patterns for activity monitoring using radio frequency tag arrays. In PerCom, pages 37--46, 2007. Google ScholarDigital Library
- S. Lloyd. Least squares quantization in pcm. IEEE TOIT, 28, 1982. Google ScholarDigital Library
- E. Masciari. A complete framework for clustering trajectories. In ICTAI, pages 9--16, 2009. Google ScholarDigital Library
- E. Masciari. Trajectory clustering via effective partitioning. In FQAS, pages 358--370, 2009. Google ScholarDigital Library
- A. V. Oppenheim and R. W. Shafer. Discrete-Time Signal Processing. Prentice Hall, 1999. Google ScholarDigital Library
- W. H. Press et al. Numerical Recipes in C++. Cambridge University Press, 2001.Google Scholar
- M. Puschel and M. Rotteler. Fourier transform for the directed quincunx lattice. In I. C. A. S. S. P., 2005.Google Scholar
- A. Secker and D. Taubman. Lifting-based invertible motion adaptive transform (limat) framework for highly scalable video compression. IEEE Trans. on Image Processing, 12(12):1530--1542, 2003. Google ScholarDigital Library
- W. Wang, J. Yang, and R. R. Muntz. Sting: A statistical information grid approach to spatial data mining. In VLDB, pages 186--195, 1997. Google ScholarDigital Library
- T. Zhang, R. Ramakrishnan, and M. Livny. Birch: An efficient data clustering method for very large databases. In SIGMOD, pages 103--114, 1996. Google ScholarDigital Library
- X. Zhang, X. Wu, and F. Wu. Image coding on quincunx lattice with adaptive lifting and interpolation. In Data Compression Conf., pages 193--202, 2007. Google ScholarDigital Library
- Y. Zheng, L. Zhang, X. Xie, and W. Y. Ma. Mining interesting locations and travel sequences from gps trajectories. In WWW, pages 791--800, 2009. Google ScholarDigital Library
Index Terms
- Finding homogeneous groups in trajectory streams
Recommendations
Warehousing and querying trajectory data streams with error estimation
DOLAP '12: Proceedings of the fifteenth international workshop on Data warehousing and OLAPIn this paper, we address the problem of trajectory data streams warehousing and querying, that revealed really challenging as we deal with data (trajectories) for which the order of elements is relevant. We propose an end to end framework in order to ...
Finding recent frequent itemsets adaptively over online data streams
KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data miningA data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be changed as time goes by. Identifying the recent change of a data stream, ...
Dealing with trajectory streams by clustering and mathematical transforms
Nowadays, almost all kind of electronic devices leave traces of their movements (e.g. smartphone, GPS devices and so on). Thus, the huge number of this "tiny" data sources leads to the generation of massive data streams of geo-referenced data. As a ...
Comments