Efficient (approximate) computation of set similarity in very large datasets is a common task with many applications in information retrieval and data management. One common approach for this task is minwise hashing.
The full text of this article is premium content
Joan Puigcerver i Perez
July 26, 2011 03:58
Isn't there an error in the first formula, when the article describes the "resemblance or Jaccard similarity, denoted by R"?
The numerator and denominator of the division are the same number (cardinalty of the union of S1 and S2), the result should be 1.
July 26, 2011 11:23
You are correct about the first formula; instead, please refer to equation (1), which has the correct definition of the Jaccard-Overlap.
We just checked and our final submission really did not have that error in the first formula. This error must have occurred later and we did not catch it during the review of the page proofs.
Hopefully the online version will be corrected.
Ping and Christian
Displaying all 2 comments
Log in to Read the Full Article
Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.