Search Results for author:
Found 3 papers, 3 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
Edge Proposal Sets for Link Prediction
Here, we demonstrate how simply adding a set of edges, which we call a \emph{proposal set}, to the graph as a pre-processing step can improve the performance of several link prediction algorithms.
Ranked #1 on
Link Property Prediction
on ogbl-ddi
DEAP Cache: Deep Eviction Admission and Prefetching for Cache
While previous approaches used the past as an indicator of the future, we instead explicitly model the future frequency and recency in a multi-task fashion with prefetching, leveraging the abilities of deep networks to capture futuristic trends and use them for learning eviction and admission.
