D. Francois, High dimensional data analysis, 2008.

R. Xu and X. Li, High-dimensional data analysis in cancer research. High-Dimensional Data Analysis in Oncology, 2009.

S. Selvaraj and J. Natarajan, Microarray data analysis and mining tools, Bioinformation, vol.6, issue.3, pp.95-99, 2011.

D. M. Mutch, A. Berger, R. Mansourian, A. Rytz, and M. A. Roberts, Microarray data analysis: a practical approach for selecting differentially expressed genes, Genome Biol, vol.2, issue.12, 2001.

E. Marchiori and J. H. Moore, Machine Learning and Data Mining in Bioinformatics: 6th European Conference, 2008.

A. S. Shirkhorshidi, S. Aghabozorgi, and T. Y. Herawan, Big Data Clustering: A Review -Computational Science and Its Applications, ICCSA, 2014.

M. Menoret, N. Farrugia, B. Pasdeloup, and V. Gripon, Evaluating graph signal processing for neuroimaging through classification and dimensionality reduction, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01761345

N. Foy, N. T. Gayraud, and M. Clerc, Systems, man, and cybernetics (smc), IEEE International Conference on, 2016.

I. Abraham, Y. Bartaly, and O. Neimanz, Embedding metric spaces in their intrinsic dimension, ISODA 08 Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, 2008.

J. Wang, Geometric Structure of High-Dimensional Data and Dimensionality Reduction, p.9783642274961, 2012.

K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, When is Nearest Neighbour Meaningful? ICDT '99, 1999.

M. Carreira-perpin, A review of dimension reduction techniques, 1997.

L. J. Van-der-maaten, E. O. Postma, H. J. Van-den, and . Herik, Dimensionality reduction: A comparative review, 2008.

D. Engel, L. Huttenberger, and B. Hamann, A Survey of Dimension Reduction Methods for High-dimensional Data Analysis and Visualization in Proceedings of IRTG 1131-Visualization of Large and Unstructured Data Sets Workshop, 2011.

K. T. Sturm, On the geometry of metric measure spaces, Acta Math, vol.196, issue.1, pp.65-131, 2006.

S. Dubnov, R. El-yaniv, Y. Gdalyahu, E. Schneidman, N. Tishby et al., A new nonparametric pairwise clustering algorithm based on iterative estimation of distance profiles, Machine Learning, 2002.

A. V. Kolesnikov and E. Milman, The KLS isoperimetric conjecture for generalized Orlicz balls, Ann. Probab, vol.46, issue.6, p.2018

Q. Huang, R. Ge, M. Sham, and . Kakade, Learning mixtures of Gaussians in high dimensions, Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, STOC '15, pp.761-770, 2015.

J. Gomes and A. Mojsilovic, A Variational Approach to Recovering a Manifold from Sample Points, pp.3-17, 2002.

J. Boissonnat and M. Yvinec, Algorithmic Geometry, 1998.

W. E. Lorensen and H. E. Cline, Marching cubes: A high resolution 3d surface construction algorithm, SIGGRAPH Comput. Graph, vol.21, issue.4, pp.163-169, 1987.

J. Boissonnat and A. Ghosh, Manifold reconstruction using Tangential Delaunay Complexes. A. Discrete Comput Geom, 2014.
URL : https://hal.archives-ouvertes.fr/inria-00440337

T. S. Newman and H. Yi, A survey of the marching cubes algorithm, 2006.

E. Keogh and A. Mueen, Curse of Dimensionality, pp.257-258, 2010.

R. Bellman, Dynamic Programming, 1957.

R. Bellman, Adaptive control processes: a guided tour, 1961.

V. Guruswami and R. Kannan, Geometry of high dimensional spaces, 2012.

R. Prescott and A. , High-dimensional probability estimation with deep density models, 2013.

K. Saul, K. Weinberger, F. Sha, J. Ham, and D. Lee, Spectral methods for dimensional reduction, 2006.

J. Bourgain, On Lipschitz embedding of finite metric spaces in Hilbert space, Israel J. Math, vol.52, pp.46-52, 1985.

W. B. Johnson and J. Lindenstrauss, Extensions of Lipschitz mappings into a Hilbert space, Conference in modern analysis and probability, pp.189-206, 1982.

S. Dasgupta and Y. Freund, Random projection trees and low dimensional manifolds, Proceedings of the Fortieth Annual ACM Symposium Bibliography on Theory of Computing, STOC '08, pp.537-546, 2008.

J. He, S. Kumar, and S. Chang, On the difficulty of nearest neighbor search, Proceedings of the 29th International Conference on Machine Learning, 2012.

A. Orlitsky, Estimating and computing density based distance metrics, ICML05, 22nd International Conference on Machine Learning, 2005.

M. Ester, H. Kriegel, J. Sander, and X. Xu, A densitybased algorithm for discovering clusters in large spatial databases with noise, pp.226-231, 1996.

R. Prescott and A. , High-dimensional probability estimation with deep density models, 2013.

A. Zomorodian and G. Carlsson, Computing persistent homology, Discrete Comput. Geom, vol.33, pp.249-274, 2005.

D. Cohen, -. Steiner, H. Edelsbrunner, and J. Harer, Stability of persistence diagrams. Discrete & Computational Geometry, 2005.

R. Ghrist, Barcodes: The persistent topology of data, 2007.

H. Edelsbrunner and J. Harer, Persistent homology -a survey, 2008.

F. Chazal, M. D. Cohen-steiner, L. J. Glisse, S. Y. Guibas, and . Oudot, Proximity of persistence modules and their diagrams, Proceedings of the Twenty-fifth Annual Symposium on Computational Geometry SCG '09, 2009.
URL : https://hal.archives-ouvertes.fr/hal-02292996

G. Carlsson, A. Zomorodian, A. Collins, and L. J. Guibas, Persistence barcodes for shapes, International Journal of Shape Modeling, vol.84, 2004.

C. Maria, J. Boissonnat, M. Glisse, and M. Yvinec, The Gudhi Library: Simplicial Complexes and Persistent Homology
URL : https://hal.archives-ouvertes.fr/hal-01108461

P. Indyk and R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC '98, pp.604-613

N. Y. York and . Usa, ACM. ISBN 0-89791-962-9, 1998.

J. Wang, J. Heng-tao-shen, J. Song, and . Ji, Hashing for similarity search: A survey. CoRR, abs/1408.2927, 2014.

M. Datar and P. Indyk, Locality-sensitive hashing scheme based on p-stable distributions, SCG04: Proceedings of the twentieth annual symposium on Computational geometry, pp.253-262, 2004.

Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, Multiprobe LSH: Efficient indexing for high-dimensional similarity search, Proc. 33rd Int. Conf. Very Large Data Bases, pp.950-961, 2007.

A. Andoni, P. Indyk, T. Laarhoven, I. Razenshteyn, and L. Schmidt, Practical and Optimal LSH for Angular Distance, Proceedings of the 28th International Conference on Neural Information Processing Systems, NIPS'15, pp.1225-1233, 2015.

M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, Locality-sensitive hashing scheme based on p-stable distributions, Proceedings of the Twentieth Annual Symposium on Computational Geometry, SCG '04, pp.253-262, 2004.

K. Li and J. Malik, Fast k-nearest neighbour search via prioritized DCI. CoRR, 2017.

C. Williams and M. Seeger, The effect of the input density distributions on kernel based classifiers. International Conference on Machine Learning, vol.17, 2000.

N. E. Karoui, The spectrum of kernel random matrices. The Annals of Statistics, 2010.

G. Hinton and S. Roweis, Stochastic neighbor embedding, Advances in Neural Information Processing Systems 15, pp.833-840, 2003.

J. A. Lee, E. Renard, G. Bernard, P. Dupont, and M. Verleysen, Type 1 and 2 Mixtures of Kullback-Leibler Divergences As Cost Functions in Dimensionality Reduction Based on Similarity Preservation, Neurocomput, vol.112, pp.92-108, 2013.

T. Eiter and L. Libkin, Database theory -icdt 2005, 2005.

. Kumari, J. Sushma, and . Balasubramaniam, Measuring concentration of distances 2014 an effective and efficient empirical index, IEEE Trans. on Knowl. and Data Eng, 2014.

L. Rokach and O. Maimon, Data mining and knowledge discovery handbook, chapter 15 clustering methods, 2010.

M. Gromov, Metric structures for Riemannian and non-Riemannian spaces, 1999.

V. Milman, A certain property of functions defined on infinite-dimensional manifolds, Dokl. Akad. Nauk SSSR, vol.200, pp.781-784, 1971.

M. Ledoux, The Concentration of Measure Phenomenon, AMS Mathematical Surveys & Monographs, 2001.

P. Lévy and F. Pellegrino, Problèmes concrets d'analyse fonctionnelle. Collection de monographies sur la théorie des fonctions Gauthier-Villars Paris, 1951.

J. Matousek, Lectures on Discrete Geometry, 2002.

F. Memoli, On the use of Gromov-Hausdorff distances in shape comparison

I. M. Botsch, R. Pajarola, B. Chen, and M. Zwicker, Eurographics Association, Symposium on Point Based Graphics, 2007.

M. Facundo, Gromov-Hausdorff distances in Euclidean spaces, 2008.

F. Memoli, Some Properties of Gromov-Hausdorff Distances, Discrete & Computational Geometry, pp.1-25, 2012.

. //dx,

M. Facundo, Gromov -Wasserstein distances and the metric approach to object matching, Found. Comput. Mat, issue.11, pp.417-487, 2011.

S. Dasgupta, Learning mixtures of Gaussians, Proceedings of the 40th

, Annual IEEE Symposium on Foundations of Computer Science, FOCS 99, pp.634-644, 1999.

S. Dasgupta and L. Schulman, A two-round variant of EM for Gaussian mixtures, Uncertainty in Artificial Intelligence, 2000.

S. Arora and R. Kannan, Learning mixture of separated non-spherical Gaussians, The Annals of Applied Probability, vol.15, 2005.

S. Vempala and G. Wang, A spectral algorithm for learning mixture models, Journal of Computer and System Sciences Special issue on FOCS, vol.68, issue.4, pp.841-860, 2002.

R. Kannan, S. Vempala, and H. Salmasian, The spectral method for general mixture models, Proc. of the 18th Conference on Learning Theory, vol.87, 2005.

D. Achlioptas and F. Mcsherry, On spectral learning of mixture of distributions, Proc. of COLT, 2005.

S. Brubaker and S. Vempala, Isotropic PCA and affine-invariant clustering, Bolyai Society Mathematical Studies, Proc. of FOCS, 2008.

M. Belkin and K. Sinha, Polynomial learning of distribution families, 2010.

T. Shi, M. Belkin, and B. Yu, Data spectroscopy: Eigenspaces of convolution operators and clustering, Annals of statistics, 2009.

M. Ledoux and S. Bobkov, Poincaré's inequality and Talagrand's concentration phenomenon for the exponential distribution, pp.383-400, 1997.

C. Suquet, Distances euclidiennes sur les mesures signées et application des théorèmes de Berry-Esseen, Bull. Belg. Math. Soc. Simon Stevin, vol.2, issue.2, pp.161-181, 1995.

M. Hein and O. Bousquet, Hilbertian metrics and positive definite kernels on probability measures, Proceedings of AISTATS 2005, pp.136-143, 2005.

N. Fournier and A. Guillin, On the rate of convergence in Wasserstein distance of the empirical measure, Probability Theory and Related Fields, pp.69-92, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00915365

M. D. Kirzbraun, Uber die zusammenziehende und lipschitzsche transformationen, Fundamenta Math, vol.22, pp.77-108, 1934.

J. A. Tropp, Norms of random submatrices and sparse approximation

, Comptes Rendus Mathematique, vol.346, issue.23, pp.1271-1274, 2008.

R. Vershynin, Introduction to the non-asymptotic analysis of random matrices, Bibliography, vol.88, 2012.

Y. B. Farfarovskaia, An estimate of the norm of f(a) -f(b) for selfadjoint operators a and b (in russian), Zap. Nauchn. Sem. LOMI, issue.56, p.143162, 1976.