Heterogeneous graphs (HGs) are widely used to model complex relational data in domains such as traffic networks, biology, and recommendation systems. While heterogeneous graph neural networks (HGNNs) demonstrate strong performance on homophilous benchmarks, they struggle to generalize to heterophilous HGs where connect...
Si-Qing Li, Yong-Min Shin, Won-Yong Shin et al.· Proceedings of the 35th ACM...· 0 citations
The theoretical analysis proves that CNDGNN performs better than GCN in the conflicting nodes and explores the key design view when solving the conflicting node problem.
Wenjun Wang, Xin Cao, Ya-Wen Li et al.· Proceedings of the 32nd ACM...· 0 citations
Graph Neural Networks (GNNs) have exhibited extraordinary performance in data mining. The success depends on the message passing mechanism, which is consistent with the homophily assumption that adjacent nodes share similar behaviors. However, the connected nodes in real-world graphs often show dissimilar behaviors, wh...
Wenjun Wang, Xin Cao, Yawen Li et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.