LSH-Preserving Functions and Their Applications
By Flavio Chierichetti, Ravi Kumar. 2012
49 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Information Retrieval & Search
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
- Heng Tao Shen
- Jingdong Wang
- Jingkuan Song
- Jianqiu Ji
- Behnam Neyshabur
- Nati Srebro
In Computer Vision and Pattern Recognition
- Heng Tao Shen
- Anshumali Shrivastava
- Ping Li
- Jingkuan Song
- Jingdong Wang
- Dacheng Tao
- Jianqiu Ji
- Yi Yang
In Information Retrieval & Search
- Anshumali Shrivastava
- Jingkuan Song
- Ping Li
- Heng Tao Shen
- Jingdong Wang
- Jianqiu Ji
- Behnam Neyshabur
- Nati Srebro
Citations in the corpus
- Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS) (2014, background): “• Other efficient similarities: Finding other similarities for which there exist fast retrieval algorithms is an important problem [5].”
- Beyond Pairwise: Provably Fast Algorithms for Approximate k-Way Similarity Search (2013, background): “[9] analyzed all the transformations on similarities that preserve existence of efficient LSH search.”
- Hashing for Similarity Search: A Survey (2014, background): “The second one is on exploring the theoretical boundary of the LSH framework, including the bound on the search efficiency (both time and space) that the best possible LSH family can achieve for certain distances and similarities [20], [94], [105], the tight characteristics for a similarity measure ”