Multi-view attributed graph clustering based on graph diffusion convolution with adaptive fusion

Abstract

Graph clustering is one of the popular techniques in data mining, which is widely used in social network analysis, recommendation system and abnormal detection. The existing methods based on multi-view attributed graph ignore the difference of different views and the consistency between views. To this end, this paper proposes a novel method for multi-view attributed graph clustering based on graph diffusion convolution with adaptive fusion. Specifically, a graph diffusion convolution is firstly employed to propagate features of the adjacency and attribute matrices on each view. A linear encoder–decoder is then used to learn the graph embedding representation of each view. Meanwhile, the consistency learning module is applied to capture the geometric relationship consistency of different views to find a consistent embedding space during the embedding representation learning. To measure the importance of different views, the attention mechanism is subsequently utilized to adaptively learn the weights of different views to fuse multiple views of data for the final clustering. Finally, the graph representation learning and clustering tasks are jointly optimized to obtain a clustering friendly graph representation. Experiments conducted on two public datasets and three real futures datasets from the Zhengzhou Commodity Exchange demonstrate the effectiveness of the proposed method in the task of graph clustering.