Adaptive k-means algorithm for overlapped graph clustering.

Abstract excerpt

The graph clustering problem has become highly relevant due to the growing interest of several research communities in social networks and their possible applications. Overlapped graph clustering algorithms try to find subsets of nodes that can belong to different clusters. In social network-based applications it is quite usual for a node of the network to belong to different groups, or communities, in the graph....

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Chromosomes
• Share to Cluster Analysis