Search Results for author:
Found 2 papers, 2 papers with code
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
Many widely used datasets for graph machine learning tasks have generally been homophilous, where nodes with similar labels connect to each other.
Ranked #2 on
Node Classification
on wiki
Graph Learning
Node Classification on Non-Homophilic (Heterophilic) Graphs
New Benchmarks for Learning on Non-Homophilous Graphs
Much data with graph structures satisfy the principle of homophily, meaning that connected nodes tend to be similar with respect to a specific attribute.
Ranked #4 on
Node Classification
on Yelp-Fraud
