On-line clustering
Athman Bouguettaya · IEEE Transactions on Knowledge and Data Engineering · 1996
We focus on the stability and behavior of three widely used clustering algorithms. Various correlation coefficients are computed to help us understand the sensitivity of object clustering. Surprisingly, the results indicate that there is almost no difference among any clustering approach. Furthermore, all methods appear to be near stable. These findings tend to show that the clustering algorithms are independent of the way objects are inherently clustered.