Abstract
Spatial data mining is an active topic in spatial databases. This paper proposes a new clustering method for moving object trajectories databases. It applies specifically to trajectories that only lie on a predefined network. The proposed algorithm (NETSCAN) is inspired from the well-known density based algorithms. However, it takes advantage of the network constraint to estimate the object density. Indeed, NETSCAN first computes dense paths in the network based on the moving object count, then, it clusters the sub-trajectories which are similar to the dense paths. The user can adjust the clustering result by setting a density threshold for the dense paths, and a similarity threshold within the clusters. This paper describes the proposed method. An implementation is reported, along with experimental results that show the effectiveness of our approach and the flexibility allowed by the user parameters.
This is a preview of subscription content, log in via an institution to check access.
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
Ankerst M., M. M. Breunig, H.-P. Kriegel and J. Sander (1999), OPTICS: Ordering Points to Identify the Clustering Structure, In Proc. 1999 ACM SIGMOD Int’l Conf. on Management of Data, Philadelphia, Pennsylvania, pp. 46-60.
Brinkhoff T., A Framework for Generating Network-Based Moving Objects, GeoInformatica, Vol. 6, No. 2, Kluwer, 2002, 153-180
Chang J-W., R. Bista, Y-C. Kim and Y-K Kim (2007) Spatio-temporal Similarity Measure Algorithm for Moving Objects on Spatial Networks. ICCSA 2007, pp.1165-1178.
Chen L., M.T. Ozsu and V. Oria (2005), Robust and Fast Similarity Search for Moving Object Trajectories. In: ACM SIGMOD, pp. 491-502. ACM Press, New York.
Du Mouza C. and P. Rigaux. Mobility Patterns. In Proc. Intl. Workshop on Spatiotemporal Databases (STDBM’04).
Ester M., H.-P. Kriegel, J. Sander and X. Xu (1996) A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, In Proc. 2nd Int’l Conf. on Knowledge Discovery and Data Mining, Portland, Oregon, pp. 226-231.
Gaffney S. and P. Smyth, (1999) Trajectory Clustering with Mixtures of Regression Models, In Proc. 5th ACM SIGMOD Int’l Conf. on knowledge Discovery and Data Mining, San Diego, California, pp. 63-72.
Hadjieleftheriou M., G. Kollios, P. Bakalov, V. Trotras (2005) Complex Spatio-Temporal Pattern Queries. In Proc. of the 31st VLDB Conference.
Han J. and M. Kamber (2006) Data Mining: Concepts and Techniques, 2nd ed., Morgan Kaufmann.
Hwang J-R., H-Y. Kang and K-J. Li (2005) Spatio-temporal Analysis Between Trajectories on Road Networks. ER Workshops 2005, LNCS 3770, pp. 280-289.
Lee J-G, J. Han and K-Y. Whang (2007) Trajectory Clustering: A Partition-and-Group Framework. In Proc. SIGMOD’07, Beijing, China.
Lin B., J. Su (2005) Shapes Based Trajectory Queries for Moving Objects. GIS, pp. 21-30.
Lloyd S. (1982) Least Squares Quantization in PCM, IEEE Trans. on Information Theory, 28(2): 129-137.
Sakurai Y., M. Yoshikawa and C. Faloutsos (2005) FTW: Fast Similarity Search under the Time Warping Distance. In: PODS, pp. 326-337.
Savary L., Wan T., Zeitouni K., Spatio-Temporal Data Warehouse Design for Activity Pattern Analysis, DEXA Workshop on Geographic Information Management, September, 2004, Zaragoza, Spain, pp. 814-818.
Shim C-B and J-W Chang (2003) Similar Sub-Trajectory Retrieval for Moving Objects in Spatiotemporal Databases. In: Proc. of the 7th EECADIS, pp.308-322.
Tiakas E., A. N. Papadopoulos, A. Nanopoulos and Y. Manolopoulos (2006) Trajectory Similarity Search in Spatial Networks. In : Proc. of the 10th IDEAS, pp. 185-192.
Vlachos M., D. Gunopulos and G. Kollios (2002) Robust Similarity Measures of Mobile Object Trajectories. In: Proc. of the 13 th Intl. Workshop on DEXA, IEEE Computer Society Press, Los Alamitos pp. 721-728.
Vlachos M., G. Kollios and D. Gunopulos (2002) Discovering Similar Multidimensional Trajectories. In: Proc. Of the 18th ICDE. IEEE Computer Society Press, Los Alamitos pp. 673-684.
Wan T. and Zeitouni K., An OLAP System for Network-Constraint Moving Objects, ACM SAC 2007, The 22nd Annual ACM Symposium on Applied Computing, Seoul, Korea, March, 2007, pp. 13-18.
Yanagisawa Y., J. Akahani, T. Satoch (2003) Shape-Based Similarity Query for Trajectory of Mobile Objects. In : Proc. Of the 4th Intl. Conf. On MDM, pp. 63-77.
Zeinalipour-Yazti D., S. Song Lin, D. Gunopulos (2006) Distributed Spatio-Temporal Similarity Search. CIKM, pp. 14-23.
Zhang T., R. Ramakrishnan, and M. Livny (1996) BIRCH: An Efficient Data Clustering Method for Very Large Databases. In Proc. ACM SIGMOD Int’l Conf. on Management of Data, Montreal, Canada, pp. 103-114.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kharrat, A., Popa, I.S., Zeitouni, K., Faiz, S. (2008). Clustering Algorithm for Network Constraint Trajectories. In: Ruas, A., Gold, C. (eds) Headway in Spatial Data Handling. Lecture Notes in Geoinformation and Cartography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68566-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-68566-1_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68565-4
Online ISBN: 978-3-540-68566-1
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)