Research and Development of the Heuristic Method for Vertex K-center Problem

Student: Kirilenko Yulia

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

Educational Programme: Data Mining (Master)

Year of Graduation: 2020

The first chapter of this paper describes the problem of placing objects, and gives a general overview of clustering methods. In the second chapter, cluster analysis methods are studied in more detail, including the k-medoids method, the exact and approximate PAM and CLARANS algorithms. In the third chapter heuristic methods for solving various problems are given, the VNS algorithm is analyzed. The fourth chapter presents a heuristic method combining CLARANS and VNS, proposes a set of data for experiments and a metric for assessing quality. The fifth chapter presents the experimental results and compares the new algorithm with CLARANS.

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