On variants of the Johnson–Lindenstrauss lemma
暂无分享,去创建一个
[1] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[2] Peter Frankl,et al. The Johnson-Lindenstrauss lemma and the sphericity of some graphs , 1987, J. Comb. Theory, Ser. B.
[3] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[4] C. Schütt,et al. Projection constants of symmetric spaces and variants of Khintchine's inequality , 1999 .
[5] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.
[6] J. R. Lee,et al. Embedding the diamond graph in Lp and dimension reduction in L1 , 2004, math/0407520.
[7] Noga Alon,et al. Problems and results in extremal combinatorics--I , 2003, Discret. Math..
[8] Dimitris Achlioptas,et al. Database-friendly random projections: Johnson-Lindenstrauss with binary coins , 2003, J. Comput. Syst. Sci..
[9] Sanjoy Dasgupta,et al. An elementary proof of a theorem of Johnson and Lindenstrauss , 2003, Random Struct. Algorithms.
[10] Kenneth Ward Church,et al. Nonlinear Estimators and Tail Bounds for Dimension Reduction in l1 Using Cauchy Random Projections , 2006, J. Mach. Learn. Res..
[11] S. Mendelson,et al. Empirical processes and random projections , 2005 .
[12] Bernard Chazelle,et al. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform , 2006, STOC '06.
[13] Piotr Indyk,et al. Nearest-neighbor-preserving embeddings , 2007, TALG.