L2AP: Fast cosine similarity search with prefix L-2 norm bounds
Data Engineering, 2014, Pages 784-795.
information filteringAllPairs methodBayesLSH methodCauchy-Schwarz inequalityL2AP algorithmMore(16+)
The All-Pairs similarity search, or self-similarity join problem, finds all pairs of vectors in a high dimensional sparse dataset with a similarity value higher than a given threshold. The problem has been classically solved using a dynamically built inverted index. The search time is reduced by early pruning of candidates using size and ...More
Full Text (Upload PDF)
PPT (Upload PPT)