Graph Clustering

60 papers with code • 10 benchmarks • 15 datasets

Graph Clustering is the process of grouping the nodes of the graph into clusters, taking into account the edge structure of the graph in such a way that there are several edges within each cluster and very few between clusters. Graph Clustering intends to partition the nodes in the graph into disjoint groups.

Source: Clustering for Graph Datasets via Gumbel Softmax

Paper Code Results Date Stars