On the optimality of the hash-coding type nearest neighbour search algorithm

The algorithmic problem of nearest neighbour search and the earlier proposed hash-coding algorithm (Elias algorithm) are considered. The problem of optimality characterization depending on the geometrical structure of blocks of the algorithm in a balanced hash-coding scheme is considered. As a suppo...

Full description

Saved in:
Bibliographic Details
Published inNinth International Conference on Computer Science and Information Technologies Revised Selected Papers pp. 1 - 6
Main Authors Aslanyan, Levon H., Danoyan, H. E.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2013
Subjects
Algorithm design and analysis
Best-match
Complexity theory
Elias algorithm
Finite element analysis
hash-coding schema
Heuristic algorithms
isoperimetricset
Machine learning algorithms
nearest neighbour search
Vectors
Online AccessGet full text

Cover

More Information
Summary:The algorithmic problem of nearest neighbour search and the earlier proposed hash-coding algorithm (Elias algorithm) are considered. The problem of optimality characterization depending on the geometrical structure of blocks of the algorithm in a balanced hash-coding scheme is considered. As a supportive technique for this the structure of consecutive neighbourhood layers to the subsets of binary cube is considered. Using the known properties of isoperimetric sets it is proved that the algorithm is optimal when mentioned blocks are isoperimetric sets.
ISBN:9781479924608
1479924601
DOI:10.1109/CSITechnol.2013.6710336