P. Agarwal, S. Har-peled, and K. Varadarajan, Geometric approximation via coresets, Math. Sci. Research Inst. Pub, vol.6, p.42, 2005.

S. Har-peled, Geometric approximation algorithms, 2011.

K. L. Clarkson, Coresets, sparse greedy approximation and the Frank-Wolfe algorithm, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.922-931

M. Langberg and L. J. Schulman, Universal $\epsilon$-approximators for integrals, Proceedings of the twentyfirst annual ACM-SIAM symposium on Discrete Algorithms. SIAM, pp.598-607, 2010.

O. Bachem, M. Lucic, and S. Lattanzi, One-Shot Coresets: The Case of k-Clustering, 2017.

K. Chen, On Coresets for k -Median and k -Means Clustering in Metric and Euclidean Spaces and Their Applications, SIAM Journal on Computing, vol.39, issue.3, pp.923-947, 2009.

V. Braverman, D. Feldman, and H. Lang, New Frameworks for Offline and Streaming Coreset Constructions, 2016.

A. Kulesza and B. Taskar, Determinantal Point Processes for Machine Learning, Foundations and Trends R in Machine Learning, vol.5, pp.123-286, 2012.

A. Munteanu and C. Schwiegelshohn, Coresets-Methods and History: A Theoreticians Design Pattern for Approximation and Streaming Algorithms, 2017.

S. Har-peled and S. Mazumdar, On coresets for k-means and k-median clustering, Proceedings of the thirtysixth annual ACM symposium on Theory of computing, pp.291-300, 2004.

S. Har-peled and A. , Smaller coresets for k-median and k-means clustering, Proceedings of the twenty-first annual symposium on Computational geometry, pp.126-134, 2005.

M. Badoiu and K. L. Clarkson, Optimal core-sets for balls, Computational Geometry, vol.40, issue.1, pp.14-22, 2008.

W. F. De-la, M. Vega, C. Karpinski, Y. Kenyon, and . Rabani, Approximation Schemes for Clustering Problems, Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, ser. STOC '03, pp.50-58, 2003.

A. Kumar, Y. Sabharwal, and S. Sen, Linear-time approximation schemes for clustering problems in any dimensions, Journal of the ACM (JACM), vol.57, issue.2, p.5, 2010.

D. Feldman and M. Langberg, A unified framework for approximating and clustering data, Proceedings of the forty-third annual ACM symposium on Theory of computing, pp.569-578, 2011.

O. Bachem, M. Lucic, and A. Krause, Practical Coreset Constructions for Machine Learning, 2017.

J. M. Phillips, Coresets and Sketches, 2016.

D. P. Woodruff, Sketching as a tool for numerical linear algebra, Foundations and Trends R in Theoretical Computer Science, vol.10, issue.1-2, pp.1-157, 2014.

M. W. Mahoney, Randomized Algorithms for Matrices and Data, Foundations and Trends R in Machine Learning, vol.3, issue.2, pp.123-224, 2011.

C. Boutsidis, A. Zouzias, M. W. Mahoney, and P. Drineas, Randomized Dimensionality Reduction for $k$ -Means Clustering, IEEE Transactions on Information Theory, vol.61, issue.2, pp.1045-1062, 2015.

C. Boutsidis and A. Gittens, Improved matrix algorithms via the Subsampled Randomized Hadamard Transform, 2012.

M. B. Cohen, S. Elder, C. Musco, C. Musco, and M. Persu, Dimensionality Reduction for k-Means Clustering and Low Rank Approximation, 2014.

N. Keriven, N. Tremblay, Y. Traonmilin, and R. Gribonval, Compressive K-means, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.6369-6373, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01386077

K. L. Clarkson and D. P. Woodruff, Low Rank Approximation and Regression in Input Sparsity Time, 2012.

P. Drineas and M. W. Mahoney, Lectures on Randomized Numerical Linear Algebra, 2017.

M. Lucic, O. Bachem, and A. Krause, Linear-time Outlier Detection via Sensitivity, 2016.

M. F. Balcan, S. Ehrlich, and Y. Liang, Distributed k-means and k-median Clustering on General Topologies, Advances in Neural Information Processing Systems, vol.26, 1995.

K. Makarychev, Y. Makarychev, M. Sviridenko, and J. Ward, A bi-criteria approximation algorithm for $k$ Means, 2015.

S. Lloyd, Least squares quantization in PCM, IEEE Transactions on Information Theory, vol.28, issue.2, pp.129-137, 1982.

S. Barthelmé, P. Amblard, and N. Tremblay, Asymptotic equivalence of fixed-size and varying-size determinantal point processes, Bernoulli, 2019.

Y. Li, P. M. Long, and A. Srinivasan, Improved Bounds on the Sample Complexity of Learning, Journal of Computer and System Sciences, vol.62, issue.3, pp.516-527, 2001.

Y. Baraud, A Bernstein-type inequality for suprema of random processes with applications to model selection in non-Gaussian regression, Bernoulli, vol.16, issue.4, pp.1064-1085, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00468827

R. Pemantle and Y. Peres, Concentration of Lipschitz functionals of determinantal and other strong Rayleigh measures, Combinatorics, Probability and Computing, vol.23, issue.1, pp.140-160, 2014.

M. S. Copenhaver, Y. H. Kim, C. Logan, K. Mayfield, S. K. Narayan et al., Diagram vectors and tight frame scaling in finite dimensions, Operators and Matrices, issue.1, pp.73-88, 2014.

P. G. Casazza and G. Kutyniok, Finite frames: Theory and applications, 2012.

J. Tropp, I. Dhillon, and R. Heath, Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences, IEEE Transactions on Information Theory, vol.50, issue.11, pp.2916-2921, 2004.

A. Kroó and D. S. Lubinsky, Christoffel Functions and Universality in the Bulk for Multivariate Orthogonal Polynomials, Canadian Journal of Mathematics, vol.65, issue.3, pp.600-620, 2013.

R. Bardenet and A. Hardy, Monte Carlo with determinantal point processes, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01311263

C. F. Dunkl and Y. Xu, Orthogonal polynomials of several variables, vol.155, 2014.

S. A. Van-de-geer, Empirical Processes in M-estimation, vol.6, 2000.

A. Rahimi and B. Recht, Random features for large-scale kernel machines, Advances in neural information processing systems, pp.1177-1184, 2008.

D. Arthur and S. Vassilvitskii, k-means++: The advantages of careful seeding, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp.1027-1035, 2007.

L. Hubert and P. Arabie, Comparing partitions, Journal of classification, vol.2, issue.1, pp.193-218, 1985.

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.75-174, 2010.

A. Ng, M. Jordan, and Y. Weiss, On spectral clustering: Analysis and an algorithm, Advances in neural information processing systems, vol.2, pp.849-856, 2002.

U. Luxburg, A tutorial on spectral clustering, Statistics and Computing, vol.17, issue.4, pp.395-416, 2007.

N. Tremblay and A. Loukas, Approximating Spectral Clustering via Sampling: a Review, 2019.

E. Abbe and C. Sandon, Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery, Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on, pp.670-688, 2015.

A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications, Phys. Rev. E, vol.84, issue.6, p.66106, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00661643

Y. Lecun, The MNIST database of handwritten digits, 1998.

A. Vedaldi and B. Fulkerson, Vlfeat: an open and portable library of computer vision algorithms, p.1469, 2010.

M. Muja and D. G. Lowe, Scalable Nearest Neighbor Algorithms for High Dimensional Data, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.36, issue.11, pp.2227-2240, 2014.

R. Baraniuk, M. Davenport, R. Devore, and M. Wakin, A Simple Proof of the Restricted Isometry Property for Random Matrices, Constructive Approximation, vol.28, issue.3, pp.253-263, 2008.

J. B. Lasserre and E. Pauwels, The empirical christoffel function in statistics and machine learning, 2017.

A. Prymak, Upper estimates of christoffel function on convex domains, Journal of Mathematical Analysis and Applications, vol.455, issue.2, 1984.

D. J. Sutherland and J. Schneider, On the Error of Random Fourier Features, 2015.

J. B. Hough, M. Krishnapur, Y. Peres, and B. Virág, Determinantal Processes and Independence, Probability Surveys, vol.3, issue.0, pp.206-229, 2006.

N. Tremblay, S. Barthelme, and P. Amblard, Optimized Algorithms to Sample Determinantal Point Processes, 2018.

S. Barthelme, P. Amblard, and N. Tremblay, Asymptotic Equivalence of Fixed-size and Varying-size Determinantal Point Processes, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02086028