References
- Banerjee, A.; Guo, X. and Wang, H. (2005). * On the optimality of conditional expectation as a Bregman predictor*. IEEE Transactions on Information Theory 51.
- Banerjee, A.; Merugu, S.; Dhillon, I. and Ghosh, J. (2005). Clustering with Bregman Divergences. Journal of Machine Learning Research.
- Bregman, L. M. (1967). 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 7, 200–217.
- Brécheteau, C. (2018). Robust shape inference from a sparse approximation of the Gaussian trimmed loglikelihood. Accessed on Jul 5, 2023, https://brecheteau.perso.math.cnrs.fr/page/papiers/Robust%20shape%20inference%20from%20a%20sparse%20approximation%20of%20the%20Gaussian%20Trimmed%20Likelihood.pdf.
- Brécheteau, C. and Levrard, C. (2020). A $k$-points-based distance for robust geometric inference. Bernoulli 26, 3017–3050. Accessed on Jul 5, 2023.
- Chazal, F.; Cohen-Steiner, D. and Mérigot, Q. (2011). Geometric Inference for Probability Measures. Foundations of Computational Mathematics 11, 733–751. Accessed on Jul 5, 2023.
- Cuesta-Albertos, J.; Gordaliza, A. and Matràn, C. (1997). Trimmed $k$-means: an attempt to robustify quantizers. Annals of Statistics.
- Lloyd, S. (1982). Least squares quantization in pcm. IEEE Trans. on Information Theory 28, 129–136.