LEAC: An efficient library for clustering with evolutionary algorithms

摘要

This paper introduces LEAC, a new C++ partitioning clustering library based on evolutionary computation. LEAC provides plenty of elements (individual encoding schemes, genetic operators, evaluation metrics, among others) which allow an easy and fast development of new clustering algorithms. Furthermore, it includes 23 algorithms which represent the state-of-the-art in Evolutionary Algorithms for partial clustering.The paper describes through examples the main features and the design principles of the software, as well as how to use LEAC to carry out a comparison between different proposals and how to extend it by including new algorithms.