Abstract
Graph node importance estimation, which evaluates the importance of graph nodes, is an important graph mining problem and has been widely used in many fields such as search engines and recommender systems. Different from ordinary graphs, there are various types of nodes and relationships in knowledge graphs. The relationships in knowledge graphs encode different information, so the information of nodes in a knowledge graph is richer, which leads to the evaluation of the importance of nodes in knowledge graphs being more complicated. The existing research on the importance of nodes in knowledge graphs is mainly based on the assumption that there are enough labels, which even reach 70% of the dataset. However, there are usually few labels in reality. To better study the importance estimation of nodes in a knowledge graph when labels are sparse, we propose a node importance evaluation algorithm based on contrastive learning. First, an unsupervised contrastive loss is designed to generate rich node representations by maximizing the consistency of representations under different views of the same node. To utilize scarce but valuable labeled data for learning node importance, we design a semi-supervised contrastive loss, which solves the problem of failing to determine positive and negative examples in the task of node importance evaluation. In order to improve the effectiveness of contrastive learning, we propose a negative sampling strategy based on label similarity. Negative samples are constructed according to the label difference. Finally, the experimental results on real-world datasets confirm the effectiveness of CLNIE, which achieves a significant performance improvement over the state-of-the-art solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bollacker, K., Evans, C., Paritosh, P., Sturge, T., Taylor, J.: Freebase: a collaboratively created graph database for structuring human knowledge. In: ACM SIGMOD International Conference on Management of Data, pp. 1247–1250 (2008)
Borgatti, S.P.: Centrality and network flow. Soc. Netw. 27(1), 55–71 (2005)
Borgatti, S.P., Everett, M.G.: A graph-theoretic perspective on centrality. Soc. Netw. 28(4), 466–484 (2006)
Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning, pp. 1597–1607. PMLR (2020)
Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Computing classic closeness centrality, at scale. In: ACM Conference on Online Social Networks, pp. 37–50 (2014)
Gao, T., Yao, X., Chen, D.: SimCSE: simple contrastive learning of sentence embeddings. arXiv preprint arXiv:2104.08821 (2021)
Geng, H., et al.: Modeling dynamic heterogeneous graph and node importance for future citation prediction. In: ACM International Conference on Information & Knowledge Management, pp. 572–581 (2022)
Hassani, K., Khasahmadi, A.H.: Contrastive multi-view representation learning on graphs. In: International Conference on Machine Learning, pp. 4116–4126. PMLR (2020)
Haveliwala, T.H.: Topic-sensitive pagerank. In: International Conference on World Wide Web, pp. 517–526 (2002)
He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 9729–9738 (2020)
Huang, C., Fang, Y., Lin, X., Cao, X., Zhang, W., Orlowska, M.: Estimating node importance values in heterogeneous information networks. In: ICDE, pp. 846–858. IEEE (2022)
Huang, H., Sun, L., Du, B., Liu, C., Lv, W., Xiong, H.: Representation learning on knowledge graphs for node importance estimation. In: ACM SIGKDD, pp. 646–655 (2021)
Jung, J., Park, N., Lee, S., Kang, U.: Bepi: Fast and memory-efficient method for billion-scale random walk with restart. In: ACM International Conference on Management of Data, pp. 789–804 (2017)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM (JACM) 46(5), 604–632 (1999)
Liu, C., Fu, Y., Xu, C., Yang, S., Li, J., Wang, C., Zhang, L.: Learning a few-shot embedding model with contrastive learning. In: the AAAI Conference on Artificial Intelligence, vol. 35, pp. 8635–8643 (2021)
Liu, X., Tang, J.: Network representation learning: a macro and micro view. AI Open 2, 43–64 (2021)
Luo, X., Chen, Y., Wen, L., Pan, L., Xu, Z.: Boosting few-shot classification with view-learnable contrastive learning. In: IEEE International Conference on Multimedia and Expo, pp. 1–6. IEEE (2021)
Newman, M.E.: A measure of betweenness centrality based on random walks. Soc. Netw. 27(1), 39–54 (2005)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Tech. Rep., Stanford InfoLab (1999)
Palmonari, M., Minervini, P.: Knowledge graph embeddings and explainable AI. Knowledge Graphs for Explainable Artificial Intelligence: Foundations, Applications and Challenges 47, 49 (2020)
Park, N., Kan, A., Dong, X.L., Zhao, T., Faloutsos, C.: Estimating node importance in knowledge graphs using graph neural networks. In: ACM SIGKDD, pp. 596–606 (2019)
Park, N., Kan, A., Dong, X.L., Zhao, T., Faloutsos, C.: Multiimport: inferring node importance in a knowledge graph from multiple input signals. In: ACM SIGKDD, pp. 503–512 (2020)
Qiu, J., Chen, Q., Dong, Y., Zhang, J., Yang, H., Ding, M., Wang, K., Tang, J.: GCC: graph contrastive coding for graph neural network pre-training. In: ACM SIGKDD, pp. 1150–1160 (2020)
Velickovic, P., Fedus, W., Hamilton, W.L., Liò, P., Bengio, Y., Hjelm, R.D.: Deep graph infomax. ICLR (Poster), vol. 2, no 3, p. 4 (2019)
Zhang, J., Luo, Y.: Degree centrality, betweenness centrality, and closeness centrality in social network. In: International Conference on Modelling, Simulation and Applied Mathematics, pp. 300–303. Atlantis Press (2017)
Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., Wang, L.: Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131 (2020)
Acknowledgements
This work is supported by the National Nature Science Foundation of China (62072083) and the Fundamental Research Funds of the Central Universities (N2216017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, J., Song, Y., Gu, Y., Li, X., Li, F. (2023). CLNIE: A Contrastive Learning Based Node Importance Evaluation Method for Knowledge Graphs with Few Labels. In: Wang, X., et al. Database Systems for Advanced Applications. DASFAA 2023. Lecture Notes in Computer Science, vol 13944. Springer, Cham. https://doi.org/10.1007/978-3-031-30672-3_46
Download citation
DOI: https://doi.org/10.1007/978-3-031-30672-3_46
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-30671-6
Online ISBN: 978-3-031-30672-3
eBook Packages: Computer ScienceComputer Science (R0)