Study of Overlapping Clustering Algorithms Based on Kmeans through FBcubed Metric

摘要

In this paper we present a study of the overlapping clustering algorithms OKM, WOKM and OKMED, which are extensions to the overlapping case of the well known Kmeans algorithm proposed for building partitions. Different to other previously reported comparisons, in our study we compare these algorithms using the external evaluation metric FBcubed which takes into account the overlapping among clusters and we contrast our results against those obtained by F-measure, a metric that does not take into account the overlapping among clusters and that has been previously used in another reported comparison.