Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining 2022
DOI: 10.1145/3534678.3539389
|View full text |Cite
|
Sign up to set email alerts
|

Subset Node Anomaly Tracking over Large Dynamic Graphs

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 34 publications
0
4
0
Order By: Relevance
“…These algorithms address time-stamped nodes as queries, which can be represented by their set of incident edges or by the indicator function of such set. DYNANOM [6] uses a short term context to monitor the evolution of PageRank scores. It labels a query as abnormal if its PageRank score drastically changed.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…These algorithms address time-stamped nodes as queries, which can be represented by their set of incident edges or by the indicator function of such set. DYNANOM [6] uses a short term context to monitor the evolution of PageRank scores. It labels a query as abnormal if its PageRank score drastically changed.…”
Section: Related Workmentioning
confidence: 99%
“…Two for edge anomalies: MIDAS [1] and F-FADE [2]. Two for node anomalies: DynAnom [6] and F-FADE-N [2], the variant of F-FADE proposed by their authors to address node anomalies. Two for graph anomalies: AnomRank [8] and LAD [10].…”
Section: Numerical Experimentsmentioning
confidence: 99%
See 2 more Smart Citations