1. Ackermann, M., Blömer, J., Scholz, C.: Hardness and non-approximability of Bregman clustering problems. Technical report, Electronic colloquium on computational complexity (2011). http://eccc.hpi-web.de/report/2011/015/
2. Amari, S., Nagaoka, H.: Methods of Information Geometry. American Mathematical Society, Providence (2001)
3. Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J.: Clustering with Bregman divergences. J. Mach. Learn. Res. 6, 1705–1749 (2005)
4. Bishop, C.: Pattern Recognition and Machine Learning. Springer, New York (2006)
5. Borg, I., Groenen, P.: Modern Multidimensional Scaling, 2nd edn. Springer, New York (2005)