Revision as of 19:26, 29 January 2010 edit Bfoteini (talk \| contribs) 70 edits →Algorithms ← Previous edit		Revision as of 19:32, 29 January 2010 edit undo Bfoteini (talk \| contribs) 70 edits No edit summary Next edit →
Line 17: [[File:Small-Space.jpg \| thumb \| center ~~\| 520x260px~~ \| Small-Space Algorithm representation]] The approximation factor of this algorithm is <math>2c(1+2b)+2b</math> and if we generalize it so that it recursively calls itself, <math>i</math> times on a successively smaller set of weighted centers then it gives a constant factor approximation to the k-median problem, which, as expected, worsens with each successive reclustering.

Data stream clustering: Difference between revisions