Clustering Data Streams

The data stream model has recently attracted attention for its applicability to numerous types of data, including telephone records, web documents and clickstreams. For analysis of such data, the ability to process the data in a single pass, or a small number of passes, while using little memory, is crucial. We describe such a streaming algorithm that effectively clusters large data streams. We also provide empirical evidence of the algorithm’s performance on synthetic and real data streams.

• Type: Conference
• Year: 2000
• Where: FOCS
• Authors: Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan
• Keywords: Data Stream Model, Data Streams, FOCS 2000, Large Data Streams, Theoretical Computer Science