Abstract
Graph representation learning has emerged as a machine learning go-to technique, outperforming traditional tabular view of data across many domains. Current surveys on graph representation learning predominantly have an algorithmic focus with the primary goal of explaining foundational principles and comparing performances, yet the natural and practical question “Are graph embeddings the panacea?” has been so far neglected. In this paper, we propose to examine graph embedding algorithms from a data fitness perspective by offering a methodical analysis that aligns network characteristics of data with appropriate embedding algorithms. The overarching objective is to provide researchers and practitioners with comprehensive and methodical investigations, enabling them to confidently answer pivotal questions confronting node classification problems: 1) Is there a potential benefit of applying graph representation learning? 2) Is structural information alone sufficient? 3) Which embedding technique would best suit my dataset? Through 1400 experiments across 35 datasets, we have evaluated four network embedding algorithms – three popular GNN-based algorithms (GraphSage, GCN, GAE) and node2vec – over traditional classification methods, namely SVM, KNN, and Random Forest (RF). Our results indicate that the cohesiveness of the network, the representation of relation information, and the number of classes in a classification problem play significant roles in algorithm selection.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barabási, A.L.: Network Science by Albert-László Barabási. Cambridge University Press (2016). http://networksciencebook.com/
Cai, H., Zheng, V.W., Chang, K.C.C.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616–1637 (2018) https://doi.org/10.1109/TKDE.2018.2807452
Chen, S., Huang, S., Yuan, D., Zhao, X.: A survey of algorithms and applications related with graph embedding. In: Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies, pp. 181–185. ACM, Guangzhou China (2020).https://doi.org/10.1145/3444370.3444568
Fey, M., Lenssen, J.E.: Fast graph representation learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifold arXiv:1903.02428 (2019)
Goyal, P., Ferrara, E.: Graph embedding techniques, applications, and performance: a survey. Knowl.-Based Syst. 151, 78–94 (2018). https://doi.org/10.1016/j.knosys.2018.03.022
Grover, A., Leskovec, J.: Node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855–864. ACM (2016).https://doi.org/10.1145/2939672.2939754
Guthrie, D., Allison, B., Liu, W., Guthrie, L., Wilks, Y.: A closer look at skip-gram modelling. In: Proceedings of the Fifth International Conference on Language Resources and Evaluation (LREC’06) (2014)
Hamilton, W.L., Ying, R., Leskovec, J.: Inductive representation learning on large graphs (2018) arXiv:1706.02216 [cs, stat]
Hore, A., Ziou, D.: Image quality metrics: PSNR vs SSIM. In: 2010 20th International Conference on Pattern Recognition, pp. 2366–2369. IEEE (2010) https://doi.org/10.1109/ICPR.2010.579
Kipf, T.N., Welling, M.: Variational graph Auto-encoders (2016) https://doi.org/10.48550/arXiv.1611.07308
Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR (2017)
Makarov, I., Kiselev, D., Nikitinsky, N., Subelj, L.: Survey on graph embeddings and their applications to machine learning problems on graphs. PeerJ Comput. Sci. 7, e357 (2021). https://doi.org/10.7717/peerj-cs.357
Pei, H., Wei, B., Chang, K.C.C., Lei, Y., Yang, B.: Geom-GCN: geometric graph convolutional networks (2020) https://doi.org/10.48550/arXiv.2002.05287
Senaratne, A., Christen, P., Williams, G.J., Omran, P.G.: Rule-based knowledge discovery via anomaly detection in tabular data. In: Make (2023) https://api.semanticscholar.org/CorpusID:260356626
Xu, M.: Understanding graph embedding methods and their applications. SIAM Rev. 63(4), 825–853 (2021). https://doi.org/10.1137/20M1386062
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Sun, Q., Huynh, D.Q., Reynolds, M., Liu, W. (2024). Are Graph Embeddings the Panacea?. In: Yang, DN., Xie, X., Tseng, V.S., Pei, J., Huang, JW., Lin, J.CW. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2024. Lecture Notes in Computer Science(), vol 14646. Springer, Singapore. https://doi.org/10.1007/978-981-97-2253-2_32
Download citation
DOI: https://doi.org/10.1007/978-981-97-2253-2_32
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-2252-5
Online ISBN: 978-981-97-2253-2
eBook Packages: Computer ScienceComputer Science (R0)