.png){kind=icon}
Return
CBR-FIF: A Novel Dynamic Graph Node Embedding Computation Framework
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-031-93257-1_8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a new and scalable framework that more fully exploits the temporal contextual information of dynamic graph. Dynamic graph node embedding is a technique that embeds nodes in a time-varying graph. When performing representation learning on dynamic graph nodes, it is necessary to preserve not only the topological structure of the graph but also the temporal information. Most existing methods focus more on mining the topological structure of graph and do not fully utilize the temporal information. A convolutional aggregation module that considers temporal context is incorporated, enabling the computation of a node's embedding to simultaneously consider the information of its neighbors in the current snapshot and the neighboring snapshots. Additionally, the model integrates BiLSTM to aggregate temporal data from both directions. Finally, for each graph snapshot, we introduce a topological reconstruction loss function to generate better embedding for the nodes. We conducted experiments on two tasks and the results of our approach outperform the baseline models.
Keywords:
dynamic graph
node embedding
Journal
C
IF:
0
Papers:
14
Citations:
0
Organization
Cited Papers
struc2vec.png)
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
OAAI
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data MiningIF0
OAAIShareSaveShareSave
View more