Clustering ensembles: A hedonic game theoretical approach.

•We investigate a new clustering ensemble algorithm (HGCE) based on hedonic games.•HGCE can always produce a Nash and individually stable consensus partition as final solution.•We compare HGCE with other well-known clustering ensemble methods on several data sets.•HGCE ranked first in the statistical comparisons conducted with two external validity measures.•HGCE is stable to perturbations to the base partitions and converged fast in all experiments.