{"url":"/task/graph-mining","name":"Graph Mining","slug":"graph-mining","description_markdown":null,"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":174,"papers_with_code":86,"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":6,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/yelp","name":"Yelp","full_name":"","num_papers_in_archive":86},{"url":"/dataset/yelpchi","name":"Yelp-Fraud","full_name":"Multi-relational Graph Dataset for Yelp Spam Review Detection","num_papers_in_archive":13},{"url":"/dataset/amazon-fraud","name":"Amazon-Fraud","full_name":"Multi-relational Graph Dataset for Amazon Fraudulent Account Detection","num_papers_in_archive":8},{"url":"/dataset/netzschleuder","name":"Netzschleuder","full_name":"network catalogue, repository and centrifuge","num_papers_in_archive":5},{"url":"/dataset/imcpt-sparsegm-100","name":"IMCPT-SparseGM-100","full_name":"","num_papers_in_archive":1},{"url":"/dataset/nba-player-performance-prediction-dataset","name":"NBA player performance prediction dataset","full_name":"","num_papers_in_archive":1}],"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":86,"tagged_in_all":174,"items":[{"url":"/paper/enhancing-graph-neural-network-based-fraud","title":"Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters","date":"2020-08-19","arxiv_id":"2008.08692","repositories_listed":6,"syntology":{"n":17,"n_ran":1,"n_unverified":16,"n_pointer_only":0}},{"url":"/paper/false-information-on-web-and-social-media-a","title":"False Information on Web and Social Media: A Survey","date":"2018-04-23","arxiv_id":"1804.08559","repositories_listed":3,"syntology":null},{"url":"/paper/all-the-world-s-a-hyper-graph-a-data-drama","title":"All the World's a (Hyper)Graph: A Data Drama","date":"2022-06-16","arxiv_id":"2206.08225","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/a-survey-on-fairness-for-machine-learning-on","title":"A Survey on Fairness for Machine Learning on Graphs","date":"2022-05-11","arxiv_id":"2205.05396","repositories_listed":2,"syntology":null},{"url":"/paper/fairness-in-graph-mining-a-survey","title":"Fairness in Graph Mining: A Survey","date":"2022-04-21","arxiv_id":"2204.09888","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/reinforcement-learning-on-graph-a-survey","title":"Reinforcement learning on graphs: A survey","date":"2022-04-13","arxiv_id":"2204.06127","repositories_listed":2,"syntology":null},{"url":"/paper/twitch-gamers-a-dataset-for-evaluating","title":"Twitch Gamers: a Dataset for Evaluating Proximity Preserving and Structural Role-based Node Embeddings","date":"2021-01-08","arxiv_id":"2101.03091","repositories_listed":2,"syntology":null},{"url":"/paper/an-api-oriented-open-source-python-framework-1","title":"Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.04819","repositories_listed":2,"syntology":null},{"url":"/paper/pitfalls-of-graph-neural-network-evaluation","title":"Pitfalls of Graph Neural Network Evaluation","date":"2018-11-14","arxiv_id":"1811.05868","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/exploring-the-semantic-content-of","title":"Exploring the Semantic Content of Unsupervised Graph Embeddings: An Empirical Study","date":"2018-06-19","arxiv_id":"1806.07464","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/efficient-parallel-genetic-algorithm-for","title":"Efficient Parallel Genetic Algorithm for Perturbed Substructure Optimization in Complex Network","date":"2024-12-30","arxiv_id":"2412.20980","repositories_listed":1,"syntology":null},{"url":"/paper/correlation-aware-graph-convolutional","title":"Correlation-Aware Graph Convolutional Networks for Multi-Label Node Classification","date":"2024-11-26","arxiv_id":"2411.17350","repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-gnns-meet-efficiency-sparse","title":"Higher-Order GNNs Meet Efficiency: Sparse Sobolev Graph Neural Networks","date":"2024-11-07","arxiv_id":"2411.04570","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-and-fast-estimation-of-temporal","title":"Accurate and Fast Estimation of Temporal Motifs using Path Sampling","date":"2024-09-13","arxiv_id":"2409.08975","repositories_listed":1,"syntology":null},{"url":"/paper/refining-wikidata-taxonomy-using-large","title":"Refining Wikidata Taxonomy using Large Language Models","date":"2024-09-06","arxiv_id":"2409.04056","repositories_listed":1,"syntology":null},{"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/covering-a-graph-with-dense-subgraph-families","title":"Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets","date":"2024-07-23","arxiv_id":"2407.16850","repositories_listed":1,"syntology":null},{"url":"/paper/when-heterophily-meets-heterogeneity-new","title":"When Heterophily Meets Heterogeneity: Challenges and a New Large-Scale Graph Benchmark","date":"2024-07-15","arxiv_id":"2407.10916","repositories_listed":1,"syntology":null},{"url":"/paper/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_unverified":1,"n_pointer_only":0}},{"url":"/paper/is-your-large-language-model-knowledgeable-or","title":"Is Your Large Language Model Knowledgeable or a Choices-Only Cheater?","date":"2024-07-02","arxiv_id":"2407.01992","repositories_listed":1,"syntology":null},{"url":"/paper/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/toward-structure-fairness-in-dynamic-graph","title":"Toward Structure Fairness in Dynamic Graph Embedding: A Trend-aware Dual Debiasing Approach","date":"2024-06-19","arxiv_id":"2406.13201","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-the-message-passing-in","title":"Revisiting the Message Passing in Heterophilous Graph Neural Networks","date":"2024-05-28","arxiv_id":"2405.17768","repositories_listed":1,"syntology":null},{"url":"/paper/oag-bench-a-human-curated-benchmark-for","title":"OAG-Bench: A Human-Curated Benchmark for Academic Graph Mining","date":"2024-02-24","arxiv_id":"2402.15810","repositories_listed":1,"syntology":null},{"url":"/paper/graph-skeleton-1-nodes-are-sufficient-to","title":"Graph-Skeleton: ~1% Nodes are Sufficient to Represent Billion-Scale Graph","date":"2024-02-14","arxiv_id":"2402.09565","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":4}},{"url":"/paper/fine-tuning-graph-neural-networks-by","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","date":"2023-12-21","arxiv_id":"2312.13583","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":13}},{"url":"/paper/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/survey-on-trustworthy-graph-neural-networks","title":"When Graph Neural Network Meets Causality: Opportunities, Methodologies and An Outlook","date":"2023-12-19","arxiv_id":"2312.12477","repositories_listed":1,"syntology":null},{"url":"/paper/user-modeling-in-the-era-of-large-language","title":"User Modeling in the Era of Large Language Models: Current Research and Future Directions","date":"2023-12-11","arxiv_id":"2312.11518","repositories_listed":1,"syntology":null},{"url":"/paper/fast-graph-condensation-with-structure-based","title":"Fast Graph Condensation with Structure-based Neural Tangent Kernel","date":"2023-10-17","arxiv_id":"2310.11046","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_unverified":1,"n_pointer_only":7}}],"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"}}