Clustering moving objects

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 617-622

  Li, Yifan ^a   Han, Jiawei ^a   Yang, Jiong ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

Algorithms; Clustering; Micro cluster; Moving object

Indexed keywords

ALGORITHMS; CORRELATION METHODS; DATA ACQUISITION; IMAGE COMPRESSION; MOBILE COMPUTING; MOTION ESTIMATION; OBJECT RECOGNITION; REAL TIME SYSTEMS;

CLUSTERING; INFORMATION GATHERING; MICRO-CLUSTERS; MOVING OBJECTS;

DATABASE SYSTEMS;

EID: 12244261030     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014129     Document Type: Conference Paper

References (20)

1. M. Ankerst, M. Breunig, H. P. Kriegel, and J. Sander. OPTICS: ordering points to identify the clustering structure. SIGMOD, 1999.
2. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. SIGMOD, 1998.
3. J. Bash, L. J. Guibas, and J. Hershberger. Data structures for mobile data. Journal of Algorithms, 1999.
4. J. Bash, L. J. Guibas, and G. D. Ramkumar. Sweeping lines and line segments with a heap. SoCG, 1997.
5. D. Chudova, S. Gaffney, E. Mjolsness, and P. Smyth. Translation-invariant mixture models for curve clustering. SIGKDD, 2003.
6. G. D. da Fonseca and C. M. H. de Figueiredo. Kinetic heap-ordered trees: tight analysis and improved algorithms. Information Processing Letters, 2003.
7. A. Gersho and R. M. Gray. Vector quantization and signal compression. Kluwer Academic, 1992.
8. S. Guha, R. Rastogi, and K. Shim. CURE: an efficient clustering algorithm for large databases. SIGMOD, 1998.
9. S. Har-Peled. Clustering motion. FOCS, 2001.
10. G. S. Iwerks, H. Samet, and K. Smith. Continuous k-nearest neighbor queries for continuously moving points with updates. VLDB, 2003.
11. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Comput. Surv., 1999.
12. G. Karypis, E. H. Han, and V. Kumar. CHAMELEON: a hierarchical clustering algorithm using dynamic modeling. COMPUTER, 1999.
13. Library for Efficient Data types and Algorithms. 〈http://www. algorithmicsolutions.com/enleda.htm〉.
14. J. MacQueen. Some methods for classification and analysis of multivariate observations. Proc. 5th Berkeley Symp. Math. Statist, 1967.
15. R. Ng and J. Han. Efficient and effective clustering method for spatial data mining. VLDB, 1994.
16. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. SIGMOD, 2000.
17. Y. Tao and D. Papadias. Time-parameterized queries in spatial-temporal databases. SIGMOD, 2002.
18. W. Wang, J. Yang, and R. Muntz. STING: a statistical information grid approach to spatial data mining. VLDB, 1997.
19. O. Wolfson, P. A. Sistla, S. Chamberlain, and Y. Yesha. Updating and querying databases that track mobile units. Distributed and Parallel Databases, 1999.
20. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. SIGMOD, 1996.