Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Attributed Graph Embedding Based on Attention with Cluster

View through CrossRef
Graph embedding is of great significance for the research and analysis of graphs. Graph embedding aims to map nodes in the network to low-dimensional vectors while preserving information in the original graph of nodes. In recent years, the appearance of graph neural networks has significantly improved the accuracy of graph embedding. However, the influence of clusters was not considered in existing graph neural network (GNN)-based methods, so this paper proposes a new method to incorporate the influence of clusters into the generation of graph embedding. We use the attention mechanism to pass the message of the cluster pooled result and integrate the whole process into the graph autoencoder as the third layer of the encoder. The experimental results show that our model has made great improvement over the baseline methods in the node clustering and link prediction tasks, demonstrating that the embeddings generated by our model have excellent expressiveness.
Title: Attributed Graph Embedding Based on Attention with Cluster
Description:
Graph embedding is of great significance for the research and analysis of graphs.
Graph embedding aims to map nodes in the network to low-dimensional vectors while preserving information in the original graph of nodes.
In recent years, the appearance of graph neural networks has significantly improved the accuracy of graph embedding.
However, the influence of clusters was not considered in existing graph neural network (GNN)-based methods, so this paper proposes a new method to incorporate the influence of clusters into the generation of graph embedding.
We use the attention mechanism to pass the message of the cluster pooled result and integrate the whole process into the graph autoencoder as the third layer of the encoder.
The experimental results show that our model has made great improvement over the baseline methods in the node clustering and link prediction tasks, demonstrating that the embeddings generated by our model have excellent expressiveness.

Related Results

Constructing a VANET based on cluster chains
Constructing a VANET based on cluster chains
SUMMARYThe paper proposes a scheme on constructing a vehicular ad‐hoc network based on cluster chains. In the cluster construction algorithm, the distance from a potential cluster ...
Regional directions of the cluster development strategy in the field of tourism and hospitality
Regional directions of the cluster development strategy in the field of tourism and hospitality
The monograph consists of an introduction, 5 chapters, lists of used sources for each chapter separately; contains 31 tables and 37 figures. The monograph examines the theoretical ...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Effective Attributed Network Embedding with Information Behavior Extraction
Effective Attributed Network Embedding with Information Behavior Extraction
Abstract Network embedding has shown its effectiveness in many tasks such as link prediction, node classification, and community detection. Most attributed network embeddin...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Adaptive Graph Convolution Using Heat Kernel for Attributed Graph Clustering
Adaptive Graph Convolution Using Heat Kernel for Attributed Graph Clustering
Attributed graphs contain a lot of node features and structural relationships, and how to utilize their inherent information sufficiently to improve graph clustering performance ha...
Radiologic Patterning of Joint Damage to the Foot in Rheumatoid Arthritis
Radiologic Patterning of Joint Damage to the Foot in Rheumatoid Arthritis
ObjectiveFoot and ankle deformities greatly affect the quality of life of rheumatoid arthritis (RA) patients. The aim of this study was to elucidate the pattern of destruction of t...

Back to Top