Continuous k-means monitoring over moving objects

IEEE Transactions on Knowledge and Data Engineering

Volumn 20, Issue 9, 2008, Pages 1205-1216

  Zhang, Zhenjie ^a   Yang, Yin ^b   Tung, Anthony K H ^a   Papadias, Dimitris ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

k means, continuous monitoring, query processing

Indexed keywords

COMMUNICATION; NUCLEAR PROPULSION; TRACKING (POSITION);

APPROXIMATE ALGORITHMS; COMMUNICATION COSTS; DATA SETS; K POINTS; K-MEANS; K-MEANS, CONTINUOUS MONITORING, QUERY PROCESSING; LOCATION UPDATE; LOCATION UPDATES; MATHEMATICAL FORMULAS; MOVING OBJECTS; NP-HARD;

SET THEORY;

EID: 50649090227     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2008.54     Document Type: Article

References (35)

1. D. Arthur and S. Vassilvitskii, "How Slow is the k-Means Method," Proc. 22nd ACM Symp. Computational Geometry (SoCG), 2006.
2. B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan, "Maintaining Variance and k-Means over Data Stream Windows," Proc. ACM Symp. Principles of Database Systems (PODS), 2003.
3. P. Bradley and U. Fayyad, "Refining Initial Points for k-Means Clustering," Proc. 15th Int'l Conf. Machine Learning (ICML), 1998.
4. T. Brinkhoff, "A Framework for Generating Network-Based Moving Objects," GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002.
5. A. Datta, D. Vandermeer, A. Celik, and V. Kumar, "Broadcast Protocols to Support Efficient Retrieval from Databases by Mobile Users," ACM Trans. Database Systems, vol. 24, no. 1, pp. 1-79, 1999.
6. B. Gedik and L. Liu, "MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System," Proc. Ninth Int'l Conf. Extending Database Technology (EDBT), 2004.
7. S. Guha, A. Meyerson, N. Mishra, R. Motwani, and L. O'Callaghan, "Clustering Data Streams: Theory and Practice," IEEE Trans. Knowledge and Data Eng., vol. 15, no. 3, pp. 515-528, May/June 2003.
8. S. Har-Peled and B. Sadri, "How Fast is the k-Means Method," Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), 2005.
9. H. Hu, J. Xu, and D. Lee, "A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects," Proc. ACM SIGMOD, 2005.
10. M. Inaba, N. Katoh, and H. Imai, "Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based Clustering," Proc. 10th ACM Symp. Computational Geometry (SoCG), 1994.
11. A. Jain, M. Murty, and P. Flynn, "Data Clustering: A Review," ACM Computing Surveys, vol. 31, no. 3, pp. 264-323, 1999.
12. C. Jensen, D. Lin, and B.C. Ooi, "Continuous Clustering of Moving Objects," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 9, pp. 1161-1173, Sept. 2007.
13. C. Jensen, D. Lin, B.C. Ooi, and R. Zhang, "Effective Density Queries on Continuously Moving Objects," Proc. 22nd IEEE Int'l Conf. Data Eng. (ICDE), 2006.
14. P. Kalnis, N. Mamoulis, and S. Bakiras, "On Discovering Moving Clusters in Spatio-Temporal Data," Proc. Ninth Int'l Symp. Spatial and Temporal Databases (SSTD), 2005.
15. J.M. Kang, M. Mokbel, S. Shekhar, T. Xia, and D. Zhang, "Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors," Proc. 23rd IEEE Int'l Conf. Data Eng. (ICDE), 2007.
16. T. Kanungo, M. Mount, N. Netanyahu, C. Piatko, R. Silverman, and A. Wu, "An Efficient k-Means Clustering Algorithm: Analysis and Implementation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 881-892, July 2002.
17. L. Kaufman and P.J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, 1990.
18. A. Kumar, Y. Sabharwal, and S. Sen, "A Simple Linear Time (1 + ε)-Approximation Algorithm for k-Means Clustering in Any Dimensions," Proc. 45th Ann. IEEE Symp. Foundations of Computer Science (FOCS), 2004.
19. Y. Li, J. Han, and J. Yang, "Clustering Moving Objects," Proc. 10th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), 2004.
20. S. Lloyd, "Least Squares Quantization in PCM," IEEE Trans. Information Theory, vol. 28, no. 2, pp. 129-136, 1982.
21. M. Meila, "The Uniqueness of a Good Optimum for k-Means," Proc. 23rd Int'l Conf. Machine Learning (ICML), 2006.
22. M. Mokbel, X. Xiong, and W. Aref, "SINA: Scalable Incremental Processing of Continuous Queries in Spatio-Temporal Databases," Proc. ACM SIGMOD, 2004.
23. K. Mouratidis, M. Hadjieleftheriou, and D. Papadias, "Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring," Proc. ACM SIGMOD, 2005.
24. K. Mouratidis, D. Papadias, S. Bakiras, and Y. Tao, "A Threshold-Based Algorithm for Continuous Monitoring of K Nearest Neighbors," IEEE Trans. Knowledge and Data Eng., vol. 17, no. 11, pp. 1451-1464, Nov. 2005.
25. K. Mouratidis, D. Papadias, and S. Papadimitriou, "Tree-Based Partitioning Querying: A Methodology for Computing Medoids in Large Spatial Datasets," The VLDB J., vol. 17, no. 4, pp. 923-945, 2008.
26. K. Mouratidis, M. Yiu, D. Papadias, and N. Mamoulis, "Continuous Nearest Neighbor Monitoring in Road Networks," Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB), 2006.
27. R. Ng and J. Han, "Efficient and Effective Clustering Method for Spatial Data Mining," Proc. 20th Int'l Conf. Very Large Data Bases (VLDB), 1994.
28. S. Papadopoulos, D. Sacharidis, and K. Mouratidis, "Continuous Medoid Queries over Moving Objects," Proc. 10th Int'l Symp. Spatial and Temporal Databases (SSTD), 2007.
29. D. Pelleg and A. Moore, "Accelerating Exact k-Means Algorithms with Geometric Reasoning," Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), 1999.
30. T. Xia and D. Zhang, "Continuous Reverse Nearest Neighbor Monitoring," Proc. 22nd IEEE Int'l Conf. Data Eng. (ICDE), 2006.
31. X. Xiong, M. Mokbel, and W. Aref, "SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-Temporal Databases," Proc. 21st IEEE Int'l Conf. Data Eng. (ICDE), 2005.
32. X. Yu, K. Pu, and N. Koudas, "Monitoring K-Nearest Neighbor Queries over Moving Objects," Proc. 21st IEEE Int'l Conf. Data Eng. (ICDE), 2005.
33. D. Zhang, Y. Du, and L. Hu, "On Monitoring the Top-k Unsafe Places," Proc. 24th IEEE Int'l Conf. Data Eng. (ICDE), 2008.
34. D. Zhang, Y. Du, T. Xia, and Y. Tao, "Progressive Computation of Min-Dist Optimal-Location Query," Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB), 2006.
35. Z. Zhang, B. Dai, and A. Tung, "On the Lower Bound of Local Optimum in k-Means Algorithm," Proc. Sixth IEEE Int'l Conf. Data Mining (ICDM), 2006.