Data stream clustering: Difference between revisions

Revision as of 22:56, 8 February 2010

Revision as of 19:30, 11 February 2010

Line 7:

== Definition ==

The problem of data stream clustering is defined as:

'''Input:''' a sequence of ''n'' points in metric space and an integer ''k''.<br />

'''Output:''' ''k'' centers in the set of the ''n'' points so as to minimize the sum of distances from data points to their closest cluster centers.

<br />

This is the streaming version of the k-median problem.

== Algorithms ==