Three merge algorithms (S-Merge, J-Merge, H-Merge) combine or extend k-NN graphs efficiently, with quality close to building from scratch, and the hierarchical version speeds up nearest-neighbor search.
Efficient k-nearest neighbor graph construction for generic similarity measures,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Merge of k-NN Graph
Three merge algorithms (S-Merge, J-Merge, H-Merge) combine or extend k-NN graphs efficiently, with quality close to building from scratch, and the hierarchical version speeds up nearest-neighbor search.