DSLib: An open source library for the dominant set clustering method
This work addresses a gap for researchers in computer science and related fields by providing a tool for applying and extending the Dominant Set method, though it is incremental as it focuses on implementation rather than new algorithmic advances.
The authors tackled the lack of an official open-source implementation for the Dominant Set clustering algorithm by releasing DSLib, a Matlab library that provides the original method and variants, making it integrable and extendable for research use.
DSLib is an open-source implementation of the Dominant Set (DS) clustering algorithm written entirely in Matlab. The DS method is a graph-based clustering technique rooted in the evolutionary game theory that starts gaining lots of interest in the computer science community. Thanks to its duality with game theory and its strict relation to the notion of maximal clique, has been explored in several directions not only related to clustering problems. Applications in graph matching, segmentation, classification and medical imaging are common in literature. This package provides an implementation of the original DS clustering algorithm since no code has been officially released yet, together with a still growing collection of methods and variants related to it. Our library is integrable into a Matlab pipeline without dependencies, it is simple to use and easily extendable for upcoming works. The latest source code, the documentation and some examples can be downloaded from https://xwasco.github.io/DominantSetLibrary.