InTDS ArchivebyVyacheslav Efimov·Jul 24, 2023Similarity Search, Part 7: LSH CompositionsDive into combinations of LSH functions to guarantee a more reliable search
InTDS ArchivebyVyacheslav Efimov·Jul 21, 2023Similarity Search, Part 6: Random Projections with LSH ForestUnderstand how to hash data and reflect its similarity by constructing random hyperplanesA response icon1A response icon1
InTDS ArchivebyVyacheslav Efimov·Jun 24, 2023Similarity Search, Part 5: Locality Sensitive Hashing (LSH)Explore how similarity information can be incorporated into hash functionA response icon1A response icon1
InTDS ArchivebyVyacheslav Efimov·Jun 16, 2023Similarity Search, Part 4: Hierarchical Navigable Small World (HNSW)Hierarchical Navigable Small World (HNSW) is a state-of-the-art algorithm used for an approximate search of nearest neighbours. Under the…A response icon7A response icon7
InTDS ArchivebyVyacheslav Efimov·May 19, 2023Similarity Search, Part 3: Blending Inverted File Index and Product QuantizationIn the first two parts of this series we have discussed two fundamental algorithms in information retrieval: inverted file index and…A response icon1A response icon1
InTDS ArchivebyVyacheslav Efimov·May 10, 2023Similarity Search, Part 2: Product QuantizationLearn a powerful technique to effectively compress large dataA response icon3A response icon3
InTDS ArchivebyVyacheslav Efimov·Apr 28, 2023Similarity Search, Part 1: kNN & Inverted File IndexSimilarity search is a popular problem where given a query Q we need to find the most similar documents to it among all the documents D.A response icon2A response icon2
