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: | , |
---|---|
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 |
id |
sg-smu-ink.sis_research-9458 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-94582024-01-04T09:49:39Z Truncated Affinity Maximization: One-class homophily modeling for graph anomaly detection QIAO, Hezhe PANG, Guansong 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 nodes. However, this anomaly-discriminative property is ignored by existing GAD methods that are typically built using a conventional anomaly detection objective, such as data reconstruction. In this work, we explore this property to introduce a novel unsupervised anomaly scoring measure for GAD – local node affinity – that assigns a larger anomaly score to nodes that are less affiliated with their neighbors, with the affinity defined as similarity on node attributes/representations. We further propose Truncated Affinity Maximization (TAM) that learns tailored node representations for our anomaly measure by maximizing the local affinity of nodes to their neighbors. Optimizing on the original graph structure can be biased by nonhomophily edges (i.e., edges connecting normal and abnormal nodes). Thus, TAM is instead optimized on truncated graphs where non-homophily edges are removed iteratively to mitigate this bias. The learned representations result in significantly stronger local affinity for normal nodes than abnormal nodes. Extensive empirical results on 10 real-world GAD datasets show that TAM substantially outperforms seven competing models, achieving over 10% increase in AUROC/AUPRC compared to the best contenders on challenging datasets. Our code is available at https://github.com/mala-lab/TAM-master/. 2023-12-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/8455 info:doi/10.48550/arXiv.2306.00006 https://ink.library.smu.edu.sg/context/sis_research/article/9458/viewcontent/9585_truncated_affinity_maximizatio.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University graph anomaly detection local node affinity Truncated Affinity Maximization Artificial Intelligence and Robotics |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
graph anomaly detection local node affinity Truncated Affinity Maximization Artificial Intelligence and Robotics |
spellingShingle |
graph anomaly detection local node affinity Truncated Affinity Maximization Artificial Intelligence and Robotics QIAO, Hezhe PANG, Guansong Truncated Affinity Maximization: One-class homophily modeling for graph anomaly detection |
description |
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 nodes. However, this anomaly-discriminative property is ignored by existing GAD methods that are typically built using a conventional anomaly detection objective, such as data reconstruction. In this work, we explore this property to introduce a novel unsupervised anomaly scoring measure for GAD – local node affinity – that assigns a larger anomaly score to nodes that are less affiliated with their neighbors, with the affinity defined as similarity on node attributes/representations. We further propose Truncated Affinity Maximization (TAM) that learns tailored node representations for our anomaly measure by maximizing the local affinity of nodes to their neighbors. Optimizing on the original graph structure can be biased by nonhomophily edges (i.e., edges connecting normal and abnormal nodes). Thus, TAM is instead optimized on truncated graphs where non-homophily edges are removed iteratively to mitigate this bias. The learned representations result in significantly stronger local affinity for normal nodes than abnormal nodes. Extensive empirical results on 10 real-world GAD datasets show that TAM substantially outperforms seven competing models, achieving over 10% increase in AUROC/AUPRC compared to the best contenders on challenging datasets. Our code is available at https://github.com/mala-lab/TAM-master/. |
format |
text |
author |
QIAO, Hezhe PANG, Guansong |
author_facet |
QIAO, Hezhe PANG, Guansong |
author_sort |
QIAO, Hezhe |
title |
Truncated Affinity Maximization: One-class homophily modeling for graph anomaly detection |
title_short |
Truncated Affinity Maximization: One-class homophily modeling for graph anomaly detection |
title_full |
Truncated Affinity Maximization: One-class homophily modeling for graph anomaly detection |
title_fullStr |
Truncated Affinity Maximization: One-class homophily modeling for graph anomaly detection |
title_full_unstemmed |
Truncated Affinity Maximization: One-class homophily modeling for graph anomaly detection |
title_sort |
truncated affinity maximization: one-class homophily modeling for graph anomaly detection |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2023 |
url |
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 |
_version_ |
1787590752702824448 |