Vyacheslav EfimovinTowards Data ScienceSimilarity Search, Part 7: LSH CompositionsDive into combinations of LSH functions to guarantee a more reliable search11 min read·Jul 24, 2023----
Vyacheslav EfimovinTowards Data ScienceSimilarity Search, Part 6: Random Projections with LSH ForestUnderstand how to hash data and reflect its similarity by constructing random hyperplanes12 min read·Jul 21, 2023--1--1
Vyacheslav EfimovinTowards Data ScienceSimilarity Search, Part 5: Locality Sensitive Hashing (LSH)Explore how similarity information can be incorporated into hash function10 min read·Jun 24, 2023--1--1
Vyacheslav EfimovinTowards Data ScienceSimilarity 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…13 min read·Jun 16, 2023--6--6
Vyacheslav EfimovinTowards Data ScienceSimilarity 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…8 min read·May 19, 2023--1--1
Vyacheslav EfimovinTowards Data ScienceSimilarity Search, Part 2: Product QuantizationLearn a powerful technique to effectively compress large data9 min read·May 10, 2023--3--3
Vyacheslav EfimovinTowards Data ScienceSimilarity 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.9 min read·Apr 28, 2023--2--2