Data stream clustering: Difference between revisions

Revision as of 22:40, 8 February 2010

Revision as of 22:55, 8 February 2010

Line 9:

The problem of data stream clustering is defined as:

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

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

== Algorithms ==