Continuous k-means monitoring over moving objects

Zhenjie Zhang, Yin Yang, Anthony K.H. Tung, Dimitris Papadias

Research output: Contribution to journalArticle

34 Citations (Scopus)

Abstract

Given a data set P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. Since this problem is NP-hard, several approximate algorithms have been proposed and used in practice. In this paper, we study continuous k-means computation at a server that monitors a set of moving objects. Reevaluating k-means every time there is an object update imposes a heavy burden on the server (for computing the centers from scratch) and the clients (for continuously sending location updates). We overcome these problems with a novel approach that significantly reduces the computation and communication costs, while guaranteeing that the quality of the solution, with respect to the reevaluation approach, is bounded by a user-defined tolerance. The proposed method assigns each moving object a threshold (i.e., range) such that the object sends a location update only when it crosses the range boundary. First, we develop an efficient technique for maintaining the k-means. Then, we present mathematical formulas and algorithms for deriving the individual thresholds. Finally, we justify our performance claims with extensive experiments.

Original languageEnglish
Article number4479463
Pages (from-to)1205-1216
Number of pages12
JournalIEEE Transactions on Knowledge and Data Engineering
Volume20
Issue number9
DOIs
Publication statusPublished - Sep 2008
Externally publishedYes

Fingerprint

Servers
Monitoring
Computational complexity
Communication
Costs
Experiments

Keywords

  • k-means, continuous monitoring, query processing

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Continuous k-means monitoring over moving objects. / Zhang, Zhenjie; Yang, Yin; Tung, Anthony K.H.; Papadias, Dimitris.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 20, No. 9, 4479463, 09.2008, p. 1205-1216.

Research output: Contribution to journalArticle

Zhang, Zhenjie ; Yang, Yin ; Tung, Anthony K.H. ; Papadias, Dimitris. / Continuous k-means monitoring over moving objects. In: IEEE Transactions on Knowledge and Data Engineering. 2008 ; Vol. 20, No. 9. pp. 1205-1216.
@article{93e35e5e9ea14342b02346394e3e7bc0,
title = "Continuous k-means monitoring over moving objects",
abstract = "Given a data set P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. Since this problem is NP-hard, several approximate algorithms have been proposed and used in practice. In this paper, we study continuous k-means computation at a server that monitors a set of moving objects. Reevaluating k-means every time there is an object update imposes a heavy burden on the server (for computing the centers from scratch) and the clients (for continuously sending location updates). We overcome these problems with a novel approach that significantly reduces the computation and communication costs, while guaranteeing that the quality of the solution, with respect to the reevaluation approach, is bounded by a user-defined tolerance. The proposed method assigns each moving object a threshold (i.e., range) such that the object sends a location update only when it crosses the range boundary. First, we develop an efficient technique for maintaining the k-means. Then, we present mathematical formulas and algorithms for deriving the individual thresholds. Finally, we justify our performance claims with extensive experiments.",
keywords = "k-means, continuous monitoring, query processing",
author = "Zhenjie Zhang and Yin Yang and Tung, {Anthony K.H.} and Dimitris Papadias",
year = "2008",
month = "9",
doi = "10.1109/TKDE.2008.54",
language = "English",
volume = "20",
pages = "1205--1216",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "9",

}

TY - JOUR

T1 - Continuous k-means monitoring over moving objects

AU - Zhang, Zhenjie

AU - Yang, Yin

AU - Tung, Anthony K.H.

AU - Papadias, Dimitris

PY - 2008/9

Y1 - 2008/9

N2 - Given a data set P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. Since this problem is NP-hard, several approximate algorithms have been proposed and used in practice. In this paper, we study continuous k-means computation at a server that monitors a set of moving objects. Reevaluating k-means every time there is an object update imposes a heavy burden on the server (for computing the centers from scratch) and the clients (for continuously sending location updates). We overcome these problems with a novel approach that significantly reduces the computation and communication costs, while guaranteeing that the quality of the solution, with respect to the reevaluation approach, is bounded by a user-defined tolerance. The proposed method assigns each moving object a threshold (i.e., range) such that the object sends a location update only when it crosses the range boundary. First, we develop an efficient technique for maintaining the k-means. Then, we present mathematical formulas and algorithms for deriving the individual thresholds. Finally, we justify our performance claims with extensive experiments.

AB - Given a data set P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. Since this problem is NP-hard, several approximate algorithms have been proposed and used in practice. In this paper, we study continuous k-means computation at a server that monitors a set of moving objects. Reevaluating k-means every time there is an object update imposes a heavy burden on the server (for computing the centers from scratch) and the clients (for continuously sending location updates). We overcome these problems with a novel approach that significantly reduces the computation and communication costs, while guaranteeing that the quality of the solution, with respect to the reevaluation approach, is bounded by a user-defined tolerance. The proposed method assigns each moving object a threshold (i.e., range) such that the object sends a location update only when it crosses the range boundary. First, we develop an efficient technique for maintaining the k-means. Then, we present mathematical formulas and algorithms for deriving the individual thresholds. Finally, we justify our performance claims with extensive experiments.

KW - k-means, continuous monitoring, query processing

UR - http://www.scopus.com/inward/record.url?scp=50649090227&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50649090227&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2008.54

DO - 10.1109/TKDE.2008.54

M3 - Article

VL - 20

SP - 1205

EP - 1216

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 9

M1 - 4479463

ER -