Fast Approximation of Similarity Graphs with Kernel Density Estimation

Peter Macgregor, He Sun

Constructing a similarity graph from a set $X$ of data points in ${\mathbb{R}}^d$ is the first step of many modern clustering algorithms. However, typical constructions of a similari…