Robust clustering by deterministic agglo
β
Shy Shoham
π
Article
π
2002
π
Elsevier Science
π
English
β 366 KB
This paper presents new robust clustering algorithms, which signiΓΏcantly improve upon the noise and initialization sensitivity of traditional mixture decomposition algorithms, and simplify the determination of the optimal number of clusters in the data set. The algorithms implement maximum likelihoo