Fetching the paper…
Reading the bibliography…
Diffusion maps is a manifold learning algorithm widely used for dimensionality reduction.
1910
Earlier work this paper cites.
1912
Earlier work this paper cites.
1912
Earlier work this paper cites.
Sinkhorn, R. (1964), ‘A relationship between arbitrary positive matrices and doubly stochastic matrices’, Ann. Math. Statist
1964
Earlier work this paper cites.
Altschuler, J., Niles-Weed, J. & Rigollet, P. (2017), Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration, in
1974
Earlier work this paper cites.
Osborn, J. E. (1975), ‘Spectral approximation for compact operators’, Mathematics of computation
1975
Earlier work this paper cites.
Knerr, B. F. (1980), ‘Parabolic interior Schauder estimates by the maximum principle’, Archive for Rational Mechanics and Analysis
1980
Earlier work this paper cites.
Evans, L. (1998), Partial Differential Equations
1998
Earlier work this paper cites.
Ilyin, A. A. (1998), ‘Global averaging of dissipative dynamical systems’, Rendiconti Academia Nazionale delle Scidetta dli XL. Memorie di Matematica e Applicazioni
1998
Earlier work this paper cites.
Keller, G. & Liverani, C. (1999), ‘Stability of the spectrum for transfer operators’, Annali della Scuola Normale Superiore di Pisa-Classe di Scienze
1999
Earlier work this paper cites.
Liskevich, V. & Semenov, Y. (2000), ‘Estimates for fundamental solutions of second-order parabolic equations’, Journal of the London Mathematical Society
2000
Earlier work this paper cites.
Lorenzi, L. (2000), ‘Optimal Schauder estimates for parabolic problems with data measurable with respect to time’, SIAM Journal on Mathematical Analysis
2000
Earlier work this paper cites.
Brand, M. & Huang, K. (2003), A unifying theorem for spectral embedding and clustering., in
2003
Earlier work this paper cites.
von Luxburg, U., Bousquet, O. & Belkin, M. (2004), On the convergence of spectral clustering on random samples: the normalized case, in
2004
Earlier work this paper cites.
Coifman, R. R., Lafon, S., Lee, A. B., Maggioni, M., Nadler, B., Warner, F. & Zucker, S. W. (2005), ‘Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps’, Proceedings of the National Academy of Sciences
2005
Cited alongside, same era.
Hein, M., Audibert, J.-Y. & Von Luxburg, U. (2005), From graphs to manifolds—weak and strong pointwise consistency of graph Laplacians, in
2005
Cited alongside, same era.
Coifman, R. R. & Lafon, S. (2006), ‘Diffusion maps’, Applied and Computational Harmonic Analysis
2006
Cited alongside, same era.
Haase, M. (2006), The functional calculus for sectorial operators, in
2006
Cited alongside, same era.
Henry, D. (2006), Geometric theory of semilinear parabolic equations
2006
Cited alongside, same era.
2015
Later among the works it cites.
Wang, X., Nie, F. & Huang, H. (2016), Structured doubly stochastic matrix for graph based clustering: Structured doubly stochastic matrix, in
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
Nadler, B., Lafon, S., Kevrekidis, I. & Coifman, R. R. (2006), Diffusion maps, spectral clustering and eigenfunctions of Fokker-Planck operators, in
2006
Cited alongside, same era.
Singer, A. (2006), ‘From graph to manifold Laplacian: The convergence rate’, Applied and Computational Harmonic Analysis
2006
Cited alongside, same era.
Belkin, M. & Niyogi, P. (2007), Convergence of Laplacian eigenmaps, in
2007
Cited alongside, same era.
von Luxburg, U., Belkin, M. & Bousquet, O. (2008), ‘Consistency of spectral clustering’, The Annals of Statistics
2008
Cited alongside, same era.
Wang, F., Li, P., König, A. C. & Wan, M. (2012), ‘Improving clustering by learning a bi-stochastic data similarity matrix’, Knowledge and information systems
2012
Cited alongside, same era.
Cuturi, M. (2013), Sinkhorn distances: Lightspeed computation of optimal transport, in
2013
Cited alongside, same era.
2017
Later among the works it cites.
Feydy, J., Séjourné, T., Vialard, F.-X., Amari, S.-i., Trouve, A. & Peyré, G. (2019), Interpolating between optimal transport and MMD using Sinkhorn divergences, in
2019
Later among the works it cites.
Li, D. (2019), ‘On Kato–Ponce and fractional Leibniz’, Revista Matemática Iberoamericana
2019
Later among the works it cites.
Marshall, N. F. & Coifman, R. R. (2019), ‘Manifold learning with bi-stochastic kernels’, IMA Journal of Applied Mathematics
2019
Later among the works it cites.
Available at https://github.com/JuliaApproximation/ApproxFun.jl and in the Julia package repository
Olver, S. (2019), ‘ApproxFun’ · 2019
Later among the works it cites.
Peyré, G. & Cuturi, M. (2019), ‘Computational optimal transport’, Foundations and Trends in Machine Learning
2019
Later among the works it cites.
Trillos, N. G., Gerlach, M., Hein, M. & Slepčev, D. (2019), ‘Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace–Beltrami operator’, Foundations of Computational Mathematics
2019
Later among the works it cites.
Lu, J. (2020), ‘Graph approximations to the Laplacian spectra’, Journal of Topology and Analysis
2020
Closest in time.
Wang, Q., He, X., Jiang, X. & Li, X. (2020), ‘Robust bi-stochastic graph regularized matrix factorization for data clustering’, IEEE Transactions on Pattern Analysis and Machine Intelligence
2020
Closest in time.