1. Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding, SODA (2007)
2. Celebi, M., Kingravi, H., Vela, P.: A comparative study of efficient initialisation methods for the K-Means clustering algorithm. Expert Syst. Appl. 40(1), 200–210 (2013)
3. Chronis, P., Athanasiou, S., Skiadopoulos, S.: Automatic clustering by detecting significant density dips in multiple dimensions. In: ICDM (2019)
4. Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum-Likelihood from incomplete data via the EM algorithm. J. Royal Stat. Soc. 39(1), 1–22 (1977)
5. Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD (1996)