Optimal construction of k-nearest neighbor graphs for identifying noisy clusters

Open in new window