Proceedings 41st Annual Symposium on Foundations of Computer Science (2000)

Redondo Beach, California

Nov. 12, 2000 to Nov. 14, 2000

ISSN: 0272-5428

ISBN: 0-7695-0850-2

pp: 359

S. Guha , Dept. of Comput. Sci., Stanford Univ., CA, USA

N. Mishra , Dept. of Comput. Sci., Stanford Univ., CA, USA

R. Motwani , Dept. of Comput. Sci., Stanford Univ., CA, USA

L. O'Callaghan , Dept. of Comput. Sci., Stanford Univ., CA, USA

ABSTRACT

We study clustering under the data stream model of computation where: given a sequence of points, the objective is to maintain a consistently good clustering of the sequence observed so far, using a small amount of memory and time. The data stream model is relevant to new classes of applications involving massive data sets, such as Web click stream analysis and multimedia data analysis. We give constant-factor approximation algorithms for the k-median problem in the data stream model of computation in a single pass. We also show negative results implying that our algorithms cannot be improved in a certain sense.

INDEX TERMS

data analysis; pattern clustering; very large databases; computational complexity; deterministic algorithms; data stream clustering; point sequence; data stream model; massive data sets; Web click stream analysis; multimedia data analysis; constant-factor approximation algorithms; k-median problem; deterministic algorithms

CITATION

L. O'Callaghan, S. Guha, R. Motwani and N. Mishra, "Clustering data streams,"

*Proceedings 41st Annual Symposium on Foundations of Computer Science(FOCS)*, Redondo Beach, California, 2000, pp. 359.

doi:10.1109/SFCS.2000.892124

CITATIONS