用图神经网络和双向LSTM检测内鬼,效果优于现有方法。
Insider Threat Detection Using GCN and Bi-LSTM with Explicit and Implicit Graph Representations
- 构建显式与隐式图,捕捉用户行为的直接与潜在关系。
- 在r5.2数据集上达98.62% AUC、100%检出率、0.05%误报率。
- 适合关注安全监控、异常行为检测的研究者与工程师。
内鬼威胁检测(ITD)因可信用户行为隐蔽而极具挑战。本文提出一种后处理ITD框架,结合显式与隐式图表示及时间建模,捕捉复杂用户行为模式。显式图基于预定义组织规则构建,刻画用户活动间的直接关系;为缓解手工构造结构的噪声与局限,隐式图通过Gumbel-Softmax技巧从特征相似性中学习,揭示潜在行为关联。分别使用图卷积网络(GCN)处理两个图生成节点嵌入,经注意力机制融合并强化威胁相关特征后,输入双向长短期记忆网络(Bi-LSTM)以捕获行为的时间依赖性。当活动概率得分低于阈值时标记为异常。在CERT r5.2与r6.2数据集上的实验表明,该框架显著优于现有方法:r5.2上达到98.62% AUC、100%检测率、0.05%误报率;r6.2上实现88.48% AUC、80.15%检测率、0.15%误报率,验证了图结构与时间建模融合在鲁棒内鬼检测中的有效性。
原文摘要 · Abstract (English)
Insider threat detection (ITD) is challenging due to the subtle and concealed nature of malicious activities performed by trusted users. This paper proposes a post-hoc ITD framework that integrates explicit and implicit graph representations with temporal modelling to capture complex user behaviour patterns. An explicit graph is constructed using predefined organisational rules to model direct relationships among user activities. To mitigate noise and limitations in this hand-crafted structure, an implicit graph is learned from feature similarities using the Gumbel-Softmax trick, enabling the discovery of latent behavioural relationships. Separate Graph Convolutional Networks (GCNs) process the explicit and implicit graphs to generate node embeddings, which are concatenated and refined through an attention mechanism to emphasise threat-relevant features. The refined representations are then passed to a bidirectional Long Short-Term Memory (Bi-LSTM) network to capture temporal dependencies in user behaviour. Activities are flagged as anomalous when their probability scores fall below a predefined threshold. Extensive experiments on CERT r5.2 and r6.2 datasets demonstrate that the proposed framework outperforms state-of-the-art methods. On r5.2, the model achieves an AUC of 98.62, a detection rate of 100%, and a false positive rate of 0.05. On the more challenging r6.2 dataset, it attains an AUC of 88.48, a detection rate of 80.15%, and a false positive rate of 0.15, highlighting the effectiveness of combining graph-based and temporal representations for robust ITD.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。