Abstract
Given a set of moving objects, we show the applicability of using coresets to perform fast approximate clustering. A trajectory coreset is simply a small weighted set of the trajectory segments that approximates the original trajectory. In this paper, we present an efficient algorithm that integrates coreset approximation with k-means clustering. Our methodology to build the trajectory coreset depends on using the trajectory segments movement direction. Using the movement direction feature of the segments we basically select the most influential segments to contribute in our coreset. The main strength of the algorithm is that it can quickly determine a clustering of a dataset for any number of clusters. In addition, to measure the quality of the resulting clustering, we use the silhouette coefficient. Finally, we present experimental results that show the efficiency of our proposed algorithm.
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
http://www.environmental-studies.de/projects/projects.html (December 2009)
http://www.ecourier.co.uk (Novemeber 2009)
Agarwal, P.K., Har-peled, S., Varadarajan, K.R.: Geometric approximation via coresets. In: Combinatorial and Computational Geometry, MSRI, pp. 1–30. University Press, New Haven (2005)
Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. In: SODA 1998: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 658–667. Society for Industrial and Applied Mathematics, Philadelphia (1998)
Arora, S., Raghavan, P., Rao, S.: Approximation schemes for euclidean k-medians and related problems. In: STOC 1998: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 106–113. ACM, New York (1998)
Bradley, P.S., Fayyad, U.M.: Refining initial points for k-means clustering. In: ICML 1998: Proceedings of the Fifteenth International Conference on Machine Learning, pp. 91–99. Morgan Kaufmann Publishers Inc., San Francisco (1998)
Bradley, P.S., Fayyad, U.M., Reina, C.A., Bradley, P.S., Fayyad, U., Reina, C.: Scaling clustering algorithms to large databases (1998)
Frahling, G., Sohler, C.: A fast k-means implementation using coresets. In: SCG 2006: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, pp. 135–143. ACM, New York (2006)
Guting, R.H., Schneider, M.: Moving objects databases (September 2005)
Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. In: STOC 2004: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 291–300 (2004)
Indyk, P.: Algorithms for dynamic geometric problems over data streams. In: STOC 2004: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 373–380 (2004)
Ishioka, T.: Extended K-means with an efficient estimation of the number of clusters. In: Leung, K.-S., Chan, L., Meng, H. (eds.) IDEAL 2000. LNCS, vol. 1983, pp. 17–22. Springer, Heidelberg (2000)
Iwerks, G.S., Samet, H., Smith, K.: Continuous k-nearest neighbor queries for continuously moving points with updates. In: VLDB 2003: Proceedings of the 29th International Conference on Very Large Data Bases, pp. 512–523. VLDB Endowment (2003)
Han, M.K.J.: Data mining: Concepts and techniques. In: Proc. ACM Symp. on Principles of Database Systems, p. 770 (2006)
Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: Analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7), 881–892 (2002)
Kaufman, L., Rousseeuw, P. (eds.): Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (1990)
Kolliopoulos, S.G., Rao, S.: A nearly linear-time approximation scheme for the euclidean k-median problem. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 378–389. Springer, Heidelberg (1999)
Liu, W., Wang, Z., Feng, J.: Continuous clustering of moving objects in spatial networks. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008, Part II. LNCS (LNAI), vol. 5178, pp. 543–550. Springer, Heidelberg (2008)
Lloyd, S.P.: Least squares quantization in pcm. Bell Laboratories Internal Technical Report 1(2), 281 (1957)
Macqueen, J.B.: Some methods of classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967)
Mokhtar, H.M.O., Ossama, O., El-Sharkawi, M.: A time parameterized technique for clustering moving object trajectories. International Journal of Data Mining & Knowledge Management Process (IJDKP) 1(1), 14–30 (2011)
Mokhtar, H.M.O., Ossama, O., El-Sharkawi, M.E.: Clustering moving objects using segments slopes. International Journal of Database Management Systems (IJDMS) (accepted for publication - 2011)
Moody, J., Darken, C.J.: Some methods for classification and analysis of multi-variate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1(2), p. 281 (1967)
Ossama, O., Mokhtar, H.M.O., El-Sharkawi, M.: An extended k-means technique for clustering moving objects. Egyptian Informatics Journal (2011)
Pelleg, D., Moore, A.: Accelerating exact k-means algorithms with geometric reasoning. In: KDD 1999: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, pp. 277–281 (1999)
Goodman, J.E., Pach, J., Pollack, R. (eds.): Discrete and Computational Geometry. Springer, New York (1995)
Šaltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: SIGMOD: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, vol. 29(2), pp. 331–342 (2000)
Wolfson, O., Xu, B., Chamberlain, S., Jiang, L.: Moving objects databases: issues and solutions. In: SSDBM: Proceedings of the International Conference on Scientific and Statistical Database Management, pp. 111–122 (1998)
Yiu, M.L., Mamoulis, N.: Clustering objects on a spatial network. In: SIGMOD 2004: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 443–454. ACM, New York (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ossama, O., Mokhtar, H.M.O., El-Sharkawi, M.E. (2011). Clustering Moving Object Trajectories Using Coresets. In: Al-Majeed, S.S., Hu, CL., Nagamalai, D. (eds) Advances in Wireless, Mobile Networks and Applications. ICCSEA WiMoA 2011 2011. Communications in Computer and Information Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21153-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-21153-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21152-2
Online ISBN: 978-3-642-21153-9
eBook Packages: Computer ScienceComputer Science (R0)