CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Continuous K-means computation over moving objects by designing different threshold dissemination protocols

by CH.Dayakar Reddy, A Govardhan, Talari Swapna, A Brahmananda Reddy
journal cover thumbnail
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 23
Year of Publication: 2010
Authors: CH.Dayakar Reddy, A Govardhan, Talari Swapna, A Brahmananda Reddy
10.5120/537-701

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 },
issue_date = { February 2010 },
volume = { 1 },
number = { 23 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 53-55 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number23/537-701/ },
doi = { 10.5120/537-701 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:48:42.248627+05:30
%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
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 23
%P 53-55
%D 2010
%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
  1. D. Arthur and S. Vassilvitskii, “How Slow is the k-Means Method,” Proc. 22nd ACM Symp. Computational Geometry (SoCG),2006.
  2. S. Har-Peled and B. Sadri, “How Fast is the k-Means Method,”Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA),2005.
  3. L. Kaufman and P.J. Rousseeuw, “Finding Groups in Data: An Introduction to Cluster Analysis”. John Wiley & Sons, 1990.
  4. S. Lloyd, “Least Squares Quantization in PCM,” IEEE TransInformation Theory, vol. 28, no. 2, pp. 129-136, 1982.
  5. 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.
  6. S. Papadopoulos, D. Sacharidis, and K. Mouratidis, “Continuous Medoid Queries over Moving Objects,” Proc. 10th Int’l Symp. Spatial and Temporal Databases (SSTD), 2007.
  7. 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

Computer Science
Information Sciences

Keywords

k-Means continuous monitoring query processing

Powered by PhDFocusTM