Generative semi-supervised graph anomaly detection
This work considers a practical semi-supervised graph anomaly detection (GAD) scenario, where part of the nodes in a graph are known to be normal, contrasting to the extensively explored unsupervised setting with a fully unlabeled graph. We reveal that having access to the normal nodes, even just a...
Saved in:
Main Authors: | QIAO, Hezhe, WEN, Qingsong, LI, Xiaoli, LIM, Ee-peng, PANG, Guansong |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2024
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9763 https://ink.library.smu.edu.sg/context/sis_research/article/10763/viewcontent/10275_Generative_Semi_supervis__1_.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Truncated Affinity Maximization: One-class homophily modeling for graph anomaly detection
by: QIAO, Hezhe, et al.
Published: (2023) -
Detecting Anomalies in Bipartite Graphs with Mutual Dependency Principles
by: DAI, Hanbo, et al.
Published: (2012) -
RoSAS: Deep semi-supervised anomaly detection with contamination-resilient continuous supervision
by: XU, Hongzuo, et al.
Published: (2023) -
Anomaly heterogeneity learning for open-set supervised anomaly detection
by: ZHU, Jiawen, et al.
Published: (2024) -
Graph-level anomaly detection via hierarchical memory networks
by: NIU, Chaoxi, et al.
Published: (2023)