Yifan Li
Jiawei Han
ABSTRACT
Due to the advances in positioning technologies, the real time information of moving objects becomes increasingly available, which has posed new challenges to the database research. As a long-standing technique to identify overall distribution patterns in data, clustering has achieved brilliant successes in analyzing static datasets. In this paper, we study the problem of clustering moving objects, which could catch interesting pattern changes during the motion process and provide better insight into the essence of the mobile data points. In order to catch the spatial-temporal regularities of moving objects and handle large amounts of data, micro-clustering [20] is employed. Efficient techniques are proposed to keep the moving micro-clusters geographically small. Important events such as the collisions among moving micro-clusters are also identified. In this way, high quality moving micro-clusters are dynamically maintained, which leads to fast and competitive clustering result at any given time instance. We validate our approaches with a through experimental evaluation, where orders of magnitude improvement on running time is observed over normal K-Means clustering method [14].
- M. Ankerst, M. Breunig, H. P. Kriegel, and J. Sander. OPTICS: ordering points to identify the clustering structure. SIGMOD, 1999. Google Scholar
Digital Library
- R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. SIGMOD, 1998. Google ScholarDigital Library
- J. Bash, L. J. Guibas, and J. Hershberger. Data structures for mobile data. Journal of Algorithms, 1999. Google ScholarDigital Library
- J. Bash, L. J. Guibas, and G. D. Ramkumar. Sweeping lines and line segments with a heap. SoCG, 1997. Google ScholarDigital Library
- D. Chudova, S. Gaffney, E. Mjolsness, and P. Smyth. Translation-invariant mixture models for curve clustering. SIGKDD, 2003. Google ScholarDigital Library
- G. D. da Fonseca and C. M. H. de Figueiredo. Kinetic heap-ordered trees: tight analysis and improved algorithms. Information Processing Letters, 2003. Google ScholarDigital Library
- A. Gersho and R. M. Gray. Vector quantization and signal compression. Kluwer Academic, 1992. Google ScholarDigital Library
- S. Guha, R. Rastogi, and K. Shim. CURE: an efficient clustering algorithm for large databases. SIGMOD, 1998. Google ScholarDigital Library
- S. Har-Peled. Clustering motion. FOCS, 2001. Google ScholarDigital Library
- G. S. Iwerks, H. Samet, and K. Smith. Continuous k-nearest neighbor queries for continuously moving points with updates. VLDB, 2003. Google ScholarDigital Library
- A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Comput. Surv., 1999. Google ScholarDigital Library
- G. Karypis, E. H. Han, and V. Kumar. CHAMELEON: a hierarchical clustering algorithm using dynamic modeling. COMPUTER, 1999. Google ScholarDigital Library
- Library for Efficient Data types and Algorithms. <http://www.algorithmic-solutions.com/enleda.htm>.Google Scholar
- J. MacQueen. Some methods for classification and analysis of multivariate observations. Proc. 5th Berkeley Symp. Math. Statist, 1967.Google Scholar
- R. Ng and J. Han. Efficient and effective clustering method for spatial data mining. VLDB, 1994. Google ScholarDigital Library
- S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. SIGMOD, 2000. Google ScholarDigital Library
- Y. Tao and D. Papadias. Time-parameterized queries in spatial-temporal databases. SIGMOD, 2002. Google ScholarDigital Library
- W. Wang, J. Yang, and R. Muntz. STING: a statistical information grid approach to spatial data mining. VLDB, 1997. Google ScholarDigital Library
- O. Wolfson, P. A. Sistla, S. Chamberlain, and Y. Yesha. Updating and querying databases that track mobile units. Distributed and Parallel Databases, 1999. Google ScholarDigital Library
- T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. SIGMOD, 1996. Google ScholarDigital Library
Index Terms
- Clustering moving objects
Recommendations
Clustering moving objects in spatial networks
DASFAA'07: Proceedings of the 12th international conference on Database systems for advanced applicationsAdvances in wireless networks and positioning technologies (e.g., GPS) have enabled new data management applications that monitor moving objects. In such new applications, realtime data analysis such as clustering analysis is becoming one of the most ...
Continuous Clustering of Moving Objects
This paper considers the problem of efficiently maintaining a clustering of a dynamic set of data points that move continuously in two-dimensional Euclidean space. This problem has received little attention and introduces new challenges to clustering. ...
MCMSTClustering: defining non-spherical clusters by using minimum spanning tree over KD-tree-based micro-clusters
AbstractClustering is a technique for statistical data analysis and is widely used in many areas where class labels are not available. Major problems related to clustering algorithms are handling high-dimensional, imbalanced, and/or varying-density ...
Comments