Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

GIN-SD: Source Detection in Graphs with Incomplete Nodes via Positional Encoding and Attentive Fusion (2403.00014v1)

Published 27 Feb 2024 in cs.SI, cs.AI, and cs.LG

Abstract: Source detection in graphs has demonstrated robust efficacy in the domain of rumor source identification. Although recent solutions have enhanced performance by leveraging deep neural networks, they often require complete user data. In this paper, we address a more challenging task, rumor source detection with incomplete user data, and propose a novel framework, i.e., Source Detection in Graphs with Incomplete Nodes via Positional Encoding and Attentive Fusion (GIN-SD), to tackle this challenge. Specifically, our approach utilizes a positional embedding module to distinguish nodes that are incomplete and employs a self-attention mechanism to focus on nodes with greater information transmission capacity. To mitigate the prediction bias caused by the significant disparity between the numbers of source and non-source nodes, we also introduce a class-balancing mechanism. Extensive experiments validate the effectiveness of GIN-SD and its superiority to state-of-the-art methods.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (37)
  1. EPA: Exoneration and prominence based age for infection source identification. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 891–900.
  2. Velocity and hierarchical spread of epidemic outbreaks in scale-free networks. Physical Review Letters, 92(17): 178701.
  3. Followback Clusters, Satellite Audiences, and Bridge Nodes: Coengagement Networks for the 2020 US Election. In Proceedings of the International AAAI Conference on Web and Social Media, volume 17, 59–71.
  4. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6): 1373–1396.
  5. Rumor detection on social media with bi-directional graph convolutional networks. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, 549–556.
  6. Path-based multi-sources localization in multiplex networks. Chaos, Solitons & Fractals, 159: 112139.
  7. Wavefront-Based Multiple Rumor Sources Identification by Multi-Task Learning. IEEE Transactions on Emerging Topics in Computational Intelligence, 6(5): 1068–1078.
  8. Multiple rumor source detection with graph convolutional networks. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 569–578.
  9. Community-structured evolutionary game for privacy protection in social networks. IEEE Transactions on Information Forensics and Security, 13(3): 574–589.
  10. Benchmarking graph neural networks. arXiv preprint arXiv:2003.00982.
  11. A novel representation learning for dynamic graphs based on graph convolutional networks. IEEE Transactions on Cybernetics, 53(6): 3599–3612.
  12. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12): 7821–7826.
  13. Community structure in jazz. Advances in Complex Systems, 6(04): 565–573.
  14. Transformer in transformer. Advances in Neural Information Processing Systems, 34: 15908–15919.
  15. Semi-supervised classification with graph convolutional networks. In 5th International Conference on Learning Representations, ICLR.
  16. The enron corpus: A new dataset for email classification research. In Machine Learning: ECML 2004: 15th European Conference on Machine Learning, Pisa, Italy, September 20-24, 2004. Proceedings 15, 217–226. Springer.
  17. Learning to discover social circles in ego networks. Advances in Neural Information Processing Systems, 25.
  18. Propagation source identification of infectious diseases with graph convolutional networks. Journal of Biomedical Informatics, 116: 103720.
  19. Source localization of graph diffusion via variational autoencoders for graph inverse problems. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 1010–1020.
  20. Epidemic threshold for the susceptible-infectious-susceptible model on random networks. Physical Review Letters, 104(25): 258701.
  21. Locating the source of diffusion in large-scale networks. Physical Review Letters, 109(6): 068702.
  22. Spotting culprits in epidemics: How many and which ones? In 2012 IEEE 12th International Conference on Data Mining, 11–20. IEEE.
  23. Multi-scale attributed node embedding. Journal of Complex Networks, 9(2): cnab014.
  24. Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models. In Proceedings of the 29th ACM International Conference on Information and Knowledge Management, 1325–1334.
  25. The graph neural network model. IEEE Transactions on Neural Networks, 20(1): 61–80.
  26. Finding patient zero: Learning contagion source with graph neural networks. arXiv preprint arXiv:2006.11913.
  27. Rumors in a network: Who’s the culprit? IEEE Transactions on Information Theory, 57(8): 5163–5181.
  28. On the equivalence between positional node embeddings and structural graph representations. In International Conference on Learning Representations.
  29. Graph attention networks. In International Conference on Learning Representations.
  30. An Invertible Graph Diffusion Neural Network for Source Localization. In Proceedings of the ACM Web Conference 2022, 1058–1069.
  31. Multiple source detection without knowing the underlying propagation model. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 31.
  32. Online influence maximization under independent cascade model with semi-bandit feedback. Advances in Neural Information Processing Systems, 30.
  33. Defining and evaluating network communities based on ground-truth. In Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, 1–8.
  34. Position-aware graph neural networks. In International Conference on Machine Learning, 7134–7143. PMLR.
  35. Generalized Jordan center: A source localization heuristic for noisy and incomplete observations. In 2019 IEEE Data Science Workshop (DSW), 243–247. IEEE.
  36. Catch’em all: Locating multiple diffusion sources in networks with partial observations. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 31.
  37. Locating multi-sources in social networks with a low infection rate. IEEE Transactions on Network Science and Engineering, 9(3): 1853–1865.
Citations (10)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now