102 search results - page 1 / 21 » Continuous k-Means Monitoring over Moving Objects |
TKDE
2008
13 years 4 months ago
2008
Given a dataset 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. S...
SIGMOD
2005
ACM
14 years 4 months ago
2005
ACM
This paper proposes a generic framework for monitoring continuous spatial queries over moving objects. The framework distinguishes itself from existing work by being the first to ...
SSD
2007
Springer
13 years 10 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Lately there exist increasing demands for online abnormality monitoring over trajectory streams, which are obtained from moving object tracking devices. This problem is challengin...
DASFAA
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract. Continuous spatial queries retrieve a set of time-varying objects continuously during a given period of time. However, monitoring moving objects to maintain the correctne...