OClustR: A new graph-based algorithm for overlapping clustering
A new overlapping clustering algorithm, called OClustR, is proposed. OClustR introduces a new graph-covering strategy and a new filtering strategy. OClustR outperforms state-of-the-art algorithms in several collections. OClustR solves the limitations of the state-of-the-art algorithms.
graph-based algorithms overlapping clustering data mining