Learning Optimal Graph Filters for Clustering of Attributed Graphs

Abstract

Many real-world systems can be represented as graphs where the different entities in the system are presented by nodes and their interactions by edges. An important task in studying large datasets with graphical structure is graph clustering. While there has been a lot of work on graph clustering using the connectivity between the nodes, many real-world networks also have node attributes. Clustering attributed graphs requires joint modeling of graph structure and node attributes. Recent work has focused on combining these two complementary sources of information through graph convolutional networks and graph filtering. However, these methods are mostly limited to lowpass filtering and do not explicitly learn the filter parameters for the clustering task. In this paper, we introduce a graph signal processing based approach, where we learn the parameters of Finite Impulse Response (FIR) and Autoregressive Moving Average (ARMA) graph filters optimized for clustering. The proposed approach is formulated as a two-step iterative optimization problem, focusing on learning interpretable graph filters that are optimal for the given data and that maximize the separation between different clusters. The proposed approach is evaluated on attributed networks and compared to the state-of-the-art methods.

12 pages, 7 figures

References in corpus (19)

• Fast unfolding of communities in large networks
• Community structure in social and biological networks
• Community detection in graphs
• Comparing community structure identification
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Link communities reveal multiscale complexity in networks
• Community Detection in Networks with Node Attributes
• Graph Neural Networks with convolutional ARMA filters
• Perfect Reconstruction Two-Channel Wavelet Filter-Banks for Graph Structured Data
• Learning Structural Node Embeddings Via Diffusion Wavelets
• Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
• Signal Recovery on Graphs: Variation Minimization
• Autoregressive Moving Average Graph Filtering
• Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
• Assessing the consistency of community structure in complex networks
• Beyond Low-pass Filtering: Graph Convolutional Networks with Automatic Filtering
• Adaptive Diffusions for Scalable Learning over Graphs
• Non-Bayesian Estimation Framework for Signal Recovery on Graphs
• A Survey on Spectral Graph Neural Networks