Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
From MaRDI portal
Publication:2128423
DOI10.1007/978-3-030-97549-4_1zbMath1484.68183OpenAlexW4226065875MaRDI QIDQ2128423
Yue Shen, Lenore J. Cowen, Junyuan Lin, Kaiyi Wu, Xiaozhe Hu
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-97549-4_1
Learning and adaptive systems in artificial intelligence (68T05) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70) Systems biology, networks (92C42) Anomalous diffusion models (subdiffusion, superdiffusion, continuous-time random walks, etc.) (60K50)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Extensions of Lipschitz mappings into a Hilbert space
- Multidimensional binary search trees used for associative searching
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- Computing the diffusion state distance on graphs via algebraic multigrid and random projections
- Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks
This page was built for publication: Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance