Timezone: »

S3GC: Scalable Self-Supervised Graph Clustering
Fnu Devvrit · Aditya Sinha · Inderjit Dhillon · Prateek Jain

Wed Nov 30 02:00 PM -- 04:00 PM (PST) @ Hall J #124

We study the problem of clustering graphs with additional side-information of node features. The problem is extensively studied, and several existing methods exploit Graph Neural Networks to learn node representations. However, most of the existing methods focus on generic representations instead of their cluster-ability or do not scale to large scale graph datasets. In this work, we propose S3GC which uses contrastive learning along with Graph Neural Networks and node features to learn clusterable features. We empirically demonstrate that S3GC is able to learn the correct cluster structure even when graph information or node features are individually not informative enough to learn correct clusters. Finally, using extensive evaluation on a variety of benchmarks, we demonstrate that S3GC is able to significantly outperform state-of-the-art methods in terms of clustering accuracy -- with as much as 5% gain in NMI -- while being scalable to graphs of size 100M.

Author Information

Fnu Devvrit (University of Texas, Austin)

Hi. I am Devvrit, a second year PhD student at UT Austin. I'm broadly interested in large scale machine learning, deep learning, and optimization. In my free time, I play badminton and look for adventure sports.

Aditya Sinha (University of Illinois Urbana Champaign)

Research Fellow at Google Research India, interested in Machine Learning and Optimisation

Inderjit Dhillon (Google & UT Austin)
Prateek Jain (Google Research)

More from the Same Authors