{"url":"/task/graph-clustering","name":"Graph Clustering","slug":"graph-clustering","description_markdown":"**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.\n\n\n<span class=\"description-source\">Source: [Clustering for Graph Datasets via Gumbel Softmax ](https://arxiv.org/abs/2005.02372)</span>","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":393,"papers_with_code":180,"benchmarks":10,"benchmark_tables_in_archive":10,"benchmark_tables_shown":10,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":19,"subtasks":1,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-clustering-on-citeseer","slug":"graph-clustering-on-citeseer","dataset":"Citeseer","dataset_url":"/dataset/citeseer","rows_in_archive":9,"metrics":["ACC","NMI","ARI","F1","Precision","F score"],"first_row_in_archive_order":{"model":"R-DGAE","paper_title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","paper_url":"/paper/rethinking-graph-autoencoder-models-for","paper_date":"2021-07-19","arxiv_id":"2107.08562","code_links":[{"title":"nairouz/R-GAE","url":"https://github.com/nairouz/R-GAE"}],"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-clustering-on-cora","slug":"graph-clustering-on-cora","dataset":"Cora","dataset_url":"/dataset/cora","rows_in_archive":9,"metrics":["ACC","NMI","ARI","F1","Precision","F score"],"first_row_in_archive_order":{"model":"R-GMM-VGAE","paper_title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","paper_url":"/paper/rethinking-graph-autoencoder-models-for","paper_date":"2021-07-19","arxiv_id":"2107.08562","code_links":[{"title":"nairouz/R-GAE","url":"https://github.com/nairouz/R-GAE"}],"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-clustering-on-pubmed","slug":"graph-clustering-on-pubmed","dataset":"Pubmed","dataset_url":"/dataset/pubmed","rows_in_archive":7,"metrics":["ACC","NMI","ARI","F score"],"first_row_in_archive_order":{"model":"R-GMM-VGAE","paper_title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","paper_url":"/paper/rethinking-graph-autoencoder-models-for","paper_date":"2021-07-19","arxiv_id":"2107.08562","code_links":[{"title":"nairouz/R-GAE","url":"https://github.com/nairouz/R-GAE"}],"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-clustering-on-biase-et-al","slug":"graph-clustering-on-biase-et-al","dataset":"Biase et al","dataset_url":"/dataset/biase-et-al","rows_in_archive":1,"metrics":["Adjusted Rand Index"],"first_row_in_archive_order":{"model":"Polaratio Consensus Clustering","paper_title":"Polaratio: A magnitude-contingent monotonic correlation metric and its improvements to scRNA-seq clustering","paper_url":"/paper/polaratio-a-magnitude-contingent-monotonic","paper_date":"2020-12-20","arxiv_id":null,"code_links":[{"title":"dubai03nsr/Polaratio","url":"https://github.com/dubai03nsr/Polaratio"}],"syntology":null}},{"leaderboard":"/sota/graph-clustering-on-bozec-et-al","slug":"graph-clustering-on-bozec-et-al","dataset":"Bozec et al","dataset_url":null,"rows_in_archive":1,"metrics":["Adjusted Rand Index"],"first_row_in_archive_order":{"model":"Polaratio Consensus Clustering","paper_title":"Polaratio: A magnitude-contingent monotonic correlation metric and its improvements to scRNA-seq clustering","paper_url":"/paper/polaratio-a-magnitude-contingent-monotonic","paper_date":"2020-12-20","arxiv_id":null,"code_links":[{"title":"dubai03nsr/Polaratio","url":"https://github.com/dubai03nsr/Polaratio"}],"syntology":null}},{"leaderboard":"/sota/graph-clustering-on-deng-et-al","slug":"graph-clustering-on-deng-et-al","dataset":"Deng et al","dataset_url":"/dataset/deng-et-al","rows_in_archive":1,"metrics":["Adjusted Rand Index"],"first_row_in_archive_order":{"model":"Polaratio Consensus Clustering","paper_title":"Polaratio: A magnitude-contingent monotonic correlation metric and its improvements to scRNA-seq clustering","paper_url":"/paper/polaratio-a-magnitude-contingent-monotonic","paper_date":"2020-12-20","arxiv_id":null,"code_links":[{"title":"dubai03nsr/Polaratio","url":"https://github.com/dubai03nsr/Polaratio"}],"syntology":null}},{"leaderboard":"/sota/graph-clustering-on-goolam-et-al","slug":"graph-clustering-on-goolam-et-al","dataset":"Goolam et al","dataset_url":"/dataset/goolam-et-al","rows_in_archive":1,"metrics":["Adjusted Rand Index"],"first_row_in_archive_order":{"model":"Polaratio Consensus Clustering","paper_title":"Polaratio: A magnitude-contingent monotonic correlation metric and its improvements to scRNA-seq clustering","paper_url":"/paper/polaratio-a-magnitude-contingent-monotonic","paper_date":"2020-12-20","arxiv_id":null,"code_links":[{"title":"dubai03nsr/Polaratio","url":"https://github.com/dubai03nsr/Polaratio"}],"syntology":null}},{"leaderboard":"/sota/graph-clustering-on-pollen-et-al","slug":"graph-clustering-on-pollen-et-al","dataset":"Pollen et al","dataset_url":"/dataset/pollen-et-al","rows_in_archive":1,"metrics":["Adjusted Rand Index"],"first_row_in_archive_order":{"model":"Polaratio Consensus Clustering","paper_title":"Polaratio: A magnitude-contingent monotonic correlation metric and its improvements to scRNA-seq clustering","paper_url":"/paper/polaratio-a-magnitude-contingent-monotonic","paper_date":"2020-12-20","arxiv_id":null,"code_links":[{"title":"dubai03nsr/Polaratio","url":"https://github.com/dubai03nsr/Polaratio"}],"syntology":null}},{"leaderboard":"/sota/graph-clustering-on-treutlein-et-al","slug":"graph-clustering-on-treutlein-et-al","dataset":"Treutlein et al","dataset_url":"/dataset/treutlein-et-al","rows_in_archive":1,"metrics":["Adjusted Rand Index"],"first_row_in_archive_order":{"model":"Polaratio Consensus Clustering","paper_title":"Polaratio: A magnitude-contingent monotonic correlation metric and its improvements to scRNA-seq clustering","paper_url":"/paper/polaratio-a-magnitude-contingent-monotonic","paper_date":"2020-12-20","arxiv_id":null,"code_links":[{"title":"dubai03nsr/Polaratio","url":"https://github.com/dubai03nsr/Polaratio"}],"syntology":null}},{"leaderboard":"/sota/graph-clustering-on-yan-et-al","slug":"graph-clustering-on-yan-et-al","dataset":"Yan et al","dataset_url":"/dataset/yan-et-al","rows_in_archive":1,"metrics":["Adjusted Rand Index"],"first_row_in_archive_order":{"model":"Polaratio Consensus Clustering","paper_title":"Polaratio: A magnitude-contingent monotonic correlation metric and its improvements to scRNA-seq clustering","paper_url":"/paper/polaratio-a-magnitude-contingent-monotonic","paper_date":"2020-12-20","arxiv_id":null,"code_links":[{"title":"dubai03nsr/Polaratio","url":"https://github.com/dubai03nsr/Polaratio"}],"syntology":null}}],"datasets":[{"url":"/dataset/pubmed","name":"Pubmed","full_name":"","num_papers_in_archive":1236},{"url":"/dataset/cora","name":"Cora","full_name":"","num_papers_in_archive":602},{"url":"/dataset/citeseer","name":"Citeseer","full_name":"","num_papers_in_archive":381},{"url":"/dataset/snap","name":"SNAP","full_name":"Stanford Large Network Dataset Collection","num_papers_in_archive":174},{"url":"/dataset/orkut","name":"Orkut","full_name":"","num_papers_in_archive":85},{"url":"/dataset/friendster","name":"Friendster","full_name":"","num_papers_in_archive":65},{"url":"/dataset/email-eu","name":"Email-EU","full_name":null,"num_papers_in_archive":33},{"url":"/dataset/netzschleuder","name":"Netzschleuder","full_name":"network catalogue, repository and centrifuge","num_papers_in_archive":5},{"url":"/dataset/97-synthetic-datasets","name":"97 synthetic datasets","full_name":"","num_papers_in_archive":3},{"url":"/dataset/placenta","name":"Placenta","full_name":"","num_papers_in_archive":3},{"url":"/dataset/slnet","name":"SLNET","full_name":"SLNET: A Redistributable Corpus of 3rd-party Simulink Models","num_papers_in_archive":3},{"url":"/dataset/trackml-challenge-throughput-phase-dataset","name":"TrackML challenge Throughput phase dataset","full_name":"Tracking Machine Learning Challenge","num_papers_in_archive":2},{"url":"/dataset/biase-et-al","name":"Biase et al","full_name":"","num_papers_in_archive":1},{"url":"/dataset/deng-et-al","name":"Deng et al","full_name":"","num_papers_in_archive":1},{"url":"/dataset/goolam-et-al","name":"Goolam et al","full_name":"","num_papers_in_archive":1},{"url":"/dataset/user-reviews-and-perfume-attributes-dataset","name":"Perfume Co-Preference Network","full_name":"","num_papers_in_archive":1},{"url":"/dataset/pollen-et-al","name":"Pollen et al","full_name":"","num_papers_in_archive":1},{"url":"/dataset/treutlein-et-al","name":"Treutlein et al","full_name":"","num_papers_in_archive":1},{"url":"/dataset/yan-et-al","name":"Yan et al","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/clustering-ensemble","name":"Clustering Ensemble"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":180,"tagged_in_all":393,"items":[{"url":"/paper/variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","arxiv_id":"1611.07308","repositories_listed":22,"syntology":{"n":13,"n_ran":7,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","arxiv_id":"1905.07953","repositories_listed":6,"syntology":null},{"url":"/paper/mincut-pooling-in-graph-neural-networks","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","date":"2019-06-30","arxiv_id":"1907.00481","repositories_listed":4,"syntology":{"n":9,"n_ran":0,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/adversarially-regularized-graph-autoencoder","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","date":"2018-02-13","arxiv_id":"1802.04407","repositories_listed":4,"syntology":null},{"url":"/paper/attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","date":"2019-06-15","arxiv_id":"1906.06532","repositories_listed":3,"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":1}},{"url":"/paper/ensemble-clustering-for-graphs","title":"Ensemble Clustering for Graphs","date":"2018-09-14","arxiv_id":"1809.05578","repositories_listed":3,"syntology":null},{"url":"/paper/hierarchical-graph-clustering-using-node-pair","title":"Hierarchical Graph Clustering using Node Pair Sampling","date":"2018-06-05","arxiv_id":"1806.01664","repositories_listed":3,"syntology":null},{"url":"/paper/synergistic-deep-graph-clustering-network","title":"Synergistic Deep Graph Clustering Network","date":"2024-06-22","arxiv_id":"2406.15797","repositories_listed":2,"syntology":null},{"url":"/paper/meancut-a-greedy-optimized-graph-clustering","title":"MeanCut: A Greedy-Optimized Graph Clustering via Path-based Similarity and Degree Descent Criterion","date":"2023-12-07","arxiv_id":"2312.04067","repositories_listed":2,"syntology":null},{"url":"/paper/convert-contrastive-graph-clustering-with","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","date":"2023-08-17","arxiv_id":"2308.08963","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_unverified":2,"n_pointer_only":7}},{"url":"/paper/reinforcement-graph-clustering-with-unknown","title":"Reinforcement Graph Clustering with Unknown Cluster Number","date":"2023-08-13","arxiv_id":"2308.06827","repositories_listed":2,"syntology":null},{"url":"/paper/dink-net-neural-clustering-on-large-graphs","title":"Dink-Net: Neural Clustering on Large Graphs","date":"2023-05-28","arxiv_id":"2305.18405","repositories_listed":2,"syntology":{"n":17,"n_ran":2,"n_unverified":15,"n_pointer_only":0}},{"url":"/paper/deep-temporal-graph-clustering","title":"Deep Temporal Graph Clustering","date":"2023-05-18","arxiv_id":"2305.10738","repositories_listed":2,"syntology":null},{"url":"/paper/hard-sample-aware-network-for-contrastive","title":"Hard Sample Aware Network for Contrastive Deep Graph Clustering","date":"2022-12-16","arxiv_id":"2212.08665","repositories_listed":2,"syntology":null},{"url":"/paper/contrastive-deep-graph-clustering-with","title":"GraphLearner: Graph Node Clustering with Fully Learnable Augmentation","date":"2022-12-07","arxiv_id":"2212.03559","repositories_listed":2,"syntology":null},{"url":"/paper/a-survey-of-deep-graph-clustering-taxonomy","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","date":"2022-11-23","arxiv_id":"2211.12875","repositories_listed":2,"syntology":{"n":15,"n_ran":0,"n_unverified":15,"n_pointer_only":0}},{"url":"/paper/rudsi-graph-based-word-sense-induction","title":"RuDSI: graph-based word sense induction dataset for Russian","date":"2022-09-28","arxiv_id":"2209.13750","repositories_listed":2,"syntology":null},{"url":"/paper/dual-contrastive-attributed-graph-clustering","title":"NCAGC: A Neighborhood Contrast Framework for Attributed Graph Clustering","date":"2022-06-16","arxiv_id":"2206.07897","repositories_listed":2,"syntology":null},{"url":"/paper/attributed-graph-clustering-with-dual","title":"Attributed Graph Clustering with Dual Redundancy Reduction","date":"2022-04-18","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/dynamic-persistent-homology-for-brain","title":"Persistent Homological State-Space Estimation of Functional Human Brain Networks at Rest","date":"2022-01-01","arxiv_id":"2201.00087","repositories_listed":2,"syntology":null},{"url":"/paper/deep-graph-clustering-via-dual-correlation","title":"Deep Graph Clustering via Dual Correlation Reduction","date":"2021-12-29","arxiv_id":"2112.14772","repositories_listed":2,"syntology":null},{"url":"/paper/attention-driven-graph-clustering-network","title":"Attention-driven Graph Clustering Network","date":"2021-08-12","arxiv_id":"2108.05499","repositories_listed":2,"syntology":null},{"url":"/paper/hypergraph-clustering-from-blockmodels-to","title":"Generative hypergraph clustering: from blockmodels to modularity","date":"2021-01-24","arxiv_id":"2101.09611","repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-preserving-incremental-social-event","title":"Knowledge-Preserving Incremental Social Event Detection via Heterogeneous GNNs","date":"2021-01-21","arxiv_id":"2101.08747","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/interpretable-clustering-on-dynamic-graphs","title":"Interpretable Clustering on Dynamic Graphs with Recurrent Graph Neural Networks","date":"2020-12-16","arxiv_id":"2012.08740","repositories_listed":2,"syntology":null},{"url":"/paper/laplacian-regularized-few-shot-learning","title":"Laplacian Regularized Few-Shot Learning","date":"2020-06-29","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/laplacian-regularized-few-shot-learning-1","title":"Laplacian Regularized Few-Shot Learning","date":"2020-06-28","arxiv_id":"2006.15486","repositories_listed":2,"syntology":{"n":12,"n_ran":5,"n_unverified":7,"n_pointer_only":7}},{"url":"/paper/erdos-goes-neural-an-unsupervised-learning","title":"Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs","date":"2020-06-18","arxiv_id":"2006.10643","repositories_listed":2,"syntology":null},{"url":"/paper/p-norm-flow-diffusion-for-local-graph","title":"$p$-Norm Flow Diffusion for Local Graph Clustering","date":"2020-05-20","arxiv_id":"2005.09810","repositories_listed":2,"syntology":{"n":12,"n_ran":0,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/flow-based-algorithms-for-improving-clusters","title":"Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance","date":"2020-04-20","arxiv_id":"2004.09608","repositories_listed":2,"syntology":null}],"syntology_records":9,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}