Simple Unsupervised Graph Representation Learning

In this paper, we propose a simple unsupervised graph representation learning method to conduct effective and efficient contrastive learning. Specifically, the proposed multiplet loss explores the complementary information between the structural information and neighbor information to enlarge the interclass variation, as well as adds an upper bound loss to achieve the finite distance between positive embeddings and anchor embeddings for reducing the intra-class variation. As a result, both enlarging inter-class variation and reducing intra-class variation result in a small generalization error, thereby obtaining an effective model. Furthermore, our method removes widely used data augmentation and discriminator from previous graph contrastive learning methods, meanwhile available to output low-dimensional embeddings, leading to an efficient model. Experimental results on various real-world datasets demonstrate the effectiveness and efficiency of our method, compared to state-of-the-art methods. The source codes are released at https: //github. com/YujieMo/SUGRL.

Authors

• Yujie Mo School of Computer Science and Engineering, University of Electronic Science and Technology of China
• Liang Peng Fabu Inc.
• Jie Xu University of Florida
• Xiaoshuang Shi School of Computer Science and Engineering, University of Electronic Science and Technology of China
• Xiaofeng Zhu Guangxi Key Lab of Multisource Information Mining Security, Guangxi Normal University School of Computer Science and Engineering, University of Electronic Science and Technology of China

Keywords

No keywords are indexed for this paper.