Convergence of Bregman Projection Methods for Solving Consistent Convex Feasibility Problems in Reflexive Banach Spaces, Journal of Optimization Theory and Applications, vol.51, issue.1, pp.33-61, 1997. ,
DOI : 10.1023/A:1022631928592
Clustering with Bregman Divergences, Journal of Machine Learning Research, vol.6, pp.1705-1749, 2005. ,
DOI : 10.1137/1.9781611972740.22
On the Performance of Clustering in Hilbert Spaces, IEEE Transactions on Information Theory, vol.54, issue.2, pp.781-790, 2008. ,
DOI : 10.1109/TIT.2007.913516
URL : https://hal.archives-ouvertes.fr/hal-00290855
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming, USSR Computational Mathematics and Mathematical Physics, vol.7, issue.3, pp.200-217, 1967. ,
DOI : 10.1016/0041-5553(67)90040-7
Functional Bregman Divergence and Bayesian Estimation of Distributions, IEEE Transactions on Information Theory, vol.54, issue.11, pp.1681-1685, 2008. ,
DOI : 10.1109/TIT.2008.929943
Vector Quantization and Signal Compression, 1992. ,
DOI : 10.1007/978-1-4615-3626-0
Foundations of Quantization for Probability Distributions, Lectures Notes in Mathematics, vol.1730, p.1730, 2000. ,
DOI : 10.1007/BFb0103945
Learning-Theoretic Methods in Vector Quantization, Principles of Nonparametric Learning, 2002. ,
DOI : 10.1007/978-3-7091-2568-7_4
Clustering with Entropy-Like k-Means Algorithms, Grouping Multidimensional Data : Recent Advances in Clustering, pp.127-160, 2006. ,
DOI : 10.1007/3-540-28349-8_5
A Generalization of Proximity Functions for K-means, ICDM '07: Proceedings of the, Seventh IEEE International Conference on Data Mining, pp.361-370, 2007. ,