A Novel Representation Learning for Dynamic Graphs Based on Graph Convolutional Networks
The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Graph representation learning has re-emerged as a fascinating research topic due to the successful application of graph convolutional networks (GCNs) for graphs and inspires various downstream tasks, such as node classification and link prediction. Nevertheless, existing GCN-based methods for graph representation learning mainly focus on static graphs. Although some methods consider the dynamic characteristics of networks, the global structure information, which helps a node to gain worthy features from distant but valuable nodes, has not received enough attention. Moreover, these methods generally update the features of the nodes by averaging the features of neighboring nodes, which may not effectively consider the importance of different neighboring nodes during the aggregation. In this article, we propose a novel representation learning for dynamic graphs based on the GCNs, called DGCN. More specifically, the long short-term memory (LSTM) is utilized to update the weight parameters of GCN for capturing the global structure information across all time steps of dynamic graphs. Besides, a new Dice similarity is proposed to overcome the problem that the influence of directed neighbors is unnoticeable, which is further used to guide the aggregation. We evaluate the performance of the proposed method in the field of node clustering and link prediction, and the experimental results show a generally better performance of our proposed DGCN than baseline methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502 · cited 1×
“By some careful investigations, we find that synthetic networks generated by Girvan and Newman benchmarks [67] show a relatively clear community structure when μ 0 .”
MethodVeličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., & Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1710.10903 · Cited by 12,107
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000 · cited 2×
“According to [44], the time complexity of the graph convolution operations in GCN is O ( | E | ) .”
Backgroundnode2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926 · cited 5×
“To evaluate the results of link prediction, we utilize the area under curve (AUC [5]) as the evaluation metric, which is a common and widely used metric for the link prediction task [61], [62].”
BackgroundMethodInfluentialInductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
An Information-Maximization Approach to Blind Separation and Blind Deconvolution
Bell, A. J., & Sejnowski, T. J. (1995) · Neural Computation · doi:10.1162/neco.1995.7.6.1129 · Cited by 8,986
Structural Deep Network Embedding
Wang, D., Cui, P., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939753 · Cited by 2,845
Cui, P., Wang, X., Pei, J., & Zhu, W. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2849727 · Cited by 1,274
Overcoming Catastrophic Forgetting in Graph Neural Networks
Liu, H., Yang, Y., & Wang, X. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i10.17049 · Cited by 127
Metadata
- Authors
- Gao, C., Zhu, J., Zhang, F., Wang, Z., & Li, X.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2023-06
- Volume
- 53
- Issue
- 6
- Pages
- 3599-3612
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W4220822815
- Cited by
- 194
- References
- 11
- FWCI
- 12.76
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Novel Representation Learning for Dynamic Graphs Based on Graph Convolutional Networks. https://app.cochat.ai/papers/10.1109/tcyb.2022.3159661
- The paper
- Gao, C., Zhu, J., Zhang, F., Wang, Z., & Li, X. (2023). A Novel Representation Learning for Dynamic Graphs Based on Graph Convolutional Networks. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2022.3159661
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.