2022
DOI: 10.1016/j.patrec.2022.02.001
|View full text |Cite
|
Sign up to set email alerts
|

HashWalk: An efficient node classification method based on clique-compressed graph embedding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…Graphs can abstractly describe the relationships between objects and have received much attention from researchers [1,2]. Graph neural networks (GNNs) combine node features and graph structure with learning better representations and have achieved signifcant performance in many tasks, e.g., graph classifcation [3], node classifcation [4], and link prediction [5,6]. However, recent studies [7][8][9] have shown that GNNs are vulnerable to adversarial attacks.…”
Section: Introductionmentioning
confidence: 99%
“…Graphs can abstractly describe the relationships between objects and have received much attention from researchers [1,2]. Graph neural networks (GNNs) combine node features and graph structure with learning better representations and have achieved signifcant performance in many tasks, e.g., graph classifcation [3], node classifcation [4], and link prediction [5,6]. However, recent studies [7][8][9] have shown that GNNs are vulnerable to adversarial attacks.…”
Section: Introductionmentioning
confidence: 99%