2021
DOI: 10.1007/978-3-030-86362-3_9
|View full text |Cite
|
Sign up to set email alerts
|

CmaGraph: A TriBlocks Anomaly Detection Method in Dynamic Graph Using Evolutionary Community Representation Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 15 publications
0
1
0
Order By: Relevance
“…For similar motivations, Mu et al presented a novel approach to discovering and alleviating the potential spurious correlations by introducing two counterfactual generators and a recommender (Mu et al 2022). Apart from these, there have also been many counterfactual inference-based research on model interpretability (Lin, Lan, and Li 2021;Tan et al 2022;Abid, Yuksekgonul, and Zou 2022). However, we have not seen related research on counterfactual inference-based MIL methods tailored for instance prediction.…”
Section: Counterfactual Inferencementioning
confidence: 99%
“…For similar motivations, Mu et al presented a novel approach to discovering and alleviating the potential spurious correlations by introducing two counterfactual generators and a recommender (Mu et al 2022). Apart from these, there have also been many counterfactual inference-based research on model interpretability (Lin, Lan, and Li 2021;Tan et al 2022;Abid, Yuksekgonul, and Zou 2022). However, we have not seen related research on counterfactual inference-based MIL methods tailored for instance prediction.…”
Section: Counterfactual Inferencementioning
confidence: 99%
“…Alternatively, we can adapt advanced model-agnostic explanation methods (Yuan et al 2020) proposed for GNNs (on homogeneous graphs) to HGNs. These methods attribute model predictions to graph objects, such as nodes (Vu and Thai 2020), edges (Ying et al 2019;Luo et al 2020;Schlichtkrull, De Cao, and Titov 2020;Wang et al 2021b;Lin, Lan, and Li 2021) and subgraphs (Yuan et al 2021). Their goal is to learn or search for optimal graph objects that maximize mutual information with the predictions.…”
Section: Introductionmentioning
confidence: 99%