ProMvSD: Towards unsupervised knowledge graph anomaly detection via prior knowledge integration and multi-view semantic-driven estimation

计算机科学 异常检测 图形 知识图 估计 人工智能 情报检索 数据挖掘 机器学习 理论计算机科学 管理 经济
作者
Yunfeng Zhou,Cui Zhu,Wenjun Zhu
出处
期刊:Information Processing and Management [Elsevier BV]
卷期号:61 (4): 103705-103705 被引量:8
标识
DOI:10.1016/j.ipm.2024.103705
摘要

Knowledge graphs (KGs) have found extensive applications within intelligent systems, such as information retrieval. Much of the research has predominantly focused on completing missing knowledge, with little consideration given to examining errors. Unfortunately, during customizing KGs, diverse unpredictable errors are virtually unavoidable to be introduced, and these anomalies significantly impact the performance of applications. Detecting erroneous knowledge presents a formidable challenge due to the costly acquisition of ground-truth labels. In this work, we develop an unsupervised anomaly detection framework named ProMvSD, aiming to adapt KGs of varying scales via serialization components. To overcome the insufficient contextual information provided by the topological structure, we introduce the large language model as a reasoner to extract prior knowledge from extensive pre-trained textual data, thereby enhancing the understanding of KGs. Anomalous triple may result in a larger semantic gap between the head and tail neighborhoods. To uncover latent anomalies effectively, we propose a multi-view semantic-driven model (MvSD) based on the assumptions of self-consistency and information stability. MvSD jointly estimates the suspiciousness of triples from three hyperviews: node-view semantic contradiction, triple-view semantic gap, and pathway-view semantic gap. Extensive experiments on three English benchmark KGs and a Chinese medical KG demonstrate that, for the top 1% of the most suspicious triples, we can detect real anomalies with at most 99.9% accuracy. Furthermore, ProMvSD significantly outperforms state-of-the-art representation learning baselines, achieving a 29.2% improvement in detecting all anomalies.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
xuebao521完成签到,获得积分20
2秒前
张佳宁发布了新的文献求助10
2秒前
落后妖妖完成签到,获得积分10
2秒前
Hello应助海海海星派大星采纳,获得10
3秒前
Aerin发布了新的文献求助10
4秒前
4秒前
5秒前
ZY关注了科研通微信公众号
5秒前
科研通AI6.2应助Huang采纳,获得10
6秒前
kim完成签到,获得积分10
6秒前
JamesPei应助ShuoweiWang采纳,获得10
6秒前
yzy应助搞怪班采纳,获得10
7秒前
迷路沁完成签到 ,获得积分10
8秒前
8秒前
9秒前
朝天椒发布了新的文献求助10
10秒前
无所屌谓发布了新的文献求助30
11秒前
刘强发布了新的文献求助10
11秒前
11秒前
12秒前
13秒前
14秒前
甜菜图书馆完成签到,获得积分10
14秒前
大老师发布了新的文献求助10
14秒前
14秒前
15秒前
17秒前
勤奋的白萱完成签到,获得积分10
18秒前
我想进步完成签到 ,获得积分10
18秒前
烟花弥漫完成签到,获得积分10
18秒前
王大白发布了新的文献求助10
19秒前
phy发布了新的文献求助10
19秒前
Orange应助刘强采纳,获得10
19秒前
无所屌谓完成签到,获得积分10
19秒前
19秒前
科研通AI6.3应助独孤蚕采纳,获得10
19秒前
H哈哈完成签到,获得积分10
21秒前
璐璐发布了新的文献求助10
21秒前
ZY发布了新的文献求助50
21秒前
大个应助沉沉叠叠采纳,获得10
21秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Pediatric Dermoscopy Trichoscopy & Onychoscopy 2030
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
Handbuch Trainingswissenschaft – Trainingslehre 500
Additive Manufacturing Design and Applications (ASM Handbook, Volume 24A) 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7576852
求助须知:如何正确求助?哪些是违规求助? 9156487
关于积分的说明 19588700
捐赠科研通 7160673
什么是DOI,文献DOI怎么找? 3265177
关于科研通互助平台的介绍 2430231
邀请新用户注册赠送积分活动 2255758