Skip to main content
SpringerLink
Log in

CP Tensor Factorization for Knowledge Graph Completion

  • Conference paper
  • First Online:
Knowledge Science, Engineering and Management (KSEM 2022)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 13368))

Abstract

The problem of incomplete knowledge caused by the lack of relations in large-scale knowledge graphs increases the difficulty of downstream application tasks. Predicting the missing relations between entities according to the existing facts is the main means of knowledge graph completion. The triple of knowledge graph can be seen as a third-order binary tensor element that linearly transforms entities and relations into low-dimensional vectors through tensor decomposition to determine the probability that the triple of missing relations is true. However, the non-deterministic polynomiality in determining the tensor rank can lead to overfitting and unfavorable to the generation of low-rank models. Aiming at this problem, we propose to use CP decomposition to decompose the third-order tensor into the sum of multiple rank-one tensors, which is the sum of the outer products of the head entity embedding, relation embedding, and tail entity embedding for each triple, and convert it into a super-diagonal tensor product the factor matrix of each mode, and use scoring function calculate the probability that the triple of missing relation is true. Link prediction experimental results from four different domains of benchmarks knowledge graph datasets show that the proposed methods are better than other comparison methods, it also can express the complex relations of knowledge graph, and the decomposition has uniqueness, reduces the total amount of calculations and parameters, avoids overfitting.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Jiao, J., Wang, S., Zhang, Xiaowang, W.L., Feng, Z., Wang, J.: gMatch: knowledge base question answering via semantic matching. Knowl. Based Syst. 228 (2021). Author, F., Author, S.: Title of a proceedings paper. In: Editor, F., Editor, S. (eds.) CONFERENCE 2016, LNCS, vol. 9999, pp. 1–13. Springer, Heidelberg (2016)

    Google Scholar 

  2. Xiong, C., Power, R., Callan, J.: Explicit semantic ranking for academic search via knowledge. graph embedding. In: Barrett, R., Cummings, R., Agichtein, E., et al. Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, 3–7 April 2017, pp. 1271–1279. ACM (2017)

    Google Scholar 

  3. Zhou, Z., Liu, S., Xu, G., Xie, X., Yin, J., Li, Y., Zhang, W.: Knowledge-based recommendation with hierarchical collaborative embedding. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10938, pp. 222–234. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93037-4_18

    Chapter  Google Scholar 

  4. Bollacker, K., Evans, C., Paritosh, P., et al.: Freebase: a collaboratively created graph database for. structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data - SIGMOD 2008, Vancouver, Canada, p. 1247. ACM Press (2008)

    Google Scholar 

  5. Mahdisoltani, F., Biega, J., Suchanek, F.M.: YAGO3: a knowledge base from multilingual. Wikipedias. In: CIDR 2015, Seventh Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, 4–7 January 2015, Online Proceedings. www.cidrdb.org (2015)

  6. Nathani, D., Chauhan, J., Sharma, C., Manohar, K.: Learning attention-based. embeddings for relation prediction in knowledge graphs. CoRR,2019.abs /1906.01195

    Google Scholar 

  7. Miller, G.A.: WordNet: a lexical database for English. Commun. ACM 38(11), 39–41 (1995)

    Article  Google Scholar 

  8. Ji, S., Pan, S., Cambria, E., Marttinen, P., Yu, P.S.: A survey on knowledge graphs: representation, acquisition, and applications. IEEE Trans. Neural Netw. Learn. Syst. 33(2), 494–514 (2022)

    Article  MathSciNet  Google Scholar 

  9. Han, X., Minlie, H., Yu, H., Xiaoyan, Z.: TransA: an adaptive approach for. knowledge graph embedding. CoRR,2015, abs/1509.05490

    Google Scholar 

  10. Bordes, A., Usunier, N., Garcia-Duran, A., et al.: Translating Embeddings for Modeling Multi-relational Data. Curran Associates Inc. (2013)

    Google Scholar 

  11. Msahli, M., Qiu, H., Zheng, Q., et al.; Topological graph convolutional network-based urban traffic flow and density prediction. IEEE Trans. Intell. Transp. Syst. PP(99) (2020)

    Google Scholar 

  12. Sedghi, H., Sabharwal, A.: Knowledge completion for generics using guided tensor. factorization. CoRR, abs /1612.03871 (2016)

    Google Scholar 

  13. Patents: Polynomial Method of Constructing a Non-Deterministic (NP) Turing Machine. In: Patent Application Approval Process (USPTO 20160012339). Politics & Government Week (2016)

    Google Scholar 

  14. Balazevic, I., Allen, C., Hospedales, T.M.: TuckER: tensor factorization for. knowledge graph completion. CoRR,abs/1901.09590 (2019)

    Google Scholar 

  15. Kolda, T.G., Bader, B.W.: Tensor Decompositions and applications. SIAM Rev. 51(3), 455–500 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lin, Y., Liu, Z., Sun, M., et al.: Learning entity and relation embeddings for knowledge graph. Completion. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 25–30 January 2015, Austin, Texas, USA, pp. 2181–2187. AAAI Press (2015)

    Google Scholar 

  17. Fan, M., Zhou, Q., Chang, E., et al.: Transition-based Knowledge Graph Embedding with Relational Mapping Properties (2014)

    Google Scholar 

  18. Xiao, H., Huang, M., Zhu X.: From one point to a manifold: knowledge graph embedding for. Precise Link Prediction. In: KAMBHAMPATI S. Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9–15 July 2016, pp. 1315–1321. IJCAI/AAAI Press (2016)

    Google Scholar 

  19. Ji, G., Liu, K., He, S., et al.: Knowledge graph completion with adaptive sparse transfer. Matrix. In: Schuurmans, D., Wellman, M.P. (eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 12–17 February 2016, Phoenix, Arizona, USA, pp. 985–991. AAAI Press (2016)

    Google Scholar 

  20. Wang, Z., Zhang, J., Feng, J., et al.: Knowledge graph embedding by translating on. Hyperplanes. In: Brodley, C.E., Stone, P. (eds.) Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 27–31 July 2014, Québec City, Québec, Canada, pp. 1112–1119. AAAI Press (2014)

    Google Scholar 

  21. Socker, R., Chen, D., Manning, C.D., et al.: Reasoning with neural tensor networks for knowledge. Base completion. In: Advances in Neural Information Processing Systems, pp. 926–934 (2013)

    Google Scholar 

  22. Nickel, M., Murphy, K., Tresp, V., Gabrilovich, E.: A review of relational machine learning for knowledge graphs. Proc. IEEE 104(1), 11–33 (2016)

    Article  Google Scholar 

  23. Schlichtkrull, M., Kipf, T.N., Bloem, P., van den Berg, R., Titov, I., Welling, M.: Modeling relational data with graph convolutional networks. In: Gangemi, A., Navigli, R., Vidal, M.-E., Hitzler, P., Troncy, R., Hollink, L., Tordai, A., Alam, M. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 593–607. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93417-4_38

    Chapter  Google Scholar 

  24. Dettmers, T., Minervini, P., Stenetorp, P., et al.: Convolutional 2D knowledge graph. Embeddings. In: Mcilraith, S.A., Weinberger, K.Q. (eds.) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, 2–7 February 2018, pp. 1811–1818. AAAI Press (2018)

    Google Scholar 

  25. Nguyen, D.Q., Nguyen, T.D., Nguyen, D.Q., et al.: A novel embedding model for knowledge. Base completion based on convolutional neural network. In: Walker, M.A., Ji, H., Stent, A. (eds.) Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT, New Orleans, Louisiana, USA, 1–6 June 2018, Volume 2 (Short Papers), pp. 327–333. Association for Computational Linguistics (2018)

    Google Scholar 

  26. Nickel, M., Tresp, V., Kriegel, H.-P.: A three-way model for collective learning on multi-relational data. In: Getoor, L., Scheffer, T. (eds.) Proceedings of the 28th International Conference on Machine Learning, ICML 2011, Bellevue, Washington, USA, 28 June–2 July 2011, pp. 809–816. Omnipress (2011)

    Google Scholar 

  27. Yang, B., Yih, W., He, X., et al.: Embedding entities and relations for learning and inference in. knowledge bases. In: Bengio, Y., Lecun, Y. (eds.) 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, 7–9 May 2015, Conference Track Proceedings (2015)

    Google Scholar 

  28. Trouillon, T., Welbl, J., Riedel, S., et al.: Complex embeddings for simple link. Prediction. In: Balcan, M.-F., Weinberger, K.Q. (eds.) Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, 19–24 June 2016. JMLR.org, vol. 48, pp. 2071–2080 (2016)

    Google Scholar 

  29. Kazemi, S.M., Poole, D.: SimplE embedding for link prediction in knowledge. Graphs. In: Bengio, S., Wallach, H.M., Larochelle, H., et al. Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3–8 December 2018, Montréal, Canada. 2018, pp. 4289–4300 (2018)

    Google Scholar 

  30. Akrami, F., Saeef, M.S., Zhang, Q., Hu, W., Li, C.: Realistic Re-evaluation of Knowledge Graph Completion Methods: An Experimental Study. Management of Data (2020)

    Google Scholar 

  31. Toutanova, K., Chen, D., Pantel, P., Poon, H., Choudhury, P., Gamon, M.: Representing text for joint embedding of text and knowledge bases. In: Proceedings of the 2015Conference on Empirical Methods in Natural Language Processing (2015)

    Google Scholar 

  32. Xiong, W., Hoang, T., Wang, W.Y.: De eppath: a reinforcement learning method for knowledge graph reasoning. arXivpreprint arXiv:1707.06690,201

  33. Lin, X.V., Socher, R., Xiong, C.: Multi-hop knowledge graph reasoning with reward shaping. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing (EMNLP) (2018)

    Google Scholar 

  34. Sun, Z., Deng, Z.H., Nie, J.Y., et al.: RotatE: knowledge graph embedding by relational rotation in complex space (2019)

    Google Scholar 

  35. Chao, L., He, J., Wang, T., et al.: PairRE: knowledge graph embeddings via paired relation vectors (2020)

    Google Scholar 

  36. Vashishth, S., Sanyal, S., Nitin, V., et al.: InteractE: improving convolution-based knowledge graph embeddings by increasing feature interactions. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 3, pp. 3009–3016 (2020)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Southwest University of Science and Technology, Mianyang, 621010, Sichuan, China

    Yue Luo, Chunming Yang, Bo Li & Xujian Zhao

  2. School of Science, Southwest University of Science and Technology, Mianyang, 621010, Sichuan, China

    Hui Zhang

  3. Sichuan Big Data and Intelligent System Engineering Technology Research Center, Mianyang, 621010, Sichuan, China

    Chunming Yang

Authors
  1. Yue Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chunming Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bo Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xujian Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chunming Yang .

Editor information

Editors and Affiliations

  1. Télécom Paris, Paris, France

    Gerard Memmi

  2. Purdue University, West Lafayette, IN, USA

    Baijian Yang

  3. Shanghai Jiao Tong University, Shanghai, Shanghai, China

    Linghe Kong

  4. Nanyang Technological University, Singapore, Singapore

    Tianwei Zhang

  5. Texas A&M University – Commerce, Commerce, TX, USA

    Meikang Qiu

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Luo, Y., Yang, C., Li, B., Zhao, X., Zhang, H. (2022). CP Tensor Factorization for Knowledge Graph Completion. In: Memmi, G., Yang, B., Kong, L., Zhang, T., Qiu, M. (eds) Knowledge Science, Engineering and Management. KSEM 2022. Lecture Notes in Computer Science(), vol 13368. Springer, Cham. https://doi.org/10.1007/978-3-031-10983-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-10983-6_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-10982-9

  • Online ISBN: 978-3-031-10983-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation