<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>HyperMinHash: MinHash in LogLog space · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1710.08436/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1710.08436/feed.xml" rel="self" type="application/rss+xml" /><item><title>HyperMinHash: MinHash in LogLog space — mentioned by seiflotfy</title><link>https://news.ycombinator.com/item?id=18451836</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.08436:18451836</guid><pubDate>Wed, 14 Nov 2018 17:42:55 GMT</pubDate><description>&lt;p&gt;Author of the Library here: I can&amp;#x27;t fully agree that HyperLogLogs are good for intersections, that does not mean it can&amp;#x27;t be done, just there is always a high error rate. The easy way to do that is to maintain a separate MinHash sketch per HLL and use the Jaccard Index of several of those HLLs... an even more naive just use the Jaccard Index with the HLL registers but good luck getting good results out of that. This library is based on https://arxiv.org/pdf/1710.08436v4.pdf which has the benchmarks... Also I will be taking a stab at http://www.vldb.org/pvldb/vol11/p1097-nazi.pdf very soon :)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.08436/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>HyperMinHash: MinHash in LogLog space — mentioned by yunwilliamyu</title><link>https://news.ycombinator.com/item?id=16106204</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.08436:16106204</guid><pubDate>Tue, 09 Jan 2018 14:06:59 GMT</pubDate><description>&lt;p&gt;Thanks so much for producing a Golang implementation of our HyperMinHash paper (I&amp;#x27;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 looks more efficient than ours, and I may start pointing people to your Github repo too. [0]: https://arxiv.org/abs/1710.08436 [1]: https://github.com/yunwilliamyu/hyperminhash&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.08436/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
