DATA STRUCTURE WITH SMALL WORLD PROPERTIES FOR SOLVING NEAREST NEIGHBOR SEARCH PROBLEM IN METRIC SPACE |
| 5 | |
| 2012 |
| scientific article | 004.057.4 | ||
| 409-415 |
| A novel approach to solving the nearest neighbor search problem in metric space is considered. It is proposed as a data structure to use a graph with navigable small world properties and a gradient descent algorithm as a search algorithm. The problem of the existence of local minima is solved by a series of independent searches. Experimental data are presented to confirm logarithmic complexity of the search algorithm. |
 |