Author(s)

LiNing Yuan

Affiliation(s)

School of Information Technology, Guangxi Police College, Nanning 530028, Guangxi, China.

Corresponding Author

LiNing Yuan

ABSTRACT

Graph analysis serves as a robust approach for the in-depth exploration of the inherent characteristics of graph data. Nonetheless, due to the non-Euclidean nature of such data, conventional data analysis techniques often incur significant computational expenses and spatial overhead. Graph autoencoders present a viable solution to the challenges associated with graph analysis by converting the original graph data into a low-dimensional representation while maintaining essential information. This transformation subsequently improves the efficacy of various downstream tasks, including node classification, link prediction, and node clustering. This paper offers a thorough review of the existing literature on graph autoencoders, encapsulating the fundamental strategies employed by these models and their applications in downstream tasks. Additionally, the paper suggests prospective avenues for future research in the domain of graph autoencoders.

KEYWORDS

Graph autoencoders; Graph representation learning; Graph neural networks; Graph analysis tasks

CITE THIS PAPER

LiNing Yuan. Graph autoencoders: a survey. World Journal of Engineering Research. 2025, 3(2): 57-62. DOI: https://doi.org/10.61784/wjer3030.

REFERENCES

[1] Balasubramaniam K, Vidhya S, Jayapandian N, et al. Social network user profiling with multilayer semantic modeling using ego network. International Journal of Information Technology and Web Engineering (IJITWE), 2022, 17(1): 1-14.

[2] Troncoso F, Weber R. A novel approach to detect associations in criminal networks. Decision Support Systems, 2020, 128: 113159.

[3] Guo S N, Lin Y F, Feng N, et al. Attention based spatial-temporal graph convolutional networks for traffic flow forecasting. Proceedings of the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, Honolulu, Jan 27-Feb 1, 2019. Menlo Park: AAAI, 2019: 922-929.

[4] Bhagat S, Cormode G, Muthukrishnan S. Node classification in social networks. Aggarwal C C .Social Network Data Analytics. Berlin, Heidelberg: Springer, 2011: 115-148.

[5] Liben-Nowell D, Kleinberg J. The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 2007, 58(7): 1019-1031.

[6] Ding C H Q, He X F, Zha H Y, et al. A min-max cut algorithm for graph partitioning and data clustering. Proceedings of the 2001 IEEE International Conference on Data Mining, San Jose, Nov 29-Dec 2, 2001. Washington: IEEE Computer Society, 2001: 107-114.

[7] Vander M L, Hinton G. Visualizing data using t-SNE. Journal of Machine Learning Research, 2008, 9(11): 2579-2605.

[8] Qiu J Z, Tang J, Ma H, et al. DeepInf: social influence prediction with deep learning. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, London, Aug 19-23, 2018. New York: ACM , 2018: 2110-2119.

[9] Silveira T, Zhang M, Lin X, et al. How good your recommender system is? A survey on evaluations in recommendation. International Journal of Machine Learning and Cybernetics, 2019, 10(5): 813-831.

[10] Bourlard H, Kamp Y. Auto-association by multilayer perceptrons and singular value decomposition. Biological Cybernetics, 1988, 59(4): 291-294.

[11] Tian F, Gao B, Cui Q, et al. Learning deep representations for graph clustering. Proceedings of the 28th AAAI Conference on Artificial Intelligence, Québec City, Jul 27 -31, 2014. Menlo Park: AAAI, 2014: 1293-1299.

[12] Wang D X, Cui P, Zhu W W. Structural deep network embedding. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, Aug 13-17, 2016. New York: ACM, 2016: 1225-1234.

[13] Cao S S, Lu W, Xu Q K. Deep neural networks for learning graph representations. Proceedings of the 30th AAAI Conference on Artificial Intelligence, Phoenix,  Feb 12-17, 2016. Menlo Park: AAAI, 2016: 1145-1152.

[14] Shen X, Chung F L. Deep network embedding with aggregated proximity preserving. Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Jul 31 – Aug 3, 2017. New York: ACM, 2017: 40-43.

[15] Kingma D P, Welling M. Auto-encoding variational Bayes. arXiv:1312.6114, 2013.

[16] Kipf T N, Welling M. Variational graph auto-encoders. arXiv:1611.07308, 2016.

[17] Kipf T N, Welling M. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907, 2016.

[18] Salha G, Hennequin R, Vazirgiannis M. Keep it simple: graph autoencoders without graph convolutional networks. arXiv:1910.00942, 2019.

[19] Yuan L, Jiang P, Wen Z, et al. Improving Variational Graph Autoencoders With Multi-Order Graph Convolutions. IEEE Access, 2024, 12: 46919-46929. DOI:10.1109/ACCESS.2024.3380012.

[20] Yuan L, Wen Z, Feng W, et al. Graph Representation Learning Enhanced by Self-supervised Information. Guangxi Sciences, 2024, 31(2): 323-334.

[21] Park J, Lee M, Chang H J, et al. Symmetric graph convolutional autoencoder for unsupervised graph representation learning. Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision, Seoul, Oct 27 – Nov 2, 2019. Piscataway: IEEE, 2019: 6518-6527.

[22] Xiao Y, Xiao D, Hu B B, et al. ANE: network embedding via adversarial autoencoders. Proceedings of the 2018 IEEE International Conference on Big Data and Smart Computing, Shanghai, Jan 15-17, 2018. Washington: IEEE Computer Society, 2018: 66-73.