No abstract

No abstract

Existing deep graph clustering methods usually rely on neural language models to learn graph embeddings. However, these methods either ignore node feature information or fail to learn cluster-oriented graph embeddings. In this paper, we propose a novel deep graph clustering framework to tackle these two issues. First, we construct a feature transformation module to effectively integrate node feature information with graph topologies. Second, we introduce a graph embedding module and a self-supervised learning strategy to constrain graph embeddings by leveraging the graph similarity and the self-learning loss to group similar graphs together, thus encouraging the obtained graph embeddings to be clusteroriented. Extensive experimental results on eight real-world graph datasets validate the superiority of the proposed method over existing ones.

Recently, there has been surging interests in multimodal clustering. And extracting common features plays a critical role in these methods. However, since the ignorance of the fact that data in different modalities shares similar distributions in feature space, most works did not mining the inter-modal distribution relationships completely, which eventually leads to unacceptable common features. To address this issue, we propose the deep multimodal clustering with cross reconstruction method, which firstly focuses on multimodal feature extraction in an unsupervised way and then clusters these extracted features. The proposed cross reconstruction aims to build latent connections among different modalities, which effectively reduces the distribution differences in feature space. The theoretical analysis shows that the cross reconstruction reduces the Wasserstein distance of multimodal feature distributions. Experimental results on six benchmark datasets demonstrate that our method achieves obviously improvement over several state-of-arts.