2 citations · 6 across the 9 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015★ 1 cited
I/O-Efficient Similarity Join
Rasmus Pagh, Ninh Pham, Francesco Silvestri +1
We present an I/O-efficient algorithm for computing similarity joins based on locality-sensitive hashing (LSH). In contrast to the filtering methods commonly suggested our method h…
cs.DS2015
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence
Mathias Bæk Tejs Knudsen, Morten Stöckel
Randomized algorithms and data structures are often analyzed under the assumption of access to a perfect source of randomness. The most fundamental metric used to measure how "rand…
cs.DB2015★ 1 cited
Association Rule Mining using Maximum Entropy
Rasmus Pagh, Morten Stöckel
Recommendations based on behavioral data may be faced with ambiguous statistical evidence. We consider the case of association rules, relevant e.g.~for query and product recommenda…