A Flexible Attentive Temporal Graph Networks for Anomaly Detection in Dynamic Networks

被引:8
作者
Zhu, Dali [1 ,2 ]
Ma, Yuchen [1 ,2 ]
Liu, Yinlong [1 ,2 ]
机构
[1] Chinese Acad Sci, Inst Informat Engn, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Sch Cyber Secur, Beijing, Peoples R China
来源
2020 IEEE 19TH INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM 2020) | 2020年
关键词
Anomaly Detection; Dynamic Networks; Graph Embedding; Graph Convolutional Network;
D O I
10.1109/TrustCom50675.2020.00117
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Anomaly Detection in Dynamic Networks plays a critical role in various real-world applications such as cybersecurity, e-commerce, and social media. Recent approaches based on graph neural networks have achieved fruitful results in static networks, and most of the researches focus on learning node embeddings to represent the large-scale complex networks, thereby facilitating downstream anomaly detection task. However, these methods require the whole network to extract intrinsic properties, so they are sensitive to the frequent changes of nodes and incapable of capturing the dynamism as real world networks evolve over time. In this paper, we propose a novel framework DynAD for anomalous edge detection on time-evolving networks, which performs adaptive parameter learning in an end-to-end manner. In particular, DynAD first extracts fixed-size node embedding from each snapshot with temporal graph convolution and pooling operations. Then, it captures the temporal information of the graph sequence using Gated recurrent units (GRU) for anomaly detection, where an attention mechanism is employed to highlight the differences between the dynamic patterns. Experimental results on three real-world datasets illustrate that DynAD significantly outperforms the state-of-the-art baseline methods in anomaly detection.
引用
收藏
页码:871 / 876
页数:6
相关论文
共 30 条
  • [1] Aggarwal CC, 2011, PROC INT CONF DATA, P399, DOI 10.1109/ICDE.2011.5767885
  • [2] Graph based anomaly detection and description: a survey
    Akoglu, Leman
    Tong, Hanghang
    Koutra, Danai
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2015, 29 (03) : 626 - 688
  • [3] [Anonymous], 2007, ACM T WEB, DOI [DOI 10.1145/1232722.1232727, 10.1145/1217299.1217301]
  • [4] Battaglia Peter W, 2018, Relational inductive biases, deep learning, and graph networks, DOI DOI 10.48550/ARXIV.1806.01261
  • [5] Cao SS, 2016, AAAI CONF ARTIF INTE, P1145
  • [6] Chalapathy R., 2019, ARXIV190103407
  • [7] Chung J., 2014, ARXIV14123555, DOI DOI 10.48550/ARXIV.1412.3555
  • [8] A Survey on Network Embedding
    Cui, Peng
    Wang, Xiao
    Pei, Jian
    Zhu, Wenwu
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2019, 31 (05) : 833 - 852
  • [9] De Choudhury Munmun, 2009, 2009 International Conference on Computational Science and Engineering (CSE), P151, DOI 10.1109/CSE.2009.439
  • [10] SEDANSPOT: Detecting Anomalies in Edge Streams
    Eswaran, Dhivya
    Faloutsos, Christos
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2018, : 953 - 958