258 citations · 935 across the 92 of their papers we have counts for
8 papers · 1 filter
Asymmetric Minwise Hashing
Anshumali Shrivastava, Ping Li
Minwise hashing (Minhash) is a widely popular indexing scheme in practice. Minhash is designed for estimating set resemblance and is known to be suboptimal in many applications whe…
Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS)
Anshumali Shrivastava, Ping Li
Recently it was shown that the problem of Maximum Inner Product Search (MIPS) is efficient and it admits provably sub-linear hashing algorithms. Asymmetric transformations before h…
In Defense of MinHash Over SimHash
Anshumali Shrivastava, Ping Li
MinHash and SimHash are the two widely adopted Locality Sensitive Hashing (LSH) algorithms for large-scale data processing applications. Deciding which LSH to use for a particular…
Improved Densification of One Permutation Hashing
Anshumali Shrivastava, Ping Li
The existing work on densification of one permutation hashing reduces the query processing cost of the -parameterized Locality Sensitive Hashing (LSH) algorithm with minwise…
Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS)
Anshumali Shrivastava, Ping Li
We present the first provably sublinear time algorithm for approximate \emph{Maximum Inner Product Search} (MIPS). Our proposal is also the first hashing algorithm for searching wi…
Graph Kernels via Functional Embedding
Anshumali Shrivastava, Ping Li
We propose a representation of graph as a functional object derived from the power iteration of the underlying adjacency matrix. The proposed functional representation is a graph i…