A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites which communicate through a routing tree. Distributed clustering on high speed data streams is a challenging task due to limited communication capacity, storage space, and computing power at each site. In this paper, we propose a suite of algorithms for computing (1 + £)-approximate k-median clustering over distributed data streamsdoi:10.1109/icde.2008.4497522 dblp:conf/icde/ZhangLW08 fatcat:uc4sefkn2jg4fim7lktluirtk4