Index Structures for Fast Similarity Search for Binary Vectors.

Autor:	Rachkovskij, D.
Předmět:	HAMMING distance VECTOR fields SIMILARITY (Geometry) HASHING ASSOCIATIVE storage
Zdroj:	Cybernetics & Systems Analysis; Sep2017, Vol. 53 Issue 5, p799-820, 22p
Abstrakt:	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. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu Full text from SpringerLink