NEW GENETIC ALGORITHM WITH GREEDY HEURISTIC FOR CLUSTERING PROBLEMS WITH UNKNOWN NUMBER OF GROUPS

Facta Universitatis. Series Mathematics and Informatics

Victor I. Orlov²  Lev A. Kazakovtsev⁴  Vladimir L. Kazakovtsev⁵ 

[1] JSC "Siberian Federal University;Siberian State Aerospace University named after Academician M.F.Reshetnev;TTC - NPO PM"

关键词: Clustering;    genetic algorithms;    greedy heuristic;    optimization;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: Univerzitet u Nishu / University of Nis

【 摘 要 】

In this research, we propose new modification of the genetic algorithm with greedy heuristic witch allows to solve series of clustering problems with unknown number of groups (clusters). The applicability and efficiency of new method is experimentally proved. Achieved results are compared with other algorithms which solve each of problems separately. Experiments show that new algorithm is faster than other methods for various problems.

【 授权许可】

Unknown