{"url":"/dataset/webkb","name":"WebKB","full_name":"WebKB","description_markdown":"**WebKB** is a dataset that includes web pages from computer science departments of various universities. 4,518 web pages are categorized into 6 imbalanced categories (Student, Faculty, Staff, Department, Course, Project). Additionally there is Other miscellanea category that is not comparable to the rest.\r\n\r\nSource: [Using Fuzzy Logic to Leverage HTML Markup for Web Page Representation](https://arxiv.org/abs/1606.04429)","description_withheld":null,"homepage":"http://www.cs.cmu.edu/~webkb/","introduced_date":"1998-01-01","introduced_date_note":null,"introduced_by":{"paper":null,"title":"Learning to Extract Symbolic Knowledge from the World Wide Web","first_author":null,"url":"http://www.aaai.org/Library/AAAI/1998/aaai98-072.php"},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Node Classification","url":"/task/node-classification","datasets_with_task":"/datasets/task/node-classification"},{"name":"Node Clustering","url":"/task/node-clustering","datasets_with_task":"/datasets/task/node-clustering"},{"name":"Imputation","url":"/task/imputation","datasets_with_task":"/datasets/task/imputation"},{"name":"Relational Reasoning","url":"/task/relational-reasoning","datasets_with_task":"/datasets/task/relational-reasoning"},{"name":"Bayesian Inference","url":"/task/bayesian-inference","datasets_with_task":"/datasets/task/bayesian-inference"}],"languages":[],"variants":["WebKB","Cornell","Texas","Wisconsin"],"data_loaders":[{"repo":"https://github.com/rusty1s/pytorch_geometric","url":"https://pytorch-geometric.readthedocs.io/en/latest/modules/datasets.html","frameworks":["pytorch"]}],"num_papers_in_archive":113,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/node-classification-on-wisconsin","task":"Node Classification","dataset_variant":"Wisconsin","rows":63,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"5-HiGCN","paper":"/paper/higher-order-graph-convolutional-network-with","metrics":{"Accuracy":"94.99±0.65"},"code_links":[{"title":"yiminghh/higcn","url":"https://github.com/yiminghh/higcn"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-texas","task":"Node Classification","dataset_variant":"Texas","rows":62,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"RDGNN-S","paper":"/paper/graph-neural-reaction-diffusion-models","metrics":{"Accuracy":"94.59 ± 5.97"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/mamba-based-graph-convolutional-networks","title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","date":"2025-01-26","rows_on_this_dataset":1,"code_links":0,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":2,"samples_unverified":1,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/deltagnn-graph-neural-network-with","title":"DeltaGNN: Graph Neural Network with Information Flow Control","date":"2025-01-10","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/heterophilic-graph-neural-networks","title":"Heterophilic Graph Neural Networks Optimization with Causal Message-passing","date":"2024-11-21","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/improving-graph-neural-networks-by-learning","title":"Improving Graph Neural Networks by Learning Continuous Edge Directions","date":"2024-10-18","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/unigap-a-universal-and-adaptive-graph","title":"UniGAP: A Universal and Adaptive Graph Upsampling Approach to Mitigate Over-Smoothing in Node Classification Tasks","date":"2024-07-28","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/the-heterophilic-snowflake-hypothesis","title":"The Heterophilic Snowflake Hypothesis: Training and Empowering GNNs for Heterophilic Graphs","date":"2024-06-18","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-neural-reaction-diffusion-models","title":"Graph Neural Reaction Diffusion Models","date":"2024-06-16","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/transfer-entropy-in-graph-convolutional","title":"Transfer Entropy in Graph Convolutional Neural Networks","date":"2024-06-08","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/sign-is-not-a-remedy-multiset-to-multiset","title":"Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs","date":"2024-05-31","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/heterophilous-distribution-propagation-for","title":"Heterophilous Distribution Propagation for Graph Neural Networks","date":"2024-05-31","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-neural-aggregation-diffusion-with","title":"Graph Neural Aggregation-diffusion with Metastability","date":"2024-03-29","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/learn-from-heterophily-heterophilous","title":"Learn from Heterophily: Heterophilous Information-enhanced Graph Neural Network","date":"2024-03-26","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/refining-latent-homophilic-structures-over","title":"Refining Latent Homophilic Structures over Heterophilic Graphs for Robust Graph Convolution Networks","date":"2023-12-27","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/graphrare-reinforcement-learning-enhanced","title":"GraphRARE: Reinforcement Learning Enhanced Graph Neural Network with Relative Entropy","date":"2023-12-15","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/cat-a-causally-graph-attention-network-for","title":"CAT: A Causally Graph Attention Network for Trimming Heterophilic Graph","date":"2023-12-14","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/breaking-the-entanglement-of-homophily-and","title":"Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification","date":"2023-12-07","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/higher-order-graph-convolutional-network-with","title":"Higher-order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes","date":"2023-09-22","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/bregman-graph-neural-network","title":"Bregman Graph Neural Network","date":"2023-09-12","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":26,"samples_ran":5,"samples_unverified":21,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/unig-encoder-a-universal-feature-encoder-for","title":"UniG-Encoder: A Universal Feature Encoder for Graph and Hypergraph Node Classification","date":"2023-08-03","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/diffusion-jump-gnns-homophiliation-via","title":"Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters","date":"2023-06-29","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/self-attention-dual-embedding-for-graphs-with","title":"Self-attention Dual Embedding for Graphs with Heterophily","date":"2023-05-28","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/gcnh-a-simple-method-for-representation","title":"GCNH: A Simple Method For Representation Learning On Heterophilous Graphs","date":"2023-04-21","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/ordered-gnn-ordering-message-passing-to-deal","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","date":"2023-02-03","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":10,"samples_ran":1,"samples_unverified":9,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/enhancing-intra-class-information-extraction","title":"Enhancing Intra-class Information Extraction for Heterophilous Graphs: One Neural Architecture Search Approach","date":"2022-11-20","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/beyond-homophily-with-graph-echo-state-1","title":"Beyond Homophily with Graph Echo State Networks","date":"2022-10-27","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/revisiting-heterophily-for-graph-neural","title":"Revisiting Heterophily For Graph Neural Networks","date":"2022-10-14","rows_on_this_dataset":16,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":2,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/make-heterophily-graphs-better-fit-gnn-a","title":"Make Heterophily Graphs Better Fit GNN: A Graph Rewiring Approach","date":"2022-09-17","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/sheaf-neural-networks-with-connection","title":"Sheaf Neural Networks with Connection Laplacians","date":"2022-06-17","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/diffwire-inductive-graph-rewiring-via-the","title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","date":"2022-06-15","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/universal-deep-gnns-rethinking-residual","title":"Universal Deep GNNs: Rethinking Residual Connection in GNNs from a Path Decomposition Perspective for Preventing the Over-smoothing","date":"2022-05-30","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/finding-global-homophily-in-graph-neural","title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","date":"2022-05-15","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/neural-sheaf-diffusion-a-topological","title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","date":"2022-02-09","rows_on_this_dataset":6,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":0,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/understanding-over-squashing-and-bottlenecks-1","title":"Understanding over-squashing and bottlenecks on graphs via curvature","date":"2021-11-29","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":5,"samples_ran":0,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/cn-motifs-perceptive-graph-neural-networks","title":"CN-Motifs Perceptive Graph Neural Networks","date":"2021-11-15","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":21,"samples_ran":7,"samples_unverified":14,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/fdgatii-fast-dynamic-graph-attention-with","title":"FDGATII : Fast Dynamic Graph Attention with Initial Residual and Identity Mapping","date":"2021-10-21","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/label-wise-message-passing-graph-neural","title":"Label-Wise Graph Convolutional Network for Heterophilic Graphs","date":"2021-10-15","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/tree-decomposed-graph-neural-network","title":"Tree Decomposed Graph Neural Network","date":"2021-08-25","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/simple-truncated-svd-based-model-for-node","title":"Simple Truncated SVD based Model for Node Classification on Heterophilic Graphs","date":"2021-06-24","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/breaking-the-limit-of-graph-neural-networks","title":"Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns","date":"2021-06-11","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":12,"samples_ran":1,"samples_unverified":11,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/improving-graph-neural-networks-with-simple","title":"Improving Graph Neural Networks with Simple Architecture Design","date":"2021-05-17","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/two-sides-of-the-same-coin-heterophily-and","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","date":"2021-02-12","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/beyond-low-frequency-information-in-graph","title":"Beyond Low-frequency Information in Graph Convolutional Networks","date":"2021-01-04","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":5,"samples_unverified":2,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","rows_on_this_dataset":4,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":21,"samples_ran":13,"samples_unverified":8,"pointer_only_for_licence":6,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/joint-adaptive-feature-smoothing-and-topology","title":"Adaptive Universal Generalized PageRank Graph Neural Network","date":"2020-06-14","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":2,"samples_ran":0,"samples_unverified":2,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/non-local-graph-neural-networks","title":"Non-Local Graph Neural Networks","date":"2020-05-29","rows_on_this_dataset":6,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":3,"samples_unverified":0,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/geom-gcn-geometric-graph-convolutional-1","title":"Geom-GCN: Geometric Graph Convolutional Networks","date":"2020-02-13","rows_on_this_dataset":6,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":7,"samples_unverified":0,"pointer_only_for_licence":7,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/mixhop-higher-order-graph-convolution","title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","date":"2019-04-30","rows_on_this_dataset":2,"code_links":3,"syntology":null}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":15,"samples_harvested":127,"samples_ran":48,"samples_unverified":79,"pointer_only_for_licence":31,"papers_with_no_sample_that_ran":3,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}