{"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-mining/papers/2","list_of":"/task/graph-mining","task":"Graph Mining","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,174],"of":174,"counts":{"archive_papers_tagged":174,"with_a_code_link":86,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":174,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":5,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":5,"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"},"first_page":"/task/graph-mining","prev":"/task/graph-mining","next":null,"papers":[{"url":null,"slug":"learning-attributed-graphlets-predictive","title":"Learning Attributed Graphlets: Predictive Graph Mining by Graphlets with Trainable Attribute","date":"2024-02-10","arxiv_id":"2402.06932","repositories_listed":0,"syntology":null},{"url":null,"slug":"introducing-new-node-prediction-in-graph","title":"Introducing New Node Prediction in Graph Mining: Predicting All Links from Isolated Nodes with Graph Neural Networks","date":"2024-01-10","arxiv_id":"2401.05468","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-efficient-private-neighbor-generation","title":"Deep Efficient Private Neighbor Generation for Subgraph Federated Learning","date":"2024-01-09","arxiv_id":"2401.04336","repositories_listed":0,"syntology":null},{"url":null,"slug":"cost-aware-untargeted-poisoning-attack","title":"Cost Aware Untargeted Poisoning Attack against Graph Neural Networks,","date":"2023-12-12","arxiv_id":"2312.07158","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-heterogeneous-graph","title":"Variational Graph Autoencoder for Heterogeneous Information Networks with Missing and Inaccurate Attributes","date":"2023-11-14","arxiv_id":"2311.07929","repositories_listed":0,"syntology":null},{"url":null,"slug":"kg-mdl-mining-graph-patterns-in-knowledge","title":"KG-MDL: Mining Graph Patterns in Knowledge Graphs with the MDL Principle","date":"2023-09-22","arxiv_id":"2309.12908","repositories_listed":0,"syntology":null},{"url":null,"slug":"jaccard-constrained-dense-subgraph-discovery","title":"Jaccard-constrained dense subgraph discovery","date":"2023-08-30","arxiv_id":"2308.15936","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-insect-plant-interactions","title":"Analysis of Insect-Plant Interactions Affected by Mining Operations, A Graph Mining Approach","date":"2023-08-08","arxiv_id":"2308.04464","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-aware-language-model-pre-training-on-a","title":"Graph-Aware Language Model Pre-Training on a Large Graph Corpus Can Help Multiple Graph Applications","date":"2023-06-05","arxiv_id":"2306.02592","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-mining-for-cybersecurity-a-survey","title":"Graph Mining for Cybersecurity: A Survey","date":"2023-04-02","arxiv_id":"2304.00485","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-network-surrogates-of-fair-graph","title":"Graph Neural Network Surrogates of Fair Graph Filtering","date":"2023-03-14","arxiv_id":"2303.08157","repositories_listed":0,"syntology":null},{"url":null,"slug":"syngraphy-succinct-summarisation-of-large","title":"SynGraphy: Succinct Summarisation of Large Networks via Small Synthetic Representative Graphs","date":"2023-02-15","arxiv_id":"2302.07755","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-depth-graph-attention-networks","title":"Adaptive Depth Graph Attention Networks","date":"2023-01-16","arxiv_id":"2301.06265","repositories_listed":0,"syntology":null},{"url":null,"slug":"signed-directed-graph-contrastive-learning","title":"Signed Directed Graph Contrastive Learning with Laplacian Augmentation","date":"2023-01-12","arxiv_id":"2301.05163","repositories_listed":0,"syntology":null},{"url":null,"slug":"trajectory-flow-map-graph-based-approach-to","title":"Trajectory Flow Map: Graph-based Approach to Analysing Temporal Evolution of Aggregated Traffic Flows in Large-scale Urban Networks","date":"2022-12-06","arxiv_id":"2212.02927","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-covid-19-sequence-data-using","title":"Evaluating COVID-19 Sequence Data Using Nearest-Neighbors Based Network Model","date":"2022-11-19","arxiv_id":"2211.10546","repositories_listed":0,"syntology":null},{"url":null,"slug":"focusedcleaner-sanitizing-poisoned-graphs-for","title":"FocusedCleaner: Sanitizing Poisoned Graphs for Robust GNN-based Node Classification","date":"2022-10-25","arxiv_id":"2210.13815","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-the-smallest-or-largest-element-of-a","title":"Minimizing low-rank models of high-order tensors: Hardness, span, tight relaxation, and applications","date":"2022-10-16","arxiv_id":"2210.11413","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-graph-neural-networks-via-adaptive","title":"Boosting Graph Neural Networks via Adaptive Knowledge Distillation","date":"2022-10-12","arxiv_id":"2210.05920","repositories_listed":0,"syntology":null},{"url":null,"slug":"jurygcn-quantifying-jackknife-uncertainty-on","title":"JuryGCN: Quantifying Jackknife Uncertainty on Graph Convolutional Networks","date":"2022-10-12","arxiv_id":"2210.05959","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-graph-few-shot-learning","title":"Contrastive Graph Few-Shot Learning","date":"2022-09-30","arxiv_id":"2210.00084","repositories_listed":0,"syntology":null},{"url":null,"slug":"gsim-a-graph-neural-network-based-relevance","title":"GSim: A Graph Neural Network based Relevance Measure for Heterogeneous Graphs","date":"2022-08-12","arxiv_id":"2208.06144","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-manifold-learning-with-graph-mining","title":"Deep Manifold Learning with Graph Mining","date":"2022-07-18","arxiv_id":"2207.08377","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-node-embeddings-via-summary-graphs-a","title":"Learning node embeddings via summary graphs: a brief theoretical analysis","date":"2022-07-04","arxiv_id":"2207.01189","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-aware-dynamic-graph-embedding-for","title":"Time-aware Dynamic Graph Embedding for Asynchronous Structural Evolution","date":"2022-07-01","arxiv_id":"2207.00594","repositories_listed":0,"syntology":null},{"url":null,"slug":"transferable-graph-backdoor-attack","title":"Transferable Graph Backdoor Attack","date":"2022-06-21","arxiv_id":"2207.00425","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-matrix-completion-via-sylvester","title":"Geometric Matrix Completion via Sylvester Multi-Graph Neural Network","date":"2022-06-19","arxiv_id":"2206.09477","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bird-s-eye-tutorial-of-graph-attention","title":"A Bird's-Eye Tutorial of Graph Attention Architectures","date":"2022-06-06","arxiv_id":"2206.02849","repositories_listed":0,"syntology":null},{"url":null,"slug":"knn-embed-locally-smoothed-embedding-mixtures","title":"kNN-Embed: Locally Smoothed Embedding Mixtures For Multi-interest Candidate Retrieval","date":"2022-05-12","arxiv_id":"2205.06205","repositories_listed":0,"syntology":null},{"url":null,"slug":"functional2structural-cross-modality-brain","title":"Functional2Structural: Cross-Modality Brain Networks Representation Learning","date":"2022-05-06","arxiv_id":"2205.07854","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-learning-on-graphs-a-survey","title":"Few-Shot Learning on Graphs","date":"2022-03-17","arxiv_id":"2203.09308","repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-on-alzheimer-s-diseases-related","title":"Mining On Alzheimer's Diseases Related Knowledge Graph to Identity Potential AD-related Semantic Triples for Drug Repurposing","date":"2022-02-17","arxiv_id":"2202.08712","repositories_listed":0,"syntology":null},{"url":null,"slug":"recomed-a-knowledge-aware-recommender-system","title":"RecoMed: A Knowledge-Aware Recommender System for Hypertension Medications","date":"2022-01-09","arxiv_id":"2201.05461","repositories_listed":0,"syntology":null},{"url":null,"slug":"gophormer-ego-graph-transformer-for-node","title":"Gophormer: Ego-Graph Transformer for Node Classification","date":"2021-10-25","arxiv_id":"2110.13094","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-representation-learning-from-1","title":"Network Representation Learning: From Preprocessing, Feature Extraction to Node Embedding","date":"2021-10-14","arxiv_id":"2110.07582","repositories_listed":0,"syntology":null},{"url":null,"slug":"pi-gnn-towards-robust-semi-supervised-node","title":"PI-GNN: Towards Robust Semi-Supervised Node Classification against Noisy Labels","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discourse-analysis-of-covid-19-in-persian","title":"Discourse Analysis of Covid-19 in Persian Twitter Social Networks Using Graph Mining and Natural Language Processing","date":"2021-09-01","arxiv_id":"2109.00298","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-symbiosis-learning","title":"AKE-GNN: Effective Graph Learning with Adaptive Knowledge Exchange","date":"2021-06-10","arxiv_id":"2106.05455","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-densest-subgraph","title":"Differentially Private Densest Subgraph Detection","date":"2021-05-27","arxiv_id":"2105.13287","repositories_listed":0,"syntology":null},{"url":null,"slug":"motif-prediction-with-graph-neural-networks","title":"Motif Prediction with Graph Neural Networks","date":"2021-05-26","arxiv_id":"2106.00761","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-sanitation-with-application-to-node","title":"Graph Sanitation with Application to Node Classification","date":"2021-05-19","arxiv_id":"2105.09384","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphminesuite-enabling-high-performance-and","title":"GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra","date":"2021-03-05","arxiv_id":"2103.03653","repositories_listed":0,"syntology":null},{"url":null,"slug":"pspan-mining-frequent-subnets-of-petri-nets","title":"PSpan:Mining Frequent Subnets of Petri Nets","date":"2021-01-28","arxiv_id":"2101.11972","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-adr-mechanisms-with-knowledge","title":"Investigating ADR mechanisms with knowledge graph mining and explainable AI","date":"2020-12-16","arxiv_id":"2012.09077","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-much-progress-have-we-made-in-neural-1","title":"How much progress have we made in neural network training? A New Evaluation Protocol for Benchmarking Optimizers","date":"2020-10-19","arxiv_id":"2010.09889","repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-large-quasi-cliques-with-quality","title":"Mining Large Quasi-cliques with Quality Guarantees from Vertex Neighborhoods","date":"2020-08-18","arxiv_id":"2008.07996","repositories_listed":0,"syntology":null},{"url":null,"slug":"topicbert-a-transformer-transfer-learning","title":"TopicBERT: A Transformer transfer learning based memory-graph approach for multimodal streaming social media topic detection","date":"2020-08-16","arxiv_id":"2008.06877","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-dense-subgraph-discovery-via-blurred","title":"Online Dense Subgraph Discovery via Blurred-Graph Feedback","date":"2020-06-24","arxiv_id":"2006.13642","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-motif-profiles-and-topological","title":"Sequential Motif Profiles and Topological Plots for Offline Signature Verification","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hcore-init-neural-network-initialization","title":"Hcore-Init: Neural Network Initialization based on Graph Degeneracy","date":"2020-04-16","arxiv_id":"2004.07636","repositories_listed":0,"syntology":null},{"url":null,"slug":"evonet-a-neural-network-for-predicting-the-1","title":"EvoNet: A Neural Network for Predicting the Evolution of Dynamic Graphs","date":"2020-03-02","arxiv_id":"2003.00842","repositories_listed":0,"syntology":null},{"url":null,"slug":"customized-graph-embedding-tailoring-the","title":"Customized Graph Embedding: Tailoring Embedding Vectors to different Applications","date":"2019-11-21","arxiv_id":"1911.09454","repositories_listed":0,"syntology":null},{"url":null,"slug":"diagonal-graph-convolutional-networks-with","title":"Diagonal Graph Convolutional Networks with Adaptive Neighborhood Aggregation","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-illicit-accounts-in-large-scale-e","title":"Identifying Illicit Accounts in Large Scale E-payment Networks -- A Graph Representation Learning Approach","date":"2019-06-13","arxiv_id":"1906.05546","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-mining-meets-crowdsourcing-extracting","title":"Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation","date":"2019-05-17","arxiv_id":"1905.08088","repositories_listed":0,"syntology":null},{"url":null,"slug":"twittermancer-predicting-interactions-on","title":"TwitterMancer: Predicting Interactions on Twitter Accurately","date":"2019-04-25","arxiv_id":"1904.11119","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-bands-from-graphs","title":"Discovering Bands from Graphs","date":"2019-04-09","arxiv_id":"1904.04403","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-graph-based-individual-named-entity","title":"Scalable graph-based individual named entity identification","date":"2018-11-26","arxiv_id":"1811.10547","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-asp-based-approach-to-pattern-mining","title":"Hybrid ASP-based Approach to Pattern Mining","date":"2018-08-22","arxiv_id":"1808.07302","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-weight-prediction-with-node-embeddings","title":"Link Weight Prediction with Node Embeddings","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-graph-embedding-with-hub-detection","title":"Multi-view Graph Embedding with Hub Detection for Brain Network Analysis","date":"2017-09-12","arxiv_id":"1709.03659","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-fine-grained-relations-from-chinese","title":"Learning Fine-grained Relations from Chinese User Generated Categories","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-graph-mining","title":"Visual Graph Mining","date":"2017-08-13","arxiv_id":"1708.03921","repositories_listed":0,"syntology":null},{"url":null,"slug":"developing-a-concept-level-knowledge-base-for","title":"Developing a concept-level knowledge base for sentiment analysis in Singlish","date":"2017-07-14","arxiv_id":"1707.04408","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-representation-analysis-of-graph","title":"Knowledge Representation Analysis of Graph Mining","date":"2016-08-31","arxiv_id":"1608.08956","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-person-slot-filling-based-on","title":"Unsupervised Person Slot Filling based on Graph Mining","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relationship-queries-on-large-graphs-using","title":"Relationship Queries on Large graphs using Pregel","date":"2016-04-30","arxiv_id":"1605.00060","repositories_listed":0,"syntology":null},{"url":null,"slug":"m3-scaling-up-machine-learning-via-memory","title":"M3: Scaling Up Machine Learning via Memory Mapping","date":"2016-04-11","arxiv_id":"1604.03034","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-pattern-pruning-an-efficient-approach","title":"Safe Pattern Pruning: An Efficient Approach for Predictive Pattern Mining","date":"2016-02-15","arxiv_id":"1602.04548","repositories_listed":0,"syntology":null},{"url":null,"slug":"pgr-a-graph-repository-of-protein-3d","title":"PGR: A Graph Repository of Protein 3D-Structures","date":"2016-01-25","arxiv_id":"1604.00045","repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-and-or-graphs-for-graph-matching-and","title":"Mining And-Or Graphs for Graph Matching and Object Discovery","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-web-based-interactive-visual-graph","title":"A Web-based Interactive Visual Graph Analytics Platform","date":"2015-02-02","arxiv_id":"1502.00354","repositories_listed":0,"syntology":null},{"url":null,"slug":"attributed-graph-mining-and-matching-an","title":"Attributed Graph Mining and Matching: An Attempt to Define and Extract Soft Attributed Patterns","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fouille-de-graphes-sous-contraintes","title":"Fouille de graphes sous contraintes linguistiques pour l'exploration de grands textes (Graph Mining Under Linguistic Constraints to Explore Large Texts) [in French]","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"53d2c8c0c1d92c815a00a059741b6c1c6af8f6baa5c488d634b5c04d6a8c5940","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}