Construction algorithms for clustering

Abstract

This paper presents the use of construction circuit-based algorithms in clustering. Among the construction tour algorithms, the nearest neighbor algorithm, the insertion heuristics (nearest insertion, farthest insertion, cheapest insertion, arbitrary insertion), and the greedy algorithm were tested. The essence of the modified algorithms is that it is not necessary to specify the cluster number, it is formed by the algorithm itself.