Publisher
Springer Nature Switzerland
Reference22 articles.
1. Alguliyev, R.M., Aliguliyev, R.M., Isazade, N.R., Abdi, A., Idris, N.: Cosum: text summarization based on clustering and optimization. Expert Syst. 36(1) (2019). https://doi.org/10.1111/exsy.12340
2. Aloise, D., Deshpande, A., Hansen, P., et al.: Np-hardness of euclidean sum-of-squares clustering. Mach. Learn. (2009). https://doi.org/10.1007/s10994-009-5103-0
3. Arthur, D., Vassilvitskii, S.: K-means++: The advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 1027–1035. Society for Industrial and Applied Mathematics, USA (2007)
4. Bahmani, B., Moseley, B., Vattani, A., Kumar, R., Vassilvitskii, S.: Scalable k-means++. In: Proceedings of the VLDB Endowment, vol. 5, pp. 622–633 (2012)
5. Chen, X., Fang, Y., Yang, M., Nie, F., Zhao, Z., Huang, J.Z.: Purtreeclust: A clustering algorithm for customer segmentation from massive customer transaction data. IEEE Trans. Knowl. Data Eng. 30(3), 559–572 (2018). https://doi.org/10.1109/TKDE.2017.2763620