All-pairs similarity via DIMSUMWe are often interested in finding users, hashtags and ads that are very similar to one another, so they may be recommended and shown to users and advertisers. To do this, we must consider many pairs of items, and evaluate how “similar” they are to one another. We call this the “all-pairs similarity” problem, sometimes known as a “similarity join.” We have developed a new efficient algorithm to so
guokr/simbase · GitHub - A vector similarity database
http://www.mayomi.org/lecture01/BSJ2008/BSJ2008tutorial2_1.pdf
