{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-graph-autoencoder-models-for#ran","syntology_url":"https://syntology.ai/paper/2107.08562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08562"}},"official":{"repos":["nairouz/R-GAE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"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_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-graph-autoencoder-models-for#ran","syntology_url":"https://syntology.ai/paper/2107.08562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08562"}},"official":{"repos":["nairouz/R-GAE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"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_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-graph-autoencoder-models-for#ran","syntology_url":"https://syntology.ai/paper/2107.08562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08562"}},"official":{"repos":["nairouz/R-GAE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":4,"rows_per_page":100,"shown":100,"of":393,"of_with_code":180,"tagged_in_all":393,"counts":{"archive_papers_tagged":393,"with_a_code_link":180,"where_syntology_ran_a_sample":33,"not_listed_spam_title":0,"listed":393,"listed_where_code_ran":33,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":31,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":31,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/variational-graph-auto-encoders","slug":"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":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/variational-graph-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1611.07308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07308"}},"official":{"repos":["tkipf/gae"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/cluster-gcn-an-efficient-algorithm-for","slug":"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","slug":"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":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/mincut-pooling-in-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1907.00481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00481"}},"official":{"repos":["FilippoMB/Spectral-Clustering-with-Graph-Neural-Networks-for-Graph-Pooling","FilippoMB/Benchmark_dataset_for_graph_classification"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/adversarially-regularized-graph-autoencoder","slug":"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","slug":"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":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attributed-graph-clustering-a-deep#ran","syntology_url":"https://syntology.ai/paper/1906.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06532"}},"official":null}},{"url":"/paper/ensemble-clustering-for-graphs","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/convert-contrastive-graph-clustering-with#ran","syntology_url":"https://syntology.ai/paper/2308.08963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08963"}},"official":{"repos":["xihongyang1999/convert"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-graph-clustering-with-unknown","slug":"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","slug":"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":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/dink-net-neural-clustering-on-large-graphs#ran","syntology_url":"https://syntology.ai/paper/2305.18405","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18405"}},"official":{"repos":["yueliu1999/awesome-deep-graph-clustering","yueliu1999/dink-net"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-temporal-graph-clustering","slug":"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","slug":"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","slug":"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","slug":"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":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-survey-of-deep-graph-clustering-taxonomy#ran","syntology_url":"https://syntology.ai/paper/2211.12875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12875"}},"official":{"repos":["marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering","yueliu1999/awesome-deep-graph-clustering"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rudsi-graph-based-word-sense-induction","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-preserving-incremental-social-event#ran","syntology_url":"https://syntology.ai/paper/2101.08747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.08747"}},"official":{"repos":["RingBDStack/KPGNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/interpretable-clustering-on-dynamic-graphs","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/laplacian-regularized-few-shot-learning-1#ran","syntology_url":"https://syntology.ai/paper/2006.15486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15486"}},"official":{"repos":["imtiazziko/LaplacianShot"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/erdos-goes-neural-an-unsupervised-learning","slug":"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","slug":"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":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/p-norm-flow-diffusion-for-local-graph#ran","syntology_url":"https://syntology.ai/paper/2005.09810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09810"}},"official":{"repos":["s-h-yang/pNormFlowDiffusion"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/flow-based-algorithms-for-improving-clusters","slug":"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},{"url":"/paper/a-survey-of-adversarial-learning-on-graphs","slug":"a-survey-of-adversarial-learning-on-graphs","title":"A Survey of Adversarial Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.05730","repositories_listed":2,"syntology":null},{"url":"/paper/graph-bert-only-attention-is-needed-for","slug":"graph-bert-only-attention-is-needed-for","title":"Graph-Bert: Only Attention is Needed for Learning Graph Representations","date":"2020-01-15","arxiv_id":"2001.05140","repositories_listed":2,"syntology":null},{"url":"/paper/ensemble-clustering-for-graphs-comparisons","slug":"ensemble-clustering-for-graphs-comparisons","title":"Ensemble Clustering for Graphs: Comparisons and Applications","date":"2019-03-19","arxiv_id":"1903.08012","repositories_listed":2,"syntology":null},{"url":"/paper/watset-local-global-graph-clustering-with","slug":"watset-local-global-graph-clustering-with","title":"Watset: Local-Global Graph Clustering with Applications in Sense and Frame Induction","date":"2018-08-20","arxiv_id":"1808.06696","repositories_listed":2,"syntology":null},{"url":"/paper/optimal-transport-for-structured-data-with","slug":"optimal-transport-for-structured-data-with","title":"Optimal Transport for structured data with application on graphs","date":"2018-05-23","arxiv_id":"1805.09114","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}},"official":null}},{"url":"/paper/tri-learn-graph-fusion-network-for-attributed","slug":"tri-learn-graph-fusion-network-for-attributed","title":"Tri-Learn Graph Fusion Network for Attributed Graph Clustering","date":"2025-07-18","arxiv_id":"2507.13620","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-graph-clustering-with-deep","slug":"unsupervised-graph-clustering-with-deep","title":"Unsupervised Graph Clustering with Deep Structural Entropy","date":"2025-05-20","arxiv_id":"2505.14040","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-local-clustering-over-attributed","slug":"adaptive-local-clustering-over-attributed","title":"Adaptive Local Clustering over Attributed Graphs","date":"2025-03-26","arxiv_id":"2503.20488","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-optimization-on-relaxed-indicator","slug":"riemannian-optimization-on-relaxed-indicator","title":"Riemannian Optimization on Relaxed Indicator Matrix Manifold","date":"2025-03-26","arxiv_id":"2503.20505","repositories_listed":1,"syntology":null},{"url":"/paper/graphhash-graph-clustering-enables-parameter","slug":"graphhash-graph-clustering-enables-parameter","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","date":"2024-12-23","arxiv_id":"2412.17245","repositories_listed":1,"syntology":null},{"url":"/paper/pasco-parallel-structured-coarsening-an","slug":"pasco-parallel-structured-coarsening-an","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","date":"2024-12-18","arxiv_id":"2412.13592","repositories_listed":1,"syntology":null},{"url":"/paper/one-node-one-model-featuring-the-missing-half","slug":"one-node-one-model-featuring-the-missing-half","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","date":"2024-12-13","arxiv_id":"2412.09902","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/one-node-one-model-featuring-the-missing-half#ran","syntology_url":"https://syntology.ai/paper/2412.09902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09902"}},"official":{"repos":["xiexuanting/fpgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/provably-extending-pagerank-based-local","slug":"provably-extending-pagerank-based-local","title":"Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs","date":"2024-12-04","arxiv_id":"2412.03008","repositories_listed":1,"syntology":null},{"url":"/paper/graph-max-shift-a-hill-climbing-method-for","slug":"graph-max-shift-a-hill-climbing-method-for","title":"Graph Max Shift: A Hill-Climbing Method for Graph Clustering","date":"2024-11-27","arxiv_id":"2411.18794","repositories_listed":1,"syntology":null},{"url":"/paper/a-dual-adaptive-assignment-approach-for","slug":"a-dual-adaptive-assignment-approach-for","title":"RDSA: A Robust Deep Graph Clustering Framework via Dual Soft Assignment","date":"2024-10-29","arxiv_id":"2410.21745","repositories_listed":1,"syntology":null},{"url":"/paper/sentiment-driven-community-detection-in-a","slug":"sentiment-driven-community-detection-in-a","title":"Sentiment-Driven Community Detection in a Network of Perfume Preferences","date":"2024-10-24","arxiv_id":"2410.19177","repositories_listed":1,"syntology":null},{"url":"/paper/a-semidefinite-relaxation-approach-for-fair","slug":"a-semidefinite-relaxation-approach-for-fair","title":"A Semidefinite Relaxation Approach for Fair Graph Clustering","date":"2024-10-19","arxiv_id":"2410.15233","repositories_listed":1,"syntology":null},{"url":"/paper/cross-camera-data-association-via-gnn-for","slug":"cross-camera-data-association-via-gnn-for","title":"Cross-Camera Data Association via GNN for Supervised Graph Clustering","date":"2024-10-01","arxiv_id":"2410.00643","repositories_listed":1,"syntology":null},{"url":"/paper/a-versatile-framework-for-attributed-network","slug":"a-versatile-framework-for-attributed-network","title":"A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation","date":"2024-08-10","arxiv_id":"2408.05459","repositories_listed":1,"syntology":null},{"url":"/paper/scasdc-attention-enhanced-structural-deep","slug":"scasdc-attention-enhanced-structural-deep","title":"scASDC: Attention Enhanced Structural Deep Clustering for Single-cell RNA-seq Data","date":"2024-08-09","arxiv_id":"2408.05258","repositories_listed":1,"syntology":null},{"url":"/paper/reliable-node-similarity-matrix-guided","slug":"reliable-node-similarity-matrix-guided","title":"Reliable Node Similarity Matrix Guided Contrastive Graph Clustering","date":"2024-08-07","arxiv_id":"2408.03765","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reliable-node-similarity-matrix-guided#ran","syntology_url":"https://syntology.ai/paper/2408.03765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03765"}},"official":{"repos":["Cloudy1225/NS4GC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/balanced-multi-relational-graph-clustering","slug":"balanced-multi-relational-graph-clustering","title":"Balanced Multi-Relational Graph Clustering","date":"2024-07-23","arxiv_id":"2407.16863","repositories_listed":1,"syntology":{"n":15,"n_ran":15,"n_constructed":0,"n_ran_checked":8,"n_instrument":7,"n_unverified":0,"n_honours":4,"n_violates":0,"n_no_contract":4,"n_pointer_only":15,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 4 honoured, 0 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/balanced-multi-relational-graph-clustering#ran","syntology_url":"https://syntology.ai/paper/2407.16863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.16863"}},"official":{"repos":["zxlearningdeep/bmgc"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/advanced-graph-clustering-methods-a","slug":"advanced-graph-clustering-methods-a","title":"Advanced Graph Clustering Methods: A Comprehensive and In-Depth Analysis","date":"2024-07-12","arxiv_id":"2407.09055","repositories_listed":1,"syntology":null},{"url":"/paper/local-clustering-for-lung-cancer-image","slug":"local-clustering-for-lung-cancer-image","title":"Local Clustering for Lung Cancer Image Classification via Sparse Solution Technique","date":"2024-07-11","arxiv_id":"2407.08800","repositories_listed":1,"syntology":null},{"url":"/paper/unveiling-global-interactive-patterns-across","slug":"unveiling-global-interactive-patterns-across","title":"Unveiling Global Interactive Patterns across Graphs: Towards Interpretable Graph Neural Networks","date":"2024-07-02","arxiv_id":"2407.01979","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unveiling-global-interactive-patterns-across#ran","syntology_url":"https://syntology.ai/paper/2407.01979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01979"}},"official":{"repos":["Wangyuwen0627/GIP-Framework"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-modularity-maximization-for-graph","slug":"revisiting-modularity-maximization-for-graph","title":"Revisiting Modularity Maximization for Graph Clustering: A Contrastive Learning Perspective","date":"2024-06-20","arxiv_id":"2406.14288","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-semantic-node-identifiers-for","slug":"structure-aware-semantic-node-identifiers-for","title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","date":"2024-05-26","arxiv_id":"2405.16435","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":3,"n_honours":1,"n_violates":2,"n_no_contract":2,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 2 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structure-aware-semantic-node-identifiers-for#ran","syntology_url":"https://syntology.ai/paper/2405.16435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16435"}},"official":{"repos":["LUOyk1999/NodeID"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/lsenet-lorentz-structural-entropy-neural","slug":"lsenet-lorentz-structural-entropy-neural","title":"LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering","date":"2024-05-20","arxiv_id":"2405.11801","repositories_listed":1,"syntology":null},{"url":"/paper/multi-order-graph-clustering-with-adaptive","slug":"multi-order-graph-clustering-with-adaptive","title":"Multi-order Graph Clustering with Adaptive Node-level Weight Learning","date":"2024-05-20","arxiv_id":"2405.12183","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-approximations-for-cluster","slug":"combinatorial-approximations-for-cluster","title":"Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better","date":"2024-04-24","arxiv_id":"2404.16131","repositories_listed":1,"syntology":null},{"url":"/paper/gscan-graph-stability-clustering-for","slug":"gscan-graph-stability-clustering-for","title":"GSCAN: Graph Stability Clustering for Applications With Noise Using Edge-Aware Excess-of-Mass","date":"2024-04-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/maximum-likelihood-estimation-on-stochastic","slug":"maximum-likelihood-estimation-on-stochastic","title":"Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models","date":"2024-03-28","arxiv_id":"2403.19516","repositories_listed":1,"syntology":null},{"url":"/paper/towards-cohesion-fairness-harmony-contrastive","slug":"towards-cohesion-fairness-harmony-contrastive","title":"Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering","date":"2024-02-16","arxiv_id":"2402.10756","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-position-embedding-of-graphs","slug":"hierarchical-position-embedding-of-graphs","title":"Hierarchical Position Embedding of Graphs with Landmarks and Clustering for Link Prediction","date":"2024-02-13","arxiv_id":"2402.08174","repositories_listed":1,"syntology":null},{"url":"/paper/overlap-aware-end-to-end-supervised","slug":"overlap-aware-end-to-end-supervised","title":"End-to-End Supervised Hierarchical Graph Clustering for Speaker Diarization","date":"2024-01-23","arxiv_id":"2401.12850","repositories_listed":1,"syntology":null},{"url":"/paper/every-node-is-different-dynamically-fusing","slug":"every-node-is-different-dynamically-fusing","title":"Every Node is Different: Dynamically Fusing Self-Supervised Tasks for Attributed Graph Clustering","date":"2024-01-12","arxiv_id":"2401.06595","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/every-node-is-different-dynamically-fusing#ran","syntology_url":"https://syntology.ai/paper/2401.06595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06595"}},"official":{"repos":["q086/dyfss"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-3d-panoptic-segmentation-with","slug":"scalable-3d-panoptic-segmentation-with","title":"Scalable 3D Panoptic Segmentation As Superpoint Graph Clustering","date":"2024-01-12","arxiv_id":"2401.06704","repositories_listed":1,"syntology":null},{"url":"/paper/learning-persistent-community-structures-in","slug":"learning-persistent-community-structures-in","title":"Learning Persistent Community Structures in Dynamic Networks via Topological Data Analysis","date":"2024-01-06","arxiv_id":"2401.03194","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-persistent-community-structures-in#ran","syntology_url":"https://syntology.ai/paper/2401.03194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.03194"}},"official":{"repos":["kundtx/MFC_TopoReg"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/homophily-related-adaptive-hybrid-graph","slug":"homophily-related-adaptive-hybrid-graph","title":"Homophily-Related: Adaptive Hybrid Graph Filter for Multi-View Graph Clustering","date":"2024-01-05","arxiv_id":"2401.02682","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-high-quality-clustering-for-large","slug":"efficient-high-quality-clustering-for-large","title":"Efficient High-Quality Clustering for Large Bipartite Graphs","date":"2023-12-28","arxiv_id":"2312.16926","repositories_listed":1,"syntology":null},{"url":"/paper/dgcluster-a-neural-framework-for-attributed","slug":"dgcluster-a-neural-framework-for-attributed","title":"DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization","date":"2023-12-20","arxiv_id":"2312.12697","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-clustering-of-attributed-multi","slug":"spectral-clustering-of-attributed-multi","title":"Spectral Clustering of Attributed Multi-relational Graphs","date":"2023-11-03","arxiv_id":"2311.01840","repositories_listed":1,"syntology":null},{"url":"/paper/robust-graph-clustering-via-meta-weighting","slug":"robust-graph-clustering-via-meta-weighting","title":"Robust Graph Clustering via Meta Weighting for Noisy Graphs","date":"2023-11-01","arxiv_id":"2311.00322","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-graph-clustering-via-meta-weighting#ran","syntology_url":"https://syntology.ai/paper/2311.00322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00322"}},"official":{"repos":["hyeonsoojo/metagc"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-the-domain-gap-by-clustering-based","slug":"bridging-the-domain-gap-by-clustering-based","title":"Clustering-based Image-Text Graph Matching for Domain Generalization","date":"2023-10-04","arxiv_id":"2310.02692","repositories_listed":1,"syntology":null},{"url":"/paper/the-map-equation-goes-neural","slug":"the-map-equation-goes-neural","title":"The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks","date":"2023-10-02","arxiv_id":"2310.01144","repositories_listed":1,"syntology":null},{"url":"/paper/redundancy-free-self-supervised-relational","slug":"redundancy-free-self-supervised-relational","title":"Redundancy-Free Self-Supervised Relational Learning for Graph Clustering","date":"2023-09-09","arxiv_id":"2309.04694","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/redundancy-free-self-supervised-relational#ran","syntology_url":"https://syntology.ai/paper/2309.04694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.04694"}},"official":{"repos":["yisiyu95/r2fgc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-multi-view-graph-clustering-with","slug":"efficient-multi-view-graph-clustering-with","title":"Efficient Multi-View Graph Clustering with Local and Global Structure Preservation","date":"2023-08-31","arxiv_id":"2309.00024","repositories_listed":1,"syntology":null},{"url":"/paper/edge-aware-hard-clustering-graph-pooling-for","slug":"edge-aware-hard-clustering-graph-pooling-for","title":"Edge-aware Hard Clustering Graph Pooling for Brain Imaging","date":"2023-08-23","arxiv_id":"2308.11909","repositories_listed":1,"syntology":null},{"url":"/paper/homophily-enhanced-structure-learning-for","slug":"homophily-enhanced-structure-learning-for","title":"Homophily-enhanced Structure Learning for Graph Clustering","date":"2023-08-10","arxiv_id":"2308.05309","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/homophily-enhanced-structure-learning-for#ran","syntology_url":"https://syntology.ai/paper/2308.05309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05309"}},"official":{"repos":["galogm/hole"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/examining-the-effects-of-degree-distribution","slug":"examining-the-effects-of-degree-distribution","title":"Examining the Effects of Degree Distribution and Homophily in Graph Learning Models","date":"2023-07-17","arxiv_id":"2307.08881","repositories_listed":1,"syntology":null},{"url":"/paper/unpaired-multi-view-graph-clustering-with","slug":"unpaired-multi-view-graph-clustering-with","title":"Unpaired Multi-View Graph Clustering with Cross-View Structure Matching","date":"2023-07-07","arxiv_id":"2307.03476","repositories_listed":1,"syntology":null},{"url":"/paper/multi-class-graph-clustering-via-approximated","slug":"multi-class-graph-clustering-via-approximated","title":"Multi-class Graph Clustering via Approximated Effective $p$-Resistance","date":"2023-06-14","arxiv_id":"2306.08617","repositories_listed":1,"syntology":null},{"url":"/paper/faster-approximation-algorithms-for","slug":"faster-approximation-algorithms-for","title":"Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling","date":"2023-06-08","arxiv_id":"2306.04884","repositories_listed":1,"syntology":null},{"url":"/paper/joint-graph-learning-and-model-fitting-in","slug":"joint-graph-learning-and-model-fitting-in","title":"Joint Graph Learning and Model Fitting in Laplacian Regularized Stratified Models","date":"2023-05-04","arxiv_id":"2305.02573","repositories_listed":1,"syntology":null},{"url":"/paper/taming-graph-kernels-with-random-features","slug":"taming-graph-kernels-with-random-features","title":"Taming graph kernels with random features","date":"2023-04-29","arxiv_id":"2305.00156","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-trajectory-based-social-group","slug":"real-time-trajectory-based-social-group","title":"Real-time Trajectory-based Social Group Detection","date":"2023-04-12","arxiv_id":"2304.05678","repositories_listed":1,"syntology":null},{"url":"/paper/feudal-graph-reinforcement-learning","slug":"feudal-graph-reinforcement-learning","title":"Feudal Graph Reinforcement Learning","date":"2023-04-11","arxiv_id":"2304.05099","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-toolkit-of-algorithms-for-graphs","slug":"spectral-toolkit-of-algorithms-for-graphs","title":"Spectral Toolkit of Algorithms for Graphs: Technical Report (1)","date":"2023-04-05","arxiv_id":"2304.03170","repositories_listed":1,"syntology":null},{"url":"/paper/a-parameter-free-graph-reduction-for-spectral","slug":"a-parameter-free-graph-reduction-for-spectral","title":"A parameter-free graph reduction for spectral clustering and SpectralNet","date":"2023-02-25","arxiv_id":"2302.13165","repositories_listed":1,"syntology":null},{"url":"/paper/random-projection-tree-similarity-metric-for","slug":"random-projection-tree-similarity-metric-for","title":"Random projection tree similarity metric for SpectralNet","date":"2023-02-25","arxiv_id":"2302.13168","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-hierarchical-clustering-using","slug":"supervised-hierarchical-clustering-using","title":"Supervised Hierarchical Clustering using Graph Neural Networks for Speaker Diarization","date":"2023-02-24","arxiv_id":"2302.12716","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-spectral-clustering-density-based","slug":"approximate-spectral-clustering-density-based","title":"Approximate spectral clustering density-based similarity for noisy datasets","date":"2023-02-22","arxiv_id":"2302.11298","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-spectral-clustering-with","slug":"approximate-spectral-clustering-with","title":"Approximate spectral clustering with eigenvector selection and self-tuned $k$","date":"2023-02-22","arxiv_id":"2302.11297","repositories_listed":1,"syntology":null},{"url":"/paper/refining-a-k-nearest-neighbor-graph-for-a","slug":"refining-a-k-nearest-neighbor-graph-for-a","title":"Refining a $k$-nearest neighbor graph for a computationally efficient spectral clustering","date":"2023-02-22","arxiv_id":"2302.11296","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-linear-multi-view-attributed","slug":"simultaneous-linear-multi-view-attributed","title":"Simultaneous Linear Multi-view Attributed Graph Representation Learning and Clustering","date":"2023-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clusterfug-clustering-fully-connected-graphs","slug":"clusterfug-clustering-fully-connected-graphs","title":"ClusterFuG: Clustering Fully connected Graphs by Multicut","date":"2023-01-28","arxiv_id":"2301.12159","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-guided-contrastive-graph-clustering","slug":"cluster-guided-contrastive-graph-clustering","title":"Cluster-guided Contrastive Graph Clustering Network","date":"2023-01-03","arxiv_id":"2301.01098","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/cluster-guided-contrastive-graph-clustering#ran","syntology_url":"https://syntology.ai/paper/2301.01098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.01098"}},"official":{"repos":["xihongyang1999/ccgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/correlation-clustering-algorithm-for-dynamic","slug":"correlation-clustering-algorithm-for-dynamic","title":"Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach","date":"2023-01-01","arxiv_id":"2301.00384","repositories_listed":1,"syntology":null},{"url":"/paper/graph-augmentation-clustering-network","slug":"graph-augmentation-clustering-network","title":"EGRC-Net: Embedding-induced Graph Refinement Clustering Network","date":"2022-11-19","arxiv_id":"2211.10627","repositories_listed":1,"syntology":null},{"url":"/paper/graph-fuzzy-system-concepts-models-and","slug":"graph-fuzzy-system-concepts-models-and","title":"Graph Fuzzy System: Concepts, Models and Algorithms","date":"2022-10-30","arxiv_id":"2210.16730","repositories_listed":1,"syntology":null}],"syntology_records":21,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":6,"papers_placed":1,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/graph-clustering-on-citeseer","since_archive":"/sota/graph-clustering-on-citeseer#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/graph-clustering-on-cora","since_archive":"/sota/graph-clustering-on-cora#since-judged","papers_judged":6,"placed":1},{"leaderboard":"/sota/graph-clustering-on-pubmed","since_archive":"/sota/graph-clustering-on-pubmed#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":33,"papers_where_code_ran_first_page":"/task/graph-clustering/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":4,"url":"/task/graph-clustering/papers/2","json":"/task/graph-clustering/papers/2.json","rows":100},{"order":"archive","page":3,"of":4,"url":"/task/graph-clustering/papers/3","json":"/task/graph-clustering/papers/3.json","rows":100},{"order":"archive","page":4,"of":4,"url":"/task/graph-clustering/papers/4","json":"/task/graph-clustering/papers/4.json","rows":93},{"order":"ran","page":1,"of":1,"url":"/task/graph-clustering/papers/ran/1","json":"/task/graph-clustering/papers/ran/1.json","rows":33}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"22a8c978adc31a33152365eb5d659df964f1cac96f43fb214fb627b88571a756","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}