Faster Graph Embeddings via Coarsening.
Matthew FahrbachGramoz GoranciRichard PengSushant SachdevaChi WangPublished in: ICML (2020)
Keyphrases
- minimum spanning tree
- graph partitioning
- directed graph
- graph representation
- graph theory
- memory efficient
- graph structure
- random walk
- graph clustering
- connected components
- graph matching
- euclidean space
- weighted graph
- graph model
- edge weights
- search algorithm
- graphical representation
- graph structures
- stable set
- structured data
- spanning tree
- directed acyclic graph
- vector space
- nearest neighbor
- random graphs
- knn
- graph kernels
- graph search
- data points
- genetic algorithm