AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
How to Scale to Large Graphs and Retain Localized Information
In social networks, a node is more like its neighbors than it is nodes further away. But in some cases that's not true and you have to look for relationships between nodes far from your immediate neighborhood. A new model aims to solve this problem by taking the entire graph and splitting it into smaller clusters. It can then be used to work on both homophily and heterophilic graphs at once.