A graph-based N-body approximation with application to stochastic neighbor embedding
From MaRDI portal
Publication:2418099
DOI10.1016/j.neunet.2015.11.007zbMath1414.68068OpenAlexW2182420191WikidataQ40185279 ScholiaQ40185279MaRDI QIDQ2418099
Publication date: 3 June 2019
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2015.11.007
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Drawing power law graphs using a local/global decomposition
- Skeletons from the treecode closet
- A General Framework for Dimensionality-Reducing Data Visualization Mapping
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Energy Models for Graph Clustering
- A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis
- The Fast Gauss Transform
- A fast algorithm for particle simulations
This page was built for publication: A graph-based N-body approximation with application to stochastic neighbor embedding