arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.09770cs.LG
收藏

聚类感知图异常检测

Cluster Aware Graph Anomaly Detection

University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);University of Chicago(芝加哥大学)

Lecheng Zheng, John R. Birge, Haiyue Wu, Yifang Zhang, Jingrui He

AI总结:

针对多视图图异常检测中的视图异质、无标签及高维挑战,本文提出 CARE,通过伪标签增强邻接矩阵并以相似性引导损失减轻偏差,在 Amazon 和 YelpChi 上显著优于基线。

摘要:

图异常检测已在多个领域受到广泛关注,尤其是在电商平台欺诈检测和网络安全内部威胁检测等关键应用中。通常,这些数据由多种类型组成(例如金融数据中的用户信息和交易记录),因此表现出视图异质性。然而,在大数据时代,视图的异质性和标签信息的缺乏给传统方法带来了巨大挑战。现有的无监督图异常检测方法往往受困于高维问题,依赖关于图结构的强假设,或无法处理复杂的多视图图。为应对这些挑战,我们提出了一种聚类感知的多视图图异常检测方法,称为 CARE。我们的方法通过使用伪标签(即软成员分配)增强图的邻接矩阵来捕获局部和全局节点亲和性,而无需对图作出任何强假设。为减轻伪标签可能带来的偏差,我们引入了一种相似性引导损失。理论上,我们证明了所提出的相似性引导损失是对比学习损失的一种变体,并通过与图谱聚类的联系,展示了该损失如何缓解伪标签引入的偏差。在多个数据集上的实验结果证明了我们所提框架的有效性和效率。具体而言,在 Amazon 数据集上,CARE 在 AUPRC 方面比第二名竞争者高出 39% 以上;在 YelpChi 数据集上,其在 AUROC 方面高出 18.7%。我们方法的代码可在 GitHub 链接获取:https://github.com/zhenglecheng/CARE-demo。

英文摘要:

Graph anomaly detection has gained significant attention across various domains, particularly in critical applications like fraud detection in e-commerce platforms and insider threat detection in cybersecurity. Usually, these data are composed of multiple types (e.g., user information and transaction records for financial data), thus exhibiting view heterogeneity. However, in the era of big data, the heterogeneity of views and the lack of label information pose substantial challenges to traditional approaches. Existing unsupervised graph anomaly detection methods often struggle with high-dimensionality issues, rely on strong assumptions about graph structures or fail to handle complex multi-view graphs. To address these challenges, we propose a cluster aware multi-view graph anomaly detection method, called CARE. Our approach captures both local and global node affinities by augmenting the graph's adjacency matrix with the pseudo-label (i.e., soft membership assignments) without any strong assumption about the graph. To mitigate potential biases from the pseudo-label, we introduce a similarity-guided loss. Theoretically, we show that the proposed similarity-guided loss is a variant of contrastive learning loss, and we present how this loss alleviates the bias introduced by pseudo-label with the connection to graph spectral clustering. Experimental results on several datasets demonstrate the effectiveness and efficiency of our proposed framework. Specifically, CARE outperforms the second-best competitors by more than 39% on the Amazon dataset with respect to AUPRC and 18.7% on the YelpChi dataset with respect to AUROC. The code of our method is available at the GitHub link: https://github.com/zhenglecheng/CARE-demo.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑