Answers are grounded in this paper and cite their sources.
We propose a fast agglomerative clustering method using an approximate nearest neighbor graph for reducing the number of distance calculations. The time complexity of the algorithm is improved from O(tauN2) to O(tauNlogN) at the cost of a slight increase in distortion; here, tau denotes the number of nearest neighbor updates required at each iteration. According to the experiments, a relatively small neighborhood size is sufficient to maintain the quality close to that of the full search.
No takes yet. Share an insight, caveat, or question.
Fränti et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: