title: Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ° Ð¸ ÑÑÐ°Ð²Ð½ÐµÐ½Ð¸Ðµ Ð¼ÐµÑÐ¾Ð´Ð¾Ð² ÑÐ¾Ñ ÑÐ°ÑÑÐ¸Ñ Ð¸ ÑÐ»ÑÑÑÐµÐ½Ð½Ð¾Ð³Ð¾ ÑÐ¿ÑÐ¾ÑÐµÐ½Ð½Ð¾Ð³Ð¾ ÑÐ¾Ñ ÑÐ°ÑÑÐ¸Ñ Ð´Ð»Ñ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸ ÑÐ°Ð±Ð¾ÑÑ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° k-harmonic means
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: Development and comparison of particle swarm method and an improved simplified particle swarm method to optimize the k-harmonic means algorithm
Creators: name: ÐÐµÑÐºÑÑÑÐµÐ²Ð°, ÐÐ°ÑÑÑ
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2020
Subjects: ÐºÐ»Ð°ÑÑÐµÑÐ¸Ð·Ð°ÑÐ¸Ñ
Ð¼ÐµÑÐ¾Ð´Ñ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸
Ð¼ÑÐ³ÐºÐ¸Ðµ Ð²ÑÑÐ¸ÑÐ»ÐµÐ½Ð¸Ñ
Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ k-harmonic means
Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ ÑÐ¾Ñ ÑÐ°ÑÑÐ¸Ñ
clustering
optimization methods
soft calculations
k-harmonic means algorithm
particle swarm algorithm

description: Ð¢ÐµÐ¼Ð° Ð²ÑÐ¿ÑÑÐºÐ½Ð¾Ð¹ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÑ: Â«Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ° Ð¸ ÑÑÐ°Ð²Ð½ÐµÐ½Ð¸Ðµ Ð¼ÐµÑÐ¾Ð´Ð¾Ð² ÑÐ¾Ñ ÑÐ°ÑÑÐ¸Ñ Ð¸ ÑÐ»ÑÑÑÐµÐ½Ð½Ð¾Ð³Ð¾ ÑÐ¿ÑÐ¾ÑÐµÐ½Ð½Ð¾Ð³Ð¾ ÑÐ¾Ñ ÑÐ°ÑÑÐ¸Ñ Ð´Ð»Ñ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸ ÑÐ°Ð±Ð¾ÑÑ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° k-harmonic meansÂ».
ÐÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ° Ð¿Ð¾ÑÐ²ÑÑÐµÐ½Ð° Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ Ð¼ÐµÑÐ¾Ð´Ð¾Ð² Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸ Ð² Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð°Ñ Ð¼Ð°ÑÐ¸Ð½Ð½Ð¾Ð³Ð¾ Ð¾Ð±ÑÑÐµÐ½Ð¸Ñ. Ð Ð´Ð°Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÐµ Ð¿ÑÐ¾Ð²ÐµÐ´ÐµÐ½ Ð°Ð½Ð°Ð»Ð¸Ð· Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸, Ð¸ÑÐ¿Ð¾Ð»ÑÐ·ÑÑÑÐ¸ÑÑÑ Ð´Ð»Ñ Ð¼Ð¾Ð´Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¸ Ð¼ÐµÑÐ¾Ð´Ð¾Ð² ÐºÐ»Ð°ÑÑÐµÑÐ¸Ð·Ð°ÑÐ¸Ð¸ Ð½Ð° Ð¾ÑÐ½Ð¾Ð²Ðµ ÑÐµÐ½ÑÑÐ¾Ð¸Ð´Ð¾Ð². Ð Ð°ÑÑÐ¼Ð¾ÑÑÐµÐ½Ð° Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ñ Ð¼ÐµÑÐ¾Ð´Ð° k-harmonic means Ñ Ð¿Ð¾Ð¼Ð¾ÑÑÑ ÑÐ°Ð·Ð»Ð¸ÑÐ½ÑÑ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð¼ÑÐ³ÐºÐ¸Ñ Ð²ÑÑÐ¸ÑÐ»ÐµÐ½Ð¸Ð¹. 
Ð¦ÐµÐ»ÑÑ ÑÐ°Ð±Ð¾ÑÑ ÑÐ²Ð»ÑÐµÑÑÑ Ð²ÑÑÐ²Ð»ÐµÐ½Ð¸Ðµ Ð½Ð°Ð¸Ð±Ð¾Ð»ÐµÐµ ÑÑÑÐµÐºÑÐ¸Ð²Ð½ÑÑ Ð¼ÐµÑÐ¾Ð´Ð¾Ð² ÐºÐ»Ð°ÑÑÐµÑÐ¸Ð·Ð°ÑÐ¸Ð¸ Ð½Ð° Ð±Ð°Ð·Ðµ ÐºÐ»Ð°ÑÑÐ¸ÑÐµÑÐºÐ¾Ð³Ð¾ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð¼Ð°ÑÐ¸Ð½Ð½Ð¾Ð³Ð¾ Ð¾Ð±ÑÑÐµÐ½Ð¸Ñ k-means.
Ð ÑÐ¾Ð´Ðµ ÑÐ°Ð±Ð¾ÑÑ Ð±ÑÐ»Ð¸ ÑÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ñ Ð¼ÑÐ³ÐºÐ¸Ñ Ð²ÑÑÐ¸ÑÐ»ÐµÐ½Ð¸Ð¹, Ð¾ÑÐ½Ð¾ÑÑÑÐ¸ÐµÑÑ Ðº Ð¼ÐµÑÐ¾Ð´Ð°Ð¼ ÑÐ¾ÐµÐ²Ð¾Ð³Ð¾ Ð¸Ð½ÑÐµÐ»Ð»ÐµÐºÑÐ°, Ð´Ð»Ñ Ð¸ÑÐ¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°Ð½Ð¸Ñ Ð² ÑÐµÑÐµÐ½Ð¸Ð¸ Ð·Ð°Ð´Ð°ÑÐ¸ ÐºÐ»Ð°ÑÑÐµÑÐ¸Ð·Ð°ÑÐ¸Ð¸ Ð½Ð° Ð¾ÑÐ½Ð¾Ð²Ðµ Ð¼ÐµÑÐ¾Ð´Ð° K-Harmonic means. ÐÑÐ¾Ð²ÐµÐ´ÐµÐ½ ÑÑÐ°Ð²Ð½Ð¸ÑÐµÐ»ÑÐ½ÑÐ¹ Ð°Ð½Ð°Ð»Ð¸Ð· Ð¸Ñ ÑÑÑÐµÐºÑÐ¸Ð²Ð½Ð¾ÑÑÐ¸ Ð¸ ÑÑÐ¾ÑÐ¼ÑÐ»Ð¸ÑÐ¾Ð²Ð°Ð½Ñ Ð²ÑÐ²Ð¾Ð´Ñ.
Ð ÐÐ»Ð°Ð²Ðµ 1 ÑÐ°ÑÑÐ¼Ð°ÑÑÐ¸Ð²Ð°ÑÑÑÑ Ð¸Ð·Ð²ÐµÑÑÐ½ÑÐµ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ñ Ð¼ÑÐ³ÐºÐ¸Ñ Ð²ÑÑÐ¸ÑÐ»ÐµÐ½Ð¸Ð¹, ÐºÐ¾ÑÐ¾ÑÑÐµ Ð¸ÑÐ¿Ð¾Ð»ÑÐ·ÑÑÑÑÑ Ð´Ð»Ñ ÑÐ»ÑÑÑÐµÐ½Ð¸Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° k-harmonic means. ÐÐ»Ð°Ð²Ð° 2 Ð´ÐµÑÐ°Ð»ÑÐ½Ð¾ Ð¾Ð¿Ð¸ÑÑÐ²Ð°ÐµÑ ÑÐµÐ°Ð»Ð¸Ð·Ð°ÑÐ¸Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð¸ Ð°ÑÑÐ¸ÑÐµÐºÑÑÑÑ Ð¿ÑÐ¸Ð»Ð¾Ð¶ÐµÐ½Ð¸Ñ. Ð ÐÐ»Ð°Ð²Ðµ 3 Ð¾Ð¿Ð¸ÑÐ°Ð½ Ð¿ÑÐ¾Ð²ÐµÐ´ÐµÐ½Ð½ÑÐ¹ ÑÑÐ°Ð²Ð½Ð¸ÑÐµÐ»ÑÐ½ÑÐ¹ Ð°Ð½Ð°Ð»Ð¸Ð· ÑÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½Ð½ÑÑ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð¸ ÐµÐ³Ð¾ ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÑ.
description: The subject of the graduate qualification work: "Development and comparison of particle swarm method and an improved simplified particle swarm method to optimize the k-harmonic means algorithm."
The final qualifying work of the bachelor is devoted to the study of optimization methods in machine learning algorithms. In this paper, we analyze the optimization algorithms used to modify centroid-based clustering methods. The optimization of the k-harmonic means method using various soft computing algorithms is considered.
The aim of the work is to identify the most effective clustering methods based on the classic k-means machine learning algorithm.
In the course of work, soft computing algorithms related to swarm intelligence methods were implemented for use in solving the clustering problem based on the K-Harmonic means method. A comparative analysis of their effectiveness is carried out and conclusions are formulated.
Chapter 1 discusses well-known soft computing algorithms that are used to improve the k-harmonic means algorithm. Chapter 2 details the implementation of the algorithms and the architecture of the application. Chapter 3 describes the comparative analysis of the implemented algorithms and its results.