Photo by nhoizey from unsplash
This article reviews index structures for fast similarity search for objects represented by binary vectors (with components equal to 0 or 1). Structures for both exact and approximate search by… Click to show full abstract
This article reviews index structures for fast similarity search for objects represented by binary vectors (with components equal to 0 or 1). Structures for both exact and approximate search by Hamming distance and other similarity measures are considered. Mainly, index structures are presented that are based on hash tables and similarity-preserving hashing and also on tree structures, neighborhood graphs, and distributed neural autoassociative memory. Ideas of well-known algorithms and algorithms proposed in recent years are stated.
Journal Title: Cybernetics and Systems Analysis
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!