Beyond classical consensus clustering: the Least Squares approach to multiple solutions
Clustering is one of the most important unsupervised learning problems and it consists of finding a common
structure in a collection of unlabeled data. However, due to the ill-posed nature of the problem, different
runs of the same clustering algorithm applied to the same data-set usually produce different
solutions. In this scenario choosing a single solution is quite arbitrary. On the other hand, in many applications
the problem of multiple solutions becomes intractable, hence it is often more desirable to provide
a limited group of ''good'' clusterings rather than a single solution.






