2020
DOI: 10.1609/aaai.v34i01.5482
|View full text |Cite
|
Sign up to set email alerts
|

MixedAD: A Scalable Algorithm for Detecting Mixed Anomalies in Attributed Graphs

Abstract: Attributed graphs, where nodes are associated with a rich set of attributes, have been widely used in various domains. Among all the nodes, those with patterns that deviate significantly from others are of particular interest. There are mainly two challenges for anomaly detection. For one thing, we often encounter large graphs with lots of nodes and attributes in the real-life scenario, which requires a scalable algorithm. For another, there are anomalies w.r.t. both the structure and attribute in a mixed mann… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 26 publications
0
2
0
Order By: Relevance
“…Further, ANOMALOUS [18] jointly considers CUR decomposition and residual analysis for anomaly detection on attributed networks. Zhu et al [49] present a joint learning model to detect mixed anomaly by core initiating and expanding. Despite their success on low-dimensional attributed network data, these methods cannot work well when the networks have complex structures and high-dimensional attributes due to the limitation of their shallow mechanisms.…”
Section: B Anomaly Detection On Attributed Networkmentioning
confidence: 99%
“…Further, ANOMALOUS [18] jointly considers CUR decomposition and residual analysis for anomaly detection on attributed networks. Zhu et al [49] present a joint learning model to detect mixed anomaly by core initiating and expanding. Despite their success on low-dimensional attributed network data, these methods cannot work well when the networks have complex structures and high-dimensional attributes due to the limitation of their shallow mechanisms.…”
Section: B Anomaly Detection On Attributed Networkmentioning
confidence: 99%
“…When detecting anomalous nodes in static graphs, the differences between anomalies and regular nodes are mainly drawn from the graph structural information and nodes/edges' attributes. Given the prior knowledge (i.e., community structure, attributes) about a static graph, anomalous nodes can be further categorized into the following three types [39], [69], [70]:…”
Section: Anomalous Node Detection (Anos Nd)mentioning
confidence: 99%