2022
DOI: 10.1109/tkde.2022.3146270
|View full text |Cite
|
Sign up to set email alerts
|

Graph Representation Learning Beyond Node and Homophily

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…Many real-world graphs, such as transaction networks [45], exhibit heterophily. Recent studies have shown that GNNs do not perform well on heterophilic graphs [46][47][48][49]. This is because GNNs are typically designed to learn from homophilic graphs, where linked nodes have similar features and class labels.…”
Section: Heterophily-based Gnnsmentioning
confidence: 99%
“…Many real-world graphs, such as transaction networks [45], exhibit heterophily. Recent studies have shown that GNNs do not perform well on heterophilic graphs [46][47][48][49]. This is because GNNs are typically designed to learn from homophilic graphs, where linked nodes have similar features and class labels.…”
Section: Heterophily-based Gnnsmentioning
confidence: 99%