Self-Supervised Deep Graph Embedding with High-Order Information Fusion for Community Discovery
Deep graph embedding is an important approach for community discovery. Deep graph neural network with self-supervised mechanism can obtain the low-dimensional embedding vectors of nodes from unlabeled and unstructured graph data. The high-order information of graph can provide more abundant structure information for the representation learning of nodes. However, most self-supervised graph neural networks only use adjacency matrix as the input topology information of graph and cannot obtain too high-order information since the number of layers of graph neural network is fairly limited. If there are too many layers, the phenomenon of over smoothing will appear. Therefore how to obtain and fuse high-order information of graph by a shallow graph neural network is an important problem. In this paper, a deep graph embedding algorithm with self-supervised mechanism for community discovery is proposed. The proposed algorithm uses self-supervised mechanism and different high-order information of graph to train multiple deep graph convolution neural networks. The outputs of multiple graph convolution neural networks are fused to extract the representations of nodes which include the attribute and structure information of a graph. In addition, data augmentation and negative sampling are introduced into the training process to facilitate the improvement of embedding result. The proposed algorithm and the comparison algorithms are conducted on the five experimental data sets. The experimental results show that the proposed algorithm outperforms the comparison algorithms on the most experimental data sets. The experimental results demonstrate that the proposed algorithm is an effective algorithm for community discovery.
Code (0)
등록된 구현이 없습니다.
Tasks
AttributeData AugmentationGraph EmbeddingGraph Neural NetworkRepresentation LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Self-supervised Graph Learning for Occasional Group Recommendation
As an important branch in Recommender System, occasional group recommendation has received more and more attention. In this scenario, each occasional group (cold-start group) has no or few historical interacted items. As…
Contrastive LearningGraph LearningMeta-LearningRecommendation Systems+1Unsupervised Universal Self-Attention Network for Graph Classification
Existing graph embedding models often have weaknesses in exploiting graph structure similarities, potential dependencies among nodes and global network properties. To this end, we present U2GAN, a novel unsupervised mode…
ClassificationGraph ClassificationGraph EmbeddingSelf-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation
Social relations are often used to improve recommendation quality when user-item interaction data is sparse in recommender systems. Most existing social recommendation models exploit pairwise relations to mine potential …
Recommendation SystemsSelf-Supervised LearningHDMI: High-order Deep Multiplex Infomax
Networks have been widely used to represent the relations between objects such as academic networks and social networks, and learning embedding for networks has thus garnered plenty of research attention. Self-supervised…
Node ClassificationRepresentation LearningVocal Bursts Intensity PredictionNodeSketch: Highly-Efficient Graph Embeddings via Recursive Sketching
Embeddings have become a key paradigm to learn graph represen-tations and facilitate downstream graph analysis tasks. Existinggraph embedding techniques either sample a large number of nodepairs from a graph to learn nod…