Skip to main content

Knowledge Base Completion by Learning to Rank Model

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 784))

Abstract

Knowledge base (KB) completion aims to predict new facts from the existing ones in KBs. There are many KB completion approaches, one of the state-of-art approaches is Path Ranking Algorithm (PRA), which predicts new facts based on path types connecting entities. PRA treats the relation prediction as a classification problem, and logistic regression is used as the classification model. In this work, we consider the relation prediction as a ranking problem; learning to rank model is trained on path types to predict new facts. Experiments on YAGO show that our proposed approach outperforms approaches using classification models.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Notes

  1. 1.

    https://github.com/matt-gardner/pra.

  2. 2.

    http://www.mpi-inf.mpg.de/.

  3. 3.

    http://scikit-learn.org/stable.

References

  1. Bizer, C., Lehmann, J., Kobilarov, G., Auer, S., Becker, C., Cyganiak, R., Hellmann, S.: Dbpedia-a crystallization point for the web of data. Web Semant. Sci. Serv. Agents World Wide Web 7(3), 154–165 (2009)

    Article  Google Scholar 

  2. Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: Advances in Neural Information Processing Systems, pp. 2787–2795 (2013)

    Google Scholar 

  3. Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: Proceedings of the 24th International Conference on Machine Learning, pp. 129–136. ACM (2007)

    Google Scholar 

  4. Dong, X., Gabrilovich, E., Heitz, G., Horn, W., Lao, N., Murphy, K., Strohmann, T., Sun, S., Zhang, W.: Knowledge vault: a web-scale approach to probabilistic knowledge fusion. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 601–610. ACM (2014)

    Google Scholar 

  5. Gardner, M., Mitchell, T.: Efficient and expressive knowledge base completion using subgraph feature extraction. In: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pp. 1488–1498 (2015)

    Google Scholar 

  6. Gardner, M., Talukdar, P.P., Krishnamurthy, J., Mitchell, T.: Incorporating vector space similarity in random walk inference over knowledge bases. In: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (2014)

    Google Scholar 

  7. Lao, N., Cohen, W.W.: Relational retrieval using a combination of path-constrained random walks. Mach. Learn. 81, 53–67 (2010)

    Article  MathSciNet  Google Scholar 

  8. Lao, N., Mitchell, T., Cohen, W.W.: Random walk inference and learning in a large scale knowledge base. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP 2011, pp. 529–539. Association for Computational Linguistics, Stroudsburg (2011)

    Google Scholar 

  9. Lin, Y., Liu, Z., Luan, H.-B., Sun, M., Rao, S., Liu, S.: Modeling relation paths for representation learning of knowledge bases. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP 2015) (2015)

    Google Scholar 

  10. Muggleton, S.: Inductive logic programming. New Gener. Comput. 8(4), 295–318 (1991)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  12. Quinlan, J.R., Cameron-Jones, R.M.: FOIL: a midterm report. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, pp. 1–20. Springer, Heidelberg (1993). https://doi.org/10.1007/3-540-56602-3_124

    Chapter  Google Scholar 

  13. Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a large ontology from wikipedia and wordnet. Web Semant. Sci. Serv. Agents World Wide Web 6(3), 203–217 (2008)

    Article  Google Scholar 

  14. Wang, Q., Liu, J., Luo, Y., Wang, B., Lin, C.-Y.: Knowledge base completion via coupled path ranking. In: ACL (2016)

    Google Scholar 

  15. Wang, Z., Zhang, J., Feng, J., Chen, Z.: Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pp. 1112–1119 (2014)

    Google Scholar 

  16. Wang, Z., Li, J.-Z.: Rdf2rules: learning rules from RDF knowledge bases by mining frequent predicate cycles. CoRR, abs/1512.07734 (2015)

    Google Scholar 

Download references

Acknowledgement

The work is supported by project of Beijing Advanced Innovation Center for Future Education (BJAICFE2016IR-002).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhichun Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Huang, Y., Wang, Z. (2017). Knowledge Base Completion by Learning to Rank Model. In: Li, J., Zhou, M., Qi, G., Lao, N., Ruan, T., Du, J. (eds) Knowledge Graph and Semantic Computing. Language, Knowledge, and Intelligence. CCKS 2017. Communications in Computer and Information Science, vol 784. Springer, Singapore. https://doi.org/10.1007/978-981-10-7359-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-7359-5_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-7358-8

  • Online ISBN: 978-981-10-7359-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics