Truncated Affinity Maximization: One-class homophily modeling for graph anomaly detection
We reveal a one-class homophily phenomenon, which is one prevalent property we find empirically in real-world graph anomaly detection (GAD) datasets, i.e., normal nodes tend to have strong connection/affinity with each other, while the homophily in abnormal nodes is significantly weaker than normal...
Saved in:
Main Authors: | QIAO, Hezhe, PANG, Guansong |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2023
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8455 https://ink.library.smu.edu.sg/context/sis_research/article/9458/viewcontent/9585_truncated_affinity_maximizatio.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Generative semi-supervised graph anomaly detection
by: QIAO, Hezhe, et al.
Published: (2024) -
Dense neighborhoods on affinity graph
by: Liu, H., et al.
Published: (2013) -
Detecting Anomalies in Bipartite Graphs with Mutual Dependency Principles
by: DAI, Hanbo, et al.
Published: (2012) -
Graph-level anomaly detection via hierarchical memory networks
by: NIU, Chaoxi, et al.
Published: (2023) -
Affine Systems in L2(ℝd) II: Dual Systems
by: Ron, A., et al.
Published: (2014)