Références

Arthur, D., and S. Vassilvitskii. 2007. “K-Means++: The Advantages of Careful Seeding.” In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, Orleans, Louisiana, 1027–35.

Boyd, S., and L. Vandenberghe. 2004. Convex Optimization. Cambridge University Press. https://web.stanford.edu/~boyd/cvxbook/.

Kearns, Schapire, M. J. 1994. “Toward Efficient Agnostic Learning.” Machine Learning 17 (2-3): 115–41.

Valiant, Leslie G. 1984. “A Theory of the Learnable.” Communications of the ACM 27 (11): 1134–42.