• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
For visually-impairedUser profile (HSE staff only)SearchMenu

Improving the Nearest Neighbor Search Algorithm for Asymmetric Distance Functions

Student: Andrey Ershov

Supervisor: Alexander Ponomarenko

Faculty: Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod)

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2019

In this project the existing methods for solving the problem of finding the nearest neighbor (k nearest neighbors), their advantages and disadvantages were described. However, these methods are not well studied when working with asymmetric distance functions and our main task was to study and improve existing methods to solve this problem, as well as their adaptation to use with asymmetric functions of distance. Also within the framework of this work, the existing algorithms implemented in the open source library NMSLIB were modified. A series of tests was conducted to analyze the improved performance, graphs were built with the results and a number of points and hypotheses were put forward for further research.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses