Research Article
Continuous K-means computation over moving objects by designing different threshold dissemination protocols
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 1 - Issue 23 |
| Published: February 2010 |
| Authors: Ch.Dayakar Reddy, A Govardhan, Talari Swapna, A Brahmananda Reddy |
10.5120/537-701
|
| PDF not available |
Ch.Dayakar Reddy, A Govardhan, Talari Swapna, A Brahmananda Reddy . Continuous K-means computation over moving objects by designing different threshold dissemination protocols. International Journal of Computer Applications. 1, 23 (February 2010), 53-55. DOI=10.5120/537-701
@article{ 10.5120/537-701,
author = { Ch.Dayakar Reddy,A Govardhan,Talari Swapna,A Brahmananda Reddy },
title = { Continuous K-means computation over moving objects by designing different threshold dissemination protocols },
journal = { International Journal of Computer Applications },
year = { 2010 },
volume = { 1 },
number = { 23 },
pages = { 53-55 },
doi = { 10.5120/537-701 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2010
%A Ch.Dayakar Reddy
%A A Govardhan
%A Talari Swapna
%A A Brahmananda Reddy
%T Continuous K-means computation over moving objects by designing different threshold dissemination protocols%T
%J International Journal of Computer Applications
%V 1
%N 23
%P 53-55
%R 10.5120/537-701
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In this paper, we study designing different threshold protocols that are used to monitor a set of moving objects in k-means computation at a server. In a given data set P, a k-means query returns k points in space, such that average squared distance between each point in p and its nearest center is minimized. Reevaluating k-means every time there is an object update imposes heavy burden on the server and the clients where it reduces the computation and communication costs. The proposed method assigns each moving object a threshold and uses multiple servers for monitoring locations of distinct set of objects and their updates when it crosses the range boundary.
References
- D. Arthur and S. Vassilvitskii, “How Slow is the k-Means Method,” Proc. 22nd ACM Symp. Computational Geometry (SoCG),2006.
- S. Har-Peled and B. Sadri, “How Fast is the k-Means Method,”Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA),2005.
- L. Kaufman and P.J. Rousseeuw, “Finding Groups in Data: An Introduction to Cluster Analysis”. John Wiley & Sons, 1990.
- S. Lloyd, “Least Squares Quantization in PCM,” IEEE TransInformation Theory, vol. 28, no. 2, pp. 129-136, 1982.
- 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.
- S. Papadopoulos, D. Sacharidis, and K. Mouratidis, “Continuous Medoid Queries over Moving Objects,” Proc. 10th Int’l Symp. Spatial and Temporal Databases (SSTD), 2007.
- 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.
Index Terms
Keywords