1. Arthur, D., Sergi, V. (2007) K-means++: The Advantages of Careful Seeding. SODA ’ 07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1027-1035 .
2. Banker, R. D., Chang, H., & Zheng, Z. (2017). On the use of super-efficiency procedures for ranking efficient units and identifying outliers. Ann Oper Res, 250(1), 21–35.
3. Bauckhage, C. K-means clustering is matrix factorization. arXiv preprint arXiv:1512.07548, (2015).
4. Bertsekas, D. P. (1999). Nonlinear Programming (2nd ed.). Belmont, Massachusetts: Athena Scientific.
5. Bolte, J., Sabach, S., & Teboulle, M. (2014). Proximal alternating linearized minimization for non-convex and non-smooth problems. Math Program, 146, 459–494.