Skip to main content

Knowledge Graph Embedding Based on Subgraph-Aware Proximity

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11343))

Included in the following conference series:

  • 584 Accesses

Abstract

Knowledge graph (KG) embedding aims to project the original KG into a low-dimensional embedding vector space, so as to facilitate the completion of KGs and the application of KGs in other AI fields. Most existing models preserve certain proximity property of KGs in the embedding space, such as the first/second-order proximity and the sequence-aware higher-order proximity. However, the ubiquitous similarity relationship among different sequences has rarely been discussed. In this paper, we propose an unified framework to preserve the subgraph-aware proximity in the embedding space, holding that the sequences within a subgraph generally imply similar pattern. To analyze the impact of different composition of sequences on the subgraph-aware proximity, we classify the subgraphs into relation subgraph and complete subgraph based on the composition of their sequences. Accordingly, we provide three methods for KG sequence embedding module: (1) Simply adding the involved relations of the sequence in relation subgraph; (2) Recurrent neural networks for the sequences in complete subgraph; (3) Dilated RNN to match the special structure of KG sequences in complete subgraph. Empirically, we evaluate the proposed framework on the KG completion tasks of link prediction and entity classification. The results show that our framework performs better than the baselines by preserving the subgraph-aware proximity. Especially, exploring the special structure of KG sequences can further improve the performance.

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

Access this chapter

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

Institutional subscriptions

References

  1. Bollacker, K., Evans, C., Paritosh, P., Sturge, T., Taylor, J.: Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 1247–1250. ACM (2008)

    Google Scholar 

  2. Bordes, A., Glorot, X., Weston, J., Bengio, Y.: A semantic matching energy function for learning with multi-relational data. Mach. Learn. 94(2), 233–259 (2014)

    Article  MathSciNet  Google Scholar 

  3. 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 

  4. Bordes, A., Weston, J., Collobert, R., Bengio, Y., et al.: Learning structured embeddings of knowledge bases. In: AAAI, vol. 6, p. 6 (2011)

    Google Scholar 

  5. Chang, S., et al.: Dilated recurrent neural networks. In: Advances in Neural Information Processing Systems, pp. 76–86 (2017)

    Google Scholar 

  6. Collobert, R., Weston, J.: A unified architecture for natural language processing: deep neural networks with multitask learning. In: Proceedings of the 25th International Conference on Machine Learning, pp. 160–167. ACM (2008)

    Google Scholar 

  7. Das, R., Neelakantan, A., Belanger, D., McCallum, A.: Chains of reasoning over entities, relations, and text using recurrent neural networks. arXiv preprint arXiv:1607.01426 (2016)

  8. Fan, M., Zhou, Q., Zheng, T.F., Grishman, R.: Distributed representation learning for knowledge graphs with entity descriptions. Pattern Recognit. Lett. 93, 31–37 (2016)

    Article  Google Scholar 

  9. Goyal, P., Ferrara, E.: Graph embedding techniques, applications, and performance: a survey. arXiv preprint arXiv:1705.02801 (2017)

  10. 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)

    Google Scholar 

  11. Han, X., Zhang, C., Guo, C., Ji, Y.: A generalization of recurrent neural networks for graph embedding. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10938, pp. 247–259. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93037-4_20

    Chapter  Google Scholar 

  12. Ji, G., He, S., Xu, L., Liu, K., Zhao, J.: Knowledge graph embedding via dynamic mapping matrix. In: ACL, vol. 1, pp. 687–696 (2015)

    Google Scholar 

  13. Lin, Y., Liu, Z., Luan, H., Sun, M., Rao, S., Liu, S.: Modeling relation paths for representation learning of knowledge bases. arXiv preprint arXiv:1506.00379 (2015)

  14. Lin, Y., Liu, Z., Sun, M., Liu, Y., Zhu, X.: Learning entity and relation embeddings for knowledge graph completion. In: AAAI, pp. 2181–2187 (2015)

    Google Scholar 

  15. Liu, Q., et al.: Probabilistic reasoning via deep learning: neural association models. arXiv preprint arXiv:1603.07704 (2016)

  16. Neelakantan, A., Chang, M.W.: Inferring missing entity type instances for knowledge base completion: new dataset and methods. arXiv preprint arXiv:1504.06658 (2015)

  17. Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710. ACM (2014)

    Google Scholar 

  18. Socher, R., Chen, D., Manning, C.D., Ng, A.: Reasoning with neural tensor networks for knowledge base completion. In: Advances in Neural Information Processing Systems, pp. 926–934 (2013)

    Google Scholar 

  19. Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1067–1077. International World Wide Web Conferences Steering Committee (2015)

    Google Scholar 

  20. Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1225–1234. ACM (2016)

    Google Scholar 

  21. Wang, Z., Zhang, J., Feng, J., Chen, Z.: Knowledge graph embedding by translating on hyperplanes. In: AAAI, pp. 1112–1119 (2014)

    Google Scholar 

  22. Xie, R., Liu, Z., Jia, J., Luan, H., Sun, M.: Representation learning of knowledge graphs with entity descriptions. In: AAAI, pp. 2659–2665 (2016)

    Google Scholar 

Download references

Acknowledgements

This work is supported by National Natural Science Foundation of China, 61602048, 61601046, 61520106007, BUPT-SICE Excellent Graduate Students Innovation Funds, 2016.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiao Han .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Han, X., Zhang, C., Guo, C., Sun, T., Ji, Y. (2018). Knowledge Graph Embedding Based on Subgraph-Aware Proximity. In: Tang, S., Du, DZ., Woodruff, D., Butenko, S. (eds) Algorithmic Aspects in Information and Management. AAIM 2018. Lecture Notes in Computer Science(), vol 11343. Springer, Cham. https://doi.org/10.1007/978-3-030-04618-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04618-7_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04617-0

  • Online ISBN: 978-3-030-04618-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics