Trio-based collaborative multi-view graph clustering with multiple constraints

作者:

Highlights:

摘要

Multi-view graph clustering is an attentional research topic in recent years due to its wide applications. According to recent surveys, most existing works focus on incorporating comprehensive information among multiple views to achieve the clustering task. However, these studies pay less attention to explore the collaborative relationship between fusion-view features and independence-view features. To make full use of view relationships and enhance the complementary benefits of different views in graphs, we propose a trio-based collaborative learning framework for multi-view graph representation clustering (TCMGC) that drives the multiple auto-clustering constraints. We utilize the triplet operations (trio-based) to guarantee the independence and complementarity between each view and complete clustering tasks collaboratively. Meanwhile, we propose a joint optimization objective to improve the overall performance of representation learning and clustering. Experimental results on four real-world benchmark datasets show that the proposed TCMGC has promising performance compared with state-of-the-art baseline methods.

论文关键词:Multi-view graph clustering,Collaborative learning,Unsupervised learning,Graph auto-encoder

论文评审过程:Received 31 July 2020, Revised 2 December 2020, Accepted 9 December 2020, Available online 5 February 2021, Version of Record 5 February 2021.

论文官网地址:https://doi.org/10.1016/j.ipm.2020.102466