Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Dynamic relation learning for link prediction in knowledge hypergraphs

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Link prediction for knowledge graphs (KGs), which aims to predict missing facts, has been broadly studied in binary relational KGs. However, real world data contains a large number of high-order interaction patterns, which is difficult to describe using only binary relations. In this work, we propose a relation-based dynamic learning model RD-MPNN, based on the message passing neural network model, to learn higher-order interactions and address the link prediction problem in knowledge hypergraphs. Different from existing methods, we consider the positional information of entities within a hyper-relation to differentiate each entity’s role in the hyper-relation. Furthermore, we complete the representation learning of hyper-relations by dynamically updating hyper-relations with entity information. Extensive evaluations on two representative knowledge hypergraph datasets demonstrate that our model outperforms the state-of-the-art methods. We also compare the performance of models at differing arities (the number of entities within a relation), to show that RD-MPNN demonstrates outstanding performance metrics for complex hypergraphs (arity>2).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Availability of data and materials

The datasets generated during and/or analysed during the current study are available in the https://github.com/ooCher/RD-MPNN repository.

Code Availability

The code of the study is available in the https://github.com/ooCher/RD-MPNN repository

References

  1. Wang X, Lin J, Ren C, Chen J (2022) Knowledge graph-based semantic ranking for efficient semantic query. In: 2022 IEEE 10th International Conference on Computer Science and Network Technology (ICCSNT). IEEE, pp 75–79

  2. Qu Y, Liu J, Kang L, Shi Q, Ye D (2018) Question answering over freebase via attentive rnn with similarity matrix based cnn. CoRR abs/1506.02075 38

  3. Cao Y, Wang X, He X, Hu Z, Chua T-S (2019) Unifying knowledge graph learning and recommendation: Towards a better understanding of user preferences. In: The World Wide Web Conference. pp 151–161

  4. Yang Y, Huang C, Xia L, Li C (2022) Knowledge graph contrastive learning for recommendation. In: Proceedings of the 45th InternationalACM SIGIR Conference on Research and Development in Information Retrieval. pp 1434–1443

  5. Bollacker K, Cook R, Tufts P (2007) Freebase: A shared database of structured general human knowledge. AAAI 7:1962–1963

    Google Scholar 

  6. Auer S, Bizer C, Kobilarov G, Lehmann J, Cyganiak R, Ives Z (2007) Dbpedia: A nucleus for a web of open data. In: The Semantic Web. pp 722–735

  7. Carlson A, Betteridge J, Kisiel B, Settles B, Hruschka ER, Mitchell TM (2010) Toward an architecture for never-ending language learning. In: Twenty-Fourth AAAI Conference on Artificial Intelligence

  8. Mahdisoltani F, Biega J, Suchanek F (2014) Yago3: A knowledge base from multilingual wikipedias. In: 7th Biennial Conference on Innovative Data Systems Research (2014). CIDR Conference

  9. West R, Gabrilovich E, Murphy K, Sun S, Gupta R, Lin D (2014) Knowledge base completion via search-based question answering. In: Proceedings of the 23rd International Conference on World Wide Web. pp 515–526

  10. Zamini M, Reza H, Rabiei M (2022) A review of knowledge graph completion. Information 13(8)

  11. Wen J, Li J, Mao Y, Chen S, Zhang R (2016) On the representation and embedding of knowledge bases beyond binary relations. Proceedings of the twenty-fifth AAAI international joint conference on artificial intelligence. 1300–1307

  12. Fatemi B, Taslakian P, Vazquez D, Poole D (2019) Knowledge hypergraphs: Prediction beyond binary relations. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI)

  13. Zhang R, Li J, Mei J, Mao Y (2018) Scalable instance reconstruction in knowledge bases via relatedness affiliated embedding. In: Proceedings of the 2018 World Wide Web Conference. pp 1185–1194

  14. Fatemi B, Taslakian P, Vazquez D, Poole D (2021) Knowledge hypergraph embedding meets relational algebra. arXiv preprint arXiv:2102.09557

  15. Gilmer J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE (2017) Neural message passing for quantum chemistry. In: International Conference on Machine Learning. PMLR, pp 1263–1272

  16. Bordes A, Usunier N, Garcia-Duran A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. Advances in neural information processing systems 26

  17. Wang Z, Zhang J, Feng J, Chen Z (2014) Knowledge graph embedding by translating on hyperplanes, vol. 28

  18. Ge X, Wang Y-C, Wang B, Kuo CJ (2022) Core: A knowledge graph entity type prediction method via complex space regression and embedding. Pattern Recognition Letters 157:97–103

    Article  Google Scholar 

  19. Balazevic I, Allen C, Hospedales T (2019) Tucker: Tensor factorization for knowledge graph completion. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 5185–5194

  20. Zulaika U, Almeida A, Lopez-de-Ipina D (2023) Regularized online tensor factorization for sparse knowledge graph embeddings. Neural Computing and Applications 35(1):787–797

    Article  Google Scholar 

  21. Yu M, Guo J, Yu J, Xu T, Zhao M, Liu H, Li X, Yu R (2023) Bdri:block decomposition based on relational interaction for knowledge graph completion. Data Mining and Knowledge Discovery. 1–21

  22. Dettmers T, Minervini P, Stenetorp P, Riedel S (2018) Convolutional 2d knowledge graph embeddings. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 32

  23. Shang C, Tang Y, Huang J, Bi J, He X, Zhou B (2019) End-to-end structure-aware convolutional networks for knowledge base completion. Proceedings of the AAAI Conference on Artificial Intelligence. 33:3060–3067

    Article  Google Scholar 

  24. Zou D, Wei W, Wang Z, Mao X-L, Zhu F, Fang R, Chen D (2022) Improving knowledge-aware recommendation with multi-level interactive contrastive learning. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management. pp 2817–2826

  25. Nathani D, Chauhan J, Sharma C, Kaul M (2019) Learning attention-based embeddings for relation prediction in knowledge graphs. Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics. 4710–4723

  26. Cui Z, Kapanipathi P, Talamadupula K, Gao T, Ji Q (2021) Type-augmented relation prediction in knowledge graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 35:7151–7159

    Article  Google Scholar 

  27. Ma R, Ma Y, Zhang H, Mei B, Lv G, Zhao L (2023) Panc: Prototype augmented neighbor constraint instance completion in knowledge graphs. Expert Systems with Applications 213:119013

    Article  Google Scholar 

  28. Tian L, Zhou X, Wu Y-P, Zhou W-T, Zhang J-H, Zhang T-S (2022) Knowledge graph and knowledge reasoning: A systematic review. Journal of Electronic Science and Technology. 100159

  29. Hao J, Chen M, Yu W, Sun Y, Wang W (2019) Universal representation learning of knowledge bases by jointly embedding instances and ontological concepts. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. pp 1709–1719

  30. Liu Y, Yao Q, Li Y (2020) Generalizing tensor decomposition for n-ary relational knowledge bases. Proceedings of The Web Conference 2020:1104–1114

    Google Scholar 

  31. Guan S, Jin X, Wang Y, Cheng X (2019) Link prediction on n-ary relational data. In: The World Wide Web Conference. pp 583–593

  32. Guan S, Jin X, Guo J, none Wang Y, Cheng X (2021) Link prediction on n-ary relational data based on relatedness evaluation. IEEE Transactions on Knowledge and Data Engineering

  33. Liu Y, Yao Q, Li Y (2021) Role-aware modeling for n-ary relational knowledge bases. Proceedings of the Web Conference 2021:2660–2671

  34. Guan S, Jin X, Guo J, Wang Y, Cheng X (2020) Neuinfer: Knowledge inference on n-ary facts. In: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. pp 6141–6151

  35. Rosso P, Yang D, Cudré-Mauroux P (2020) Beyond triplets: hyper-relational knowledge graph embedding for link prediction. Proceedings of The Web Conference 2020:1885–1896

    Google Scholar 

  36. Yan S, Zhang Z, Sun X, Xu G, Jin L, Li S (2022) Hyper2: Hyperbolic embedding for hyper-relational link prediction. Neurocomputing 492:440–451

    Article  Google Scholar 

  37. Yadati N (2020) Neural message passing for multi-relational ordered and recursive hypergraphs. Advances in Neural Information Processing Systems 33:3275–3289

    Google Scholar 

  38. Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser L, Polosukhin I (2017) Attention is all you need. Advances in neural information processing systems 30

  39. Cai Z, Zheng X (2020) A private and efficient mechanism for data uploading in smart cyber-physical systems. IEEE Transactions on Network Science and Engineering 7(2):766–775

    Article  MathSciNet  Google Scholar 

  40. Cai Z, Zheng X, Wang J, He Z (2022) Private data trading towards range counting queries in internet of things. IEEE Transactions on Mobile Computing. 1–1

  41. Zheng X, Cai Z (2020) Privacy-preserved data sharing towards multiple parties in industrial iots. IEEE Journal on Selected Areas in Communications 38(5):968–979

    Article  Google Scholar 

  42. Yang B, Yih W-t, He X, Gao J, Deng L (2014) Embedding entities and relations for learning and inference in knowledge bases. ICLR, 1–13

  43. Kingma DP, Ba J (2014) Adam: A method for stochastic optimization. In Proceedings 3rd International Conference on Learning Representations (ICLR)

Download references

Author information

Authors and Affiliations

  1. School of Information and Software Engineering, University of Electronic Science and Technology of China, No.4,Section 2,North Jianshe Road, Chengdu, 610054, Sichuan, China

    Xue Zhou, Bei Hui & Hao Wu

  2. School of Computer Science and Engineering, University of Electronic Science and Technology of China, No.2006, Xiyuan Avenue, West Hi-tech Zone, Chengdu, 611731, Sichuan, China

    Ilana Zeira & Ling Tian

  3. CETC Rongwei Electronic Technology Co.,Ltd, Jinke North Road, Jinniu District, Chengdu, 610074, Sichuan, China

    Hao Wu

Authors
  1. Xue Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bei Hui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ilana Zeira
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hao Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ling Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ling Tian.

Ethics declarations

Conflicts of interest

All authors declare that: (i) no support, financial or otherwise, has been received from any organization that may have an interest in the submitted work ; and (ii) there are no other relationships or activities that could appear to have influenced the submitted work.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Bei Hui, Ilana Zeira, Hao Wu, and Ling Tian contributed equally to this work.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, X., Hui, B., Zeira, I. et al. Dynamic relation learning for link prediction in knowledge hypergraphs. Appl Intell 53, 26580–26591 (2023). https://doi.org/10.1007/s10489-023-04710-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-023-04710-5

Keywords

Search

Navigation