On indexing error-tolerant set containment
By Parag Agrawal, Arvind Arasu, Raghav Kaushik. 2010
59 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Management Science and Operations Research, Information Retrieval & Search, Signal Processing
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Anshumali Shrivastava
- Ping Li
- Behnam Neyshabur
- Nati Srebro
- Sanjiv Kumar
- Yoshua Bengio
- Minjoon Seo
- Carlos Guestrin
In Management Science and Operations Research
In Information Retrieval & Search
- Anshumali Shrivastava
- Ping Li
- Behnam Neyshabur
- Nati Srebro
- Sanjiv Kumar
- Minjoon Seo
- Ruiqi Guo
- Vidhisha Balachandran
In Signal Processing
- Anshumali Shrivastava
- Ping Li
- Sanjiv Kumar
- Vidhisha Balachandran
- Ruiqi Guo
- Nati Srebro
- Behnam Neyshabur
- Minjoon Seo
Citations in the corpus
- Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS) (2014, methodology): “An efficient MIPS routine can make structural SVM faster and more scalable.”
- Asymmetric Minwise Hashing (2014, methodology): “Despite the interest in Jaccard containment and binary inner products, there were no hashing algorithms for these measures for a long time and minwise hashing is still a widely popular heuristic [1].”
- Asymmetric Minwise Hashing for Indexing Binary Inner Products and Set Containment (2015, methodology): “To mitigate this issue several additional heuristics were proposed, for instance, the heuristic based on minimal infrequent sets [1].”