{"url":"/task/node-clustering","name":"Node Clustering","slug":"node-clustering","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":130,"papers_with_code":72,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":14,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/imdb-movie-reviews","name":"IMDb Movie Reviews","full_name":"","num_papers_in_archive":1787},{"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/dblp","name":"DBLP","full_name":"Citation Network Dataset","num_papers_in_archive":218},{"url":"/dataset/wiki-squirrel","name":"Wiki Squirrel","full_name":"Wikipedia Squirrel","num_papers_in_archive":208},{"url":"/dataset/webkb","name":"WebKB","full_name":"WebKB","num_papers_in_archive":113},{"url":"/dataset/wiki-cs","name":"Wiki-CS","full_name":"","num_papers_in_archive":111},{"url":"/dataset/cornell","name":"Cornell","full_name":null,"num_papers_in_archive":54},{"url":"/dataset/amazon-photo","name":"Amazon Photo","full_name":"Amazon Photo","num_papers_in_archive":11},{"url":"/dataset/brazil-air-traffic","name":"Brazil Air-Traffic","full_name":"Brazil Air-Traffic","num_papers_in_archive":8},{"url":"/dataset/wiki","name":"Wiki","full_name":"Web Traffic Time Series Forecasting","num_papers_in_archive":8},{"url":"/dataset/arxivcs","name":"arXivCS","full_name":"","num_papers_in_archive":2},{"url":"/dataset/herigraph","name":"HeriGraph","full_name":"Multimodal Machine Learning Datasets on Graphs of Heritage Values and Attributes","num_papers_in_archive":2}],"subtasks":[],"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":72,"tagged_in_all":130,"items":[{"url":"/paper/transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","arxiv_id":"2308.09517","repositories_listed":3,"syntology":{"n":26,"n_ran":5,"n_unverified":21,"n_pointer_only":0}},{"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/graph-parsing-networks","title":"Graph Parsing Networks","date":"2024-02-22","arxiv_id":"2402.14393","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":0}},{"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/deep-temporal-graph-clustering","title":"Deep Temporal Graph Clustering","date":"2023-05-18","arxiv_id":"2305.10738","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/nafs-a-simple-yet-tough-to-beat-baseline-for-1","title":"NAFS: A Simple yet Tough-to-beat Baseline for Graph Representation Learning","date":"2022-06-17","arxiv_id":"2206.08583","repositories_listed":2,"syntology":null},{"url":"/paper/asymptotics-of-network-embeddings-learned-via","title":"Asymptotics of Network Embeddings Learned via Subsampling","date":"2021-07-06","arxiv_id":"2107.02363","repositories_listed":2,"syntology":{"n":9,"n_ran":3,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/simple-spectral-graph-convolution","title":"Simple Spectral Graph Convolution","date":"2021-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/graph-infoclust-leveraging-cluster-level-node","title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","date":"2020-09-15","arxiv_id":"2009.06946","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":1}},{"url":"/paper/magnn-metapath-aggregated-graph-neural","title":"MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding","date":"2020-02-05","arxiv_id":"2002.01680","repositories_listed":2,"syntology":null},{"url":"/paper/fusing-structure-and-content-via-non-negative","title":"Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks","date":"2018-04-15","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/mitigating-degree-bias-in-graph","title":"Mitigating Degree Bias in Graph Representation Learning with Learnable Structural Augmentation and Structural Self-Attention","date":"2025-04-21","arxiv_id":"2504.15075","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-wise-graph-transformer-with-dual","title":"Cluster-wise Graph Transformer with Dual-granularity Kernelized Attention","date":"2024-10-09","arxiv_id":"2410.06746","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_unverified":1,"n_pointer_only":14}},{"url":"/paper/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/bootstrap-latents-of-nodes-and-neighbors-for","title":"Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning","date":"2024-08-09","arxiv_id":"2408.05087","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/cluster-based-graph-collaborative-filtering","title":"Cluster-based Graph Collaborative Filtering","date":"2024-04-16","arxiv_id":"2404.10321","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_unverified":0,"n_pointer_only":6}},{"url":"/paper/a-contrastive-variational-graph-auto-encoder","title":"A Contrastive Variational Graph Auto-Encoder for Node Clustering","date":"2023-12-28","arxiv_id":"2312.16830","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-degree-biases-in-message-passing","title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","date":"2023-12-28","arxiv_id":"2312.16788","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-deep-nonnegative-matrix","title":"Contrastive Deep Nonnegative Matrix Factorization for Community Detection","date":"2023-11-04","arxiv_id":"2311.02357","repositories_listed":1,"syntology":null},{"url":"/paper/universal-graph-random-features","title":"General Graph Random Features","date":"2023-10-07","arxiv_id":"2310.04859","repositories_listed":1,"syntology":null},{"url":"/paper/sr-hgn-semantic-and-relation-aware","title":"SR-HGN: semantic- and relation-aware heterogeneous graph neural network","date":"2023-08-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/classification-of-edge-dependent-labels-of","title":"Classification of Edge-dependent Labels of Nodes in Hypergraphs","date":"2023-06-05","arxiv_id":"2306.03032","repositories_listed":1,"syntology":null},{"url":"/paper/commonsense-knowledge-graph-completion-via","title":"Commonsense Knowledge Graph Completion Via Contrastive Pretraining and Node Clustering","date":"2023-05-26","arxiv_id":"2305.17019","repositories_listed":1,"syntology":null},{"url":"/paper/csgcl-community-strength-enhanced-graph","title":"CSGCL: Community-Strength-Enhanced Graph Contrastive Learning","date":"2023-05-08","arxiv_id":"2305.04658","repositories_listed":1,"syntology":{"n":9,"n_ran":0,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/pgb-a-pubmed-graph-benchmark-for","title":"PGB: A PubMed Graph Benchmark for Heterogeneous Network Representation Learning","date":"2023-05-04","arxiv_id":"2305.02691","repositories_listed":1,"syntology":null},{"url":"/paper/cross-city-traffic-prediction-via-semantic","title":"Semantic-Fused Multi-Granularity Cross-City Traffic Prediction","date":"2023-02-23","arxiv_id":"2302.11774","repositories_listed":1,"syntology":null},{"url":"/paper/eagle-large-scale-learning-of-turbulent-fluid","title":"Eagle: Large-Scale Learning of Turbulent Fluid Dynamics with Mesh Transformers","date":"2023-02-16","arxiv_id":"2302.10803","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/user-unsupervised-structural-entropy-based","title":"USER: Unsupervised Structural Entropy-based Robust Graph Neural Network","date":"2023-02-12","arxiv_id":"2302.05889","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-attributed-graph-subspace-clustering","title":"Scalable Attributed-Graph Subspace Clustering","date":"2023-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":11,"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"}}