S. Amari and N. Nagaoka, Methods of Information Geometry, 2000.

D. Arthur and S. Vassilvitskii, k-means++: the advantages of careful seeding, SODA, pp.1027-1035, 2007.

V. Athitsos, M. Potamias, P. Papapetrou, and G. Kollios, Nearest neighbor retrieval using distancebased hashing, ICDE, pp.327-336, 2008.

A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh, Clustering with Bregman Divergences, Journal of Machine Learning Research (JMLR), vol.6, pp.1705-1749, 2005.
DOI : 10.1137/1.9781611972740.22

L. Cayton, Fast nearest neighbor retrieval for bregman divergences, Proceedings of the 25th international conference on Machine learning, ICML '08, pp.112-119, 2008.
DOI : 10.1145/1390156.1390171

B. Chazelle, Technical perspective: finding a good neighbor, near and fast, Communications of the ACM, vol.51, issue.1, p.115, 2008.
DOI : 10.1145/1327452.1327493

G. Hamerly and C. Elkan, Learning the k in k-means, NIPS, 2003.

N. Kumar, L. Zhang, and S. K. Nayar, What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?, ECCV, pp.364-378, 2008.
DOI : 10.1007/978-3-540-88688-4_27

B. Manthey and H. Röglin, Improved Smoothed Analysis of the k-Means Method, SODA, 2009.

F. Nielsen, J. Boissonnat, and R. Nock, On Bregman Voronoi diagrams, SODA, pp.746-755, 2007.

F. Nielsen and R. Nock, Bregman sided and symmetrized centroids, International Conference on Pattern Recognition (ICPR), 2008.

R. Nock, P. Luosto, and J. Kivinen, Mixed Bregman Clustering with Approximation Guarantees, ECML/PKDD, pp.154-169, 2008.
DOI : 10.1007/978-3-540-87481-2_11

D. Lowe, Distinctive Image Features from Scale-Invariant Keypoints, International Journal of Computer Vision, vol.60, issue.2, pp.91-111, 2005.
DOI : 10.1023/B:VISI.0000029664.99615.94