An Empirical Comparison of FAISS and FENSHSES for Nearest Neighbor Search in Hamming Space

June 24, 2019 ยท Declared Dead ยท ๐Ÿ› eCOM@SIGIR

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Cun Mu, Binwei Yang, Zheng Yan arXiv ID 1906.10095 Category cs.LG: Machine Learning Cross-listed cs.CV, cs.IR, stat.ML Citations 7 Venue eCOM@SIGIR Last Checked 4 months ago
Abstract
In this paper, we compare the performances of FAISS and FENSHSES on nearest neighbor search in Hamming space--a fundamental task with ubiquitous applications in nowadays eCommerce. Comprehensive evaluations are made in terms of indexing speed, search latency and RAM consumption. This comparison is conducted towards a better understanding on trade-offs between nearest neighbor search systems implemented in main memory and the ones implemented in secondary memory, which is largely unaddressed in literature.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted