mlsanityData to 7 Oct 2026

Deep Graph Learning for Anomalous Citation Detection

arXiv 2202.11360 ↗First posted 23 Feb 2022cs.LG cs.DL cs.SIcited by 14

Not on the map. Why?

Abstract (arXiv)

Anomaly detection is one of the most active research areas in various critical domains, such as healthcare, fintech, and public security. However, little attention has been paid to scholarly data, i.e., anomaly detection in a citation network. Citation is considered as one of the most crucial metrics to evaluate the impact of scientific research, which may be gamed in multiple ways. Therefore, anomaly detection in citation networks is of significant importance to identify manipulation and inflation of citations. To address this open issue, we propose a novel deep graph learning model, namely GLAD (Graph Learning for Anomaly Detection), to identify anomalies in citation networks. GLAD incorporates text semantic mining to network representation learning by adding both node attributes and link attributes via graph neural networks. It exploits not only the relevance of citation contents but also hidden relationships between papers. Within the GLAD framework, we propose an algorithm called CPU (Citation PUrpose) to discover the purpose of citation based on citation texts. The performance of GLAD is validated through a simulated anomalous citation dataset. Experimental results demonstrate the effectiveness of GLAD on the anomalous citation detection task.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 30 of its 66 references that are in the map. First posted on arXiv 23 Feb 2022.

Builds on

30 of 66 references.

References · 30

  1. 2017Inductive Representation Learning on Large Graphscited by 6,284
  2. 2018How Powerful are Graph Neural Networks?cited by 4,355
  3. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  4. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  5. 2019SciBERT: A Pretrained Language Model for Scientific Textcited by 1,404
  6. 2018Deep Graph Infomaxcited by 1,101
  7. 2015Gated Graph Sequence Neural Networkscited by 792
  8. 2014Distributed Representations of Sentences and Documentscited by 677
  9. 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
  10. 2015LINE: Large-scale Information Network Embeddingcited by 582
  11. 2015Diffusion-Convolutional Neural Networkscited by 268
  12. 2020Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsterscited by 248
18 more
  1. 2020Data Augmentation for Graph Neural Networkscited by 200
  2. 2020GNNGuard: Defending Graph Neural Networks against Adversarial Attackscited by 195
  3. 2018GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphscited by 164
  4. 2020Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networkscited by 152
  5. 2021Graph Learning: A Surveycited by 140
  6. 2018NetGAN: Generating Graphs via Random Walkscited by 129
  7. 2020AM-GCN: Adaptive Multi-channel Graph Convolutional Networkscited by 121
  8. 2020GCAN: Graph-aware Co-Attention Networks for Explainable Fake News Detection on Social Mediacited by 108
  9. 2018Constrained Generation of Semantically Valid Graphs via Regularizing Variational Autoencoderscited by 74
  10. 2021Few-shot Network Anomaly Detection via Cross-network Meta-learningcited by 64
  11. 2019Graph-Revised Convolutional Networkcited by 58
  12. 2019Spam Review Detection with Graph Convolutional Networkscited by 57
  13. 2019Heterogeneous Deep Graph Infomaxcited by 42
  14. 2020Shifu2: A Network Representation Learning Based Model for Advisor-advisee Relationship Miningcited by 20
  15. 2020MODEL: Motif-based Deep Feature Learning for Link Predictioncited by 9
  16. 2021Learning the Implicit Semantic Representation on Graph-Structured Datacited by 9
  17. 2020Quantifying Success in Science: An Overviewcited by 1
  18. 2022The Gene of Scientific Successcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 2; 2024: 4; 2025: 5; 2026: 1.

14 papers.

Sort: