Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &Amp; Data Mining 2019
DOI: 10.1145/3292500.3330946
|View full text |Cite
|
Sign up to set email alerts
|

Fast and Accurate Anomaly Detection in Dynamic Graphs with a Two-Pronged Approach

Abstract: Given a dynamic graph stream, how can we detect the sudden appearance of anomalous patterns, such as link spam, follower boosting, or denial of service attacks? Additionally, can we categorize the types of anomalies that occur in practice, and theoretically analyze the anomalous signs arising from each type? In this work, we propose AnomRank, an online algorithm for anomaly detection in dynamic graphs. AnomRank uses a twopronged approach defining two novel metrics for anomalousness. Each metric tracks the deri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
45
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
3
2

Relationship

1
9

Authors

Journals

citations
Cited by 70 publications
(53 citation statements)
references
References 29 publications
0
45
0
Order By: Relevance
“…NetWalk proposed clique embedding and reservoir sampling to quickly capture dynamically changing graph dimensions [55]. AnomRank classifies the types of anomalies into structural and node-relational anomalies and proposes a method to detect anomalies in two ways [56]. In addition, GAD approaches that incorporate graph clustering or community detection methods have been proposed for dynamic graphs [57,58].…”
Section: Graph-based Anomaly Detectionmentioning
confidence: 99%
“…NetWalk proposed clique embedding and reservoir sampling to quickly capture dynamically changing graph dimensions [55]. AnomRank classifies the types of anomalies into structural and node-relational anomalies and proposes a method to detect anomalies in two ways [56]. In addition, GAD approaches that incorporate graph clustering or community detection methods have been proposed for dynamic graphs [57,58].…”
Section: Graph-based Anomaly Detectionmentioning
confidence: 99%
“…(Jiang et al 2016) detects groups of nodes who form dense subgraphs in a temporally synchronized manner. • Anomalous event detection: ) detects sudden appearance of many unexpected edges, and (Yoon et al 2019) spots sudden changes in 1st and 2nd derivatives of PageRank. Anomaly detection in edge streams use as input a stream of edges over time.…”
Section: Related Workmentioning
confidence: 99%
“…The dataset may be characterized by one or more type of data properties. In order to give an insight into different data types used in anomaly detection tasks, there are a number of papers that summarize the main differences between the types and present anomaly detection approaches for them [45]- [54].…”
Section: Anomaly Ratiomentioning
confidence: 99%