Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 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

HC-GLAD: Dual Hyperbolic Contrastive Learning for Unsupervised Graph-Level Anomaly Detection (2407.02057v2)

Published 2 Jul 2024 in cs.LG and cs.SI

Abstract: Unsupervised graph-level anomaly detection (UGAD) has garnered increasing attention in recent years due to its significance. Most existing methods that rely on traditional GNNs mainly consider pairwise relationships between first-order neighbors, which is insufficient to capture the complex high-order dependencies often associated with anomalies. This limitation underscores the necessity of exploring high-order node interactions in UGAD. In addition, most previous works ignore the underlying properties (e.g., hierarchy and power-law structure) which are common in real-world graph datasets and therefore are indispensable factors in the UGAD task. In this paper, we propose a novel Dual Hyperbolic Contrastive Learning for Unsupervised Graph-Level Anomaly Detection (HC-GLAD in short). To exploit high-order node group information, we construct hypergraphs based on pre-designed gold motifs and subsequently perform hypergraph convolution. Furthermore, to preserve the hierarchy of real-world graphs, we introduce hyperbolic geometry into this field and conduct both graph and hypergraph embedding learning in hyperbolic space with the hyperboloid model. To the best of our knowledge, this is the first work to simultaneously apply hypergraph with node group information and hyperbolic geometry in this field. Extensive experiments on 13 real-world datasets of different fields demonstrate the superiority of HC-GLAD on the UGAD task. The code is available at https://github.com/Yali-F/HC-GLAD.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (64)
  1. Deep graph-level anomaly detection by glocal knowledge distillation. In Proceedings of the fifteenth ACM international conference on web search and data mining, pages 704–714, 2022.
  2. Deep graph level anomaly detection with contrastive learning. Scientific Reports, 12(1):19867, 2022.
  3. Towards self-interpretable graph-level anomaly detection. Advances in Neural Information Processing Systems, 36, 2024.
  4. Good-d: On unsupervised graph out-of-distribution detection. In Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, pages 339–347, 2023.
  5. Tuaf: Triple-unit-based graph-level anomaly detection with adaptive fusion readout. In International Conference on Database Systems for Advanced Applications, pages 415–430. Springer, 2023.
  6. Cvtgad: Simplified transformer with cross-view attention for unsupervised graph-level anomaly detection. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pages 185–200. Springer, 2023.
  7. Graph-level anomaly detection via hierarchical memory networks. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pages 201–218. Springer, 2023.
  8. Reducing the rank in relational factorization models by including observable patterns. Advances in Neural Information Processing Systems, 27, 2014.
  9. Hierarchical organization in complex networks. Physical review E, 67(2):026112, 2003.
  10. Latent variable modelling with hyperbolic normalizing flows. In International Conference on Machine Learning, pages 1045–1055. PMLR, 2020.
  11. Poincaré embeddings for learning hierarchical representations. Advances in neural information processing systems, 30, 2017.
  12. Hyperbolic graph learning for social recommendation. IEEE Transactions on Knowledge and Data Engineering, 2023.
  13. Rik Sarkar. Low distortion delaunay embedding of trees in hyperbolic plane. In International symposium on graph drawing, pages 355–366. Springer, 2011.
  14. Hyperbolic heterogeneous information network embedding. In Proceedings of the AAAI conference on artificial intelligence, volume 33, pages 5337–5344, 2019.
  15. A comprehensive survey on graph anomaly detection with deep learning. IEEE Transactions on Knowledge and Data Engineering, 35(12):12012–12038, 2021.
  16. On using classification datasets to evaluate graph outlier detection: Peculiar observations and new insights. Big Data, 11(3):151–180, 2023.
  17. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018.
  18. Raising the bar in graph-level anomaly detection. In International Joint Conference on Artificial Intelligence, 2022.
  19. Hyperbolic graph neural networks: A review of methods and applications. arXiv preprint arXiv:2202.13852, 2022.
  20. Hicf: Hyperbolic informative collaborative filtering. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 2212–2221, 2022.
  21. Hyperbolic graph neural networks. Advances in neural information processing systems, 32, 2019.
  22. Hyperbolic graph convolutional neural networks. Advances in neural information processing systems, 32, 2019.
  23. Constant curvature graph convolutional networks. In International conference on machine learning, pages 486–496. PMLR, 2020.
  24. Hyperbolic graph attention network. IEEE Transactions on Big Data, 8(6):1690–1701, 2021.
  25. Lorentzian graph convolutional networks. In Proceedings of the web conference 2021, pages 1249–1261, 2021.
  26. Hrcf: Enhancing collaborative filtering via hyperbolic geometric regularization. In Proceedings of the ACM Web Conference 2022, pages 2462–2471, 2022.
  27. Hyperbolic geometric graph representation learning for hierarchy-imbalance node classification. In Proceedings of the ACM Web Conference 2023, pages 460–468, 2023.
  28. Hypergraph learning: Methods and practices. IEEE transactions on pattern analysis and machine intelligence, 44(5):2548–2566, 2022.
  29. A survey on hypergraph representation learning. ACM Computing Surveys, 56(1):1–38, 2023.
  30. Hypergraph neural networks. In Proceedings of the AAAI conference on artificial intelligence, volume 33, pages 3558–3565, 2019.
  31. Hypergcn: A new method for training graph convolutional networks on hypergraphs. Advances in neural information processing systems, 32, 2019.
  32. Hgnn+: General hypergraph neural networks. IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(3):3181–3199, 2022.
  33. Dual channel hypergraph collaborative filtering. In Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pages 2020–2029, 2020.
  34. Double-scale self-supervised hypergraph learning for group recommendation. In Proceedings of the 30th ACM international conference on information & knowledge management, pages 2557–2567, 2021.
  35. Dh-hgcn: dual homogeneity hypergraph convolutional network for multiple social recommendations. In Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval, pages 2190–2194, 2022.
  36. Hypergraph contrastive collaborative filtering. In Proceedings of the 45th International ACM SIGIR conference on research and development in information retrieval, pages 70–79, 2022.
  37. Federated learning on non-iid graphs via structural knowledge sharing. In Proceedings of the AAAI conference on artificial intelligence, volume 37, pages 9953–9961, 2023.
  38. Hypergraph motifs: concepts, algorithms, and discoveries. arXiv preprint arXiv:2003.01853, 2020.
  39. Self-supervised multi-channel hypergraph convolutional network for social recommendation. In Proceedings of the web conference 2021, pages 413–424, 2021.
  40. Learning continuous hierarchies in the lorentz model of hyperbolic geometry. In International conference on machine learning, pages 3779–3788. PMLR, 2018.
  41. Hgcf: Hyperbolic graph convolution networks for collaborative filtering. In Proceedings of the Web Conference 2021, pages 593–601, 2021.
  42. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2016.
  43. Hypergraph convolution and hypergraph attention. Pattern Recognition, 110:107637, 2021.
  44. Tudataset: A collection of benchmark datasets for learning with graphs. arXiv preprint arXiv:2007.08663, 2020.
  45. L Zhao and L Akoglu. On using classification datasets to evaluate graph outlier detection: Peculiar observations and new insights. Big Data, 11(3):151–180, 2021.
  46. Weisfeiler-lehman graph kernels. Journal of Machine Learning Research, 12(9), 2011.
  47. Propagation kernels: efficient graph kernels from propagated information. Machine Learning, 102:209–245, 2016.
  48. One-class svms for document classification. Journal of machine Learning research, 2(Dec):139–154, 2001.
  49. Isolation forest. In 2008 eighth ieee international conference on data mining, pages 413–422. IEEE, 2008.
  50. Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization. In International Conference on Learning Representations, 2020.
  51. Graph contrastive learning with augmentations. Advances in neural information processing systems, 33:5812–5823, 2020.
  52. Silvere Bonnabel. Stochastic gradient descent on riemannian manifolds. IEEE Transactions on Automatic Control, 58(9):2217–2229, 2013.
  53. Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems, 32, 2019.
  54. Laurens Van der Maaten and Geoffrey Hinton. Visualizing data using t-sne. Journal of machine learning research, 9(11), 2008.
  55. Self-supervised learning on graphs: Contrastive, generative, or predictive. IEEE Transactions on Knowledge and Data Engineering, 35(4):4216–4235, 2021.
  56. Graph self-supervised learning: A survey. IEEE transactions on knowledge and data engineering, 35(6):5879–5900, 2022.
  57. Gcc: Graph contrastive coding for graph neural network pre-training. In Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pages 1150–1160, 2020.
  58. Deep graph infomax. ICLR (Poster), 2(3):4, 2019.
  59. Graph contrastive learning with adaptive augmentation. In Proceedings of the Web Conference 2021, pages 2069–2080, 2021.
  60. Beyond smoothing: Unsupervised graph representation learning with edge heterophily discriminating. In Proceedings of the AAAI conference on artificial intelligence, 2023.
  61. M. Gromov. Hyperbolic Groups, pages 75–263. Springer New York, New York, NY, 1987.
  62. Poincare glove: Hyperbolic word embeddings. In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net, 2019.
  63. Topological implications of negative curvature for biological and social networks. Phys. Rev. E, 89:032811, Mar 2014.
  64. Hyperbolic temporal network embedding. IEEE Trans. Knowl. Data Eng., 35(11):11489–11502, 2023.

Summary

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

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