.png){kind=icon}
返回
Detecting Anomalous Graphs in Labeled Multi-Graph Databases
.png){kind=icon}
OA
AI
DOI：10.1145/3533770.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Within a large database G containing graphs with labeled nodes and directed, multi-edges; how can we detect the anomalous graphs? Most existing work are designed for plain (unlabeled) and/or simple (unweighted) graphs. We introduce CODEtect, the first approach that addresses the anomaly detection task for graph databases with such complex nature. To this end, it identifies a small representative set S of structural patterns (i.e., node-labeled network motifs) that losslessly compress database G as concisely as possible. Graphs that do not compress well are flagged as anomalous. CODEtect exhibits two novel building blocks: (i) a motif-based lossless graph encoding scheme, and (ii) fast memory-efficient search algorithms for S. We show the effectiveness of CODEtect on transaction graph databases from three different corporations and statistically similar synthetic datasets, where existing baselines adjusted for the task fall behind significantly, across different types of anomalies and performance metrics.
Keyword:
Graph anomaly detection
graph encoding
graph motifs
期刊
IF:
4.8
论文数:
1.3K
被引数:
4.4K
机构
引用论文
分享收藏Characteristic study of polycyclic aromatic hydrocarbons for fine and coarse particulates at Pastureland near Industrial Park sampling site of central Taiwan.png)
Chemosphere
ChemosphereIF0
PREAI
分享收藏
查看更多内容