An integer-coded evolutionary approach for mixture maximum likelihood clustering

This paper outlines an algorithm for solving the maximum mixture likelihood clustering problem using an integer-coded genetic algorithm (IGA-ML) where a fixed length chromosome encodes the object-to-cluster assignment. The main advantage of the outlined algorithm (IGA-ML) compared with other known algorithms, such as the k-means technique, is that it can successfully discover the correct number of clusters, in addition to carrying out the partitioning process. The algorithm implements a post-fixing sorting mechanism that drastically reduces the searched solution space by eliminating duplicate solutions that appear after applying the genetic operations. Simulation results show the effectiveness of the algorithm especially with the case of overlapping clusters.