Simplifying Clustering with Graph Neural Networks

by   Filippo Maria Bianchi, et al.
University of Tromsø the Arctic University of Norway

The objective functions used in spectral clustering are usually composed of two terms: i) a term that minimizes the local quadratic variation of the cluster assignments on the graph and; ii) a term that balances the clustering partition and helps avoiding degenerate solutions. This paper shows that a graph neural network, equipped with suitable message passing layers, can generate good cluster assignments by optimizing only a balancing term. Results on attributed graph datasets show the effectiveness of the proposed approach in terms of clustering performance and computation time.


page 1

page 2

page 3

page 4


Clustering with Total Variation Graph Neural Networks

Graph Neural Networks (GNNs) are deep learning models designed to proces...

Fast Approximate Spectral Clustering for Dynamic Networks

Spectral clustering is a widely studied problem, yet its complexity is p...

Local Graph Clustering with Network Lasso

We study the statistical and computational properties of a network Lasso...

Cluster Forests

With inspiration from Random Forests (RF) in the context of classificati...

A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs

We propose a novel robust decentralized graph clustering algorithm that ...

From Clustering to Cluster Explanations via Neural Networks

A wealth of algorithms have been developed to extract natural cluster st...

A Cluster-Based Trip Prediction Graph Neural Network Model for Bike Sharing Systems

Bike Sharing Systems (BSSs) are emerging as an innovative transportation...

Please sign up or login with your details

Forgot password? Click here to reset