yunwilliamyu

8 ms·

1. 1.▲
   by yunwilliamyu 8y ago

   Things like b-bit MinHash [Li, Konig, 2010]. A good summary of the problem with asymptotics and some lower bounds is Pagh, Stockel, Woodruff, 2014, "Is Min-Wise Hashing Optimal for Summarizing Set Intersection." There's been
2. 2.▲
   by yunwilliamyu 8y ago

   Should note here that my benchmarks are comparing HyperMinHash to MinHash. I didn't directly compare to HyperLogLog in the paper, though there exist other papers (mostly in the CS theory literature) that do compare MinHash to HyperLogL
3. 3.▲
   by yunwilliamyu 8y ago

   Hi there! I'm the lead author on the paper that Seif (expertly) implements. You're right that my Python implementation isn't at all optimized, as I was more interested in the theory, though I think Seif's Go implementati
4. 4.▲
   by yunwilliamyu 9y ago

   Hi there! I'm the author of the paper the OP implemented, so I thought I'd give a bit more context. In practice, combining together HLL and MinHash as they do for AdRoll gives the same kinds of estimation errors. However, using a
5. 5.▲
   by yunwilliamyu 9y ago

   Thanks so much for producing a Golang implementation of our HyperMinHash paper (I'm the first author) [0] and pointing me to your Hackernews post! As an aside, we also have a prototype Python implementation [1], but your implementation