TasksSotADatasetsPapersMethodsSubmitAbout
Papers With Code 2

A community resource for machine learning research: papers, code, benchmarks, and state-of-the-art results.

Explore

Notable BenchmarksAll SotADatasetsPapersMethods

Community

Submit ResultsAbout

Data sourced from the PWC Archive (CC-BY-SA 4.0). Built by the community, for the community.

SotA/Graphs/Graph Clustering

Graph Clustering

25 benchmarks393 papers

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.

<span class="description-source">Source: Clustering for Graph Datasets via Gumbel Softmax </span>

Benchmarks

Graph Clustering on Citeseer

ACCNMIARIF1PrecisionF score

Graph Clustering on Cora

ACCNMIARIF1PrecisionF score

Graph Clustering on Pubmed

ACCNMIARIF score

Graph Clustering on Biase et al

Adjusted Rand Index

Graph Clustering on Bozec et al

Adjusted Rand Index

Graph Clustering on Deng et al

Adjusted Rand Index

Graph Clustering on Goolam et al

Adjusted Rand Index

Graph Clustering on Pollen et al

Adjusted Rand Index

Graph Clustering on Treutlein et al

Adjusted Rand Index

Graph Clustering on Yan et al

Adjusted Rand Index

Graph Clustering on ionosphere

Purity

Graph Clustering on pathbased

Purity