| Document Date: 2012-03-29 23:45:00
Open Document File Size: 927,80 KBShare Result on Facebook
City Istanbul / / Company 3M / Twitter / AllPairs / LSH / Reuters / / Country Turkey / / Currency USD / / / Event Product Issues / Product Recall / / Facility Engineering The Ohio State University / / IndustryTerm online inference / candidate generation algorithm / all-pairs similarity search / particular candidate generation algorithm / approximate similarity search / web-scale clustering / pairs similarity search / scientific computing libraries / data mining / similarity search / similarity search algorithms / realistic applications / similarity search problem / dimensional applications / all-pairs similarity search problem / faster algorithm / candidate generation algorithms / binary search / friendship network / respective algorithm / approximate solution / web crawling / approximate solutions / pre-processing / / Organization idf / VLDB Endowment / The Ohio State University / / Person Approx / / Position candidate / / Product parameter / BayesLSH / rates / / ProgrammingLanguage C / C++ / / Technology faster algorithm / RAM / much faster algorithm / 3-D / principled Bayesian algorithm / randomized algorithms / particular candidate generation algorithm / us.5 All algorithms / machine learning / 1 s¯v s¯v Algorithm / pdf / two algorithms / candidate generation algorithms / existing candidate generation algorithm / candidate generation algorithm / ISP / data mining / second algorithm / respective algorithm / similarity search algorithms / / URL http /
SocialTag |
Bayesian Locality Sensitive Hashing for Fast Similarity Search Venu Satuluri and Srinivasan Parthasarathy Dept. of Computer Science and Engineering The Ohio State University {satuluri,srini}@cse.ohio-state.edu