Centroid-based clustering for graph datasets


Due to the absence of nodes and edges correspondence between graphs, the existing central clustering algorithms usually perform graph clustering in some embedded spaces, or confine the cluster centers to the set median graphs. In this paper, a centroid-based algorithm is proposed for directly clustering on the graphs, based on a newly defined dissimilarity… (More)


2 Figures and Tables

Slides referencing similar topics