Knowledge graph completion by context-aware convolutional learning with multi-hop neighborhoods

Byungkook Oh, Seungmin Seo, Kyong Ho Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The main focus of relational learning for knowledge graph completion (KGC) lies in exploiting rich contextual information for facts. Many state-of-the-art models incorporate fact sequences, entity types, and even textual information. Unfortunately, most of them do not fully take advantage of rich structural information in a KG, i.e., connectivity patterns around each entity. In this paper, we propose a context-aware convolutional learning (CACL) model which jointly learns from entities and their multi-hop neighborhoods. Since we directly utilize the connectivity patterns contained in each multi-hop neighborhood, the structural role similarity among entities can be better captured, resulting in more informative entity and relation embeddings. Specifically, CACL collects entities and relations from the multi-hop neighborhood as contextual information according to their relative importance and uniquely maps them to a linear vector space. Our convolutional architecture leverages a deep learning technique to represent each entity along with its linearly mapped contextual information. Thus, we can elaborately extract the features of key connectivity patterns from the context and incorporate them into a score function which evaluates the validity of facts. Experimental results on the newest datasets show that CACL outperforms existing approaches by successfully enriching embeddings with neighborhood information.

Original languageEnglish
Title of host publicationCIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management
EditorsNorman Paton, Selcuk Candan, Haixun Wang, James Allan, Rakesh Agrawal, Alexandros Labrinidis, Alfredo Cuzzocrea, Mohammed Zaki, Divesh Srivastava, Andrei Broder, Assaf Schuster
PublisherAssociation for Computing Machinery
Pages257-266
Number of pages10
ISBN (Electronic)9781450360142
DOIs
Publication statusPublished - 2018 Oct 17
Event27th ACM International Conference on Information and Knowledge Management, CIKM 2018 - Torino, Italy
Duration: 2018 Oct 222018 Oct 26

Publication series

NameInternational Conference on Information and Knowledge Management, Proceedings

Other

Other27th ACM International Conference on Information and Knowledge Management, CIKM 2018
CountryItaly
CityTorino
Period18/10/2218/10/26

Fingerprint

Graph
Context-aware
Connectivity
Deep learning
Learning model
Leverage
Relative importance

All Science Journal Classification (ASJC) codes

  • Business, Management and Accounting(all)
  • Decision Sciences(all)

Cite this

Oh, B., Seo, S., & Lee, K. H. (2018). Knowledge graph completion by context-aware convolutional learning with multi-hop neighborhoods. In N. Paton, S. Candan, H. Wang, J. Allan, R. Agrawal, A. Labrinidis, A. Cuzzocrea, M. Zaki, D. Srivastava, A. Broder, ... A. Schuster (Eds.), CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management (pp. 257-266). (International Conference on Information and Knowledge Management, Proceedings). Association for Computing Machinery. https://doi.org/10.1145/3269206.3271769
Oh, Byungkook ; Seo, Seungmin ; Lee, Kyong Ho. / Knowledge graph completion by context-aware convolutional learning with multi-hop neighborhoods. CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. editor / Norman Paton ; Selcuk Candan ; Haixun Wang ; James Allan ; Rakesh Agrawal ; Alexandros Labrinidis ; Alfredo Cuzzocrea ; Mohammed Zaki ; Divesh Srivastava ; Andrei Broder ; Assaf Schuster. Association for Computing Machinery, 2018. pp. 257-266 (International Conference on Information and Knowledge Management, Proceedings).
@inproceedings{b6885bd0ee314fd3bf40e9461ef6936c,
title = "Knowledge graph completion by context-aware convolutional learning with multi-hop neighborhoods",
abstract = "The main focus of relational learning for knowledge graph completion (KGC) lies in exploiting rich contextual information for facts. Many state-of-the-art models incorporate fact sequences, entity types, and even textual information. Unfortunately, most of them do not fully take advantage of rich structural information in a KG, i.e., connectivity patterns around each entity. In this paper, we propose a context-aware convolutional learning (CACL) model which jointly learns from entities and their multi-hop neighborhoods. Since we directly utilize the connectivity patterns contained in each multi-hop neighborhood, the structural role similarity among entities can be better captured, resulting in more informative entity and relation embeddings. Specifically, CACL collects entities and relations from the multi-hop neighborhood as contextual information according to their relative importance and uniquely maps them to a linear vector space. Our convolutional architecture leverages a deep learning technique to represent each entity along with its linearly mapped contextual information. Thus, we can elaborately extract the features of key connectivity patterns from the context and incorporate them into a score function which evaluates the validity of facts. Experimental results on the newest datasets show that CACL outperforms existing approaches by successfully enriching embeddings with neighborhood information.",
author = "Byungkook Oh and Seungmin Seo and Lee, {Kyong Ho}",
year = "2018",
month = "10",
day = "17",
doi = "10.1145/3269206.3271769",
language = "English",
series = "International Conference on Information and Knowledge Management, Proceedings",
publisher = "Association for Computing Machinery",
pages = "257--266",
editor = "Norman Paton and Selcuk Candan and Haixun Wang and James Allan and Rakesh Agrawal and Alexandros Labrinidis and Alfredo Cuzzocrea and Mohammed Zaki and Divesh Srivastava and Andrei Broder and Assaf Schuster",
booktitle = "CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management",

}

Oh, B, Seo, S & Lee, KH 2018, Knowledge graph completion by context-aware convolutional learning with multi-hop neighborhoods. in N Paton, S Candan, H Wang, J Allan, R Agrawal, A Labrinidis, A Cuzzocrea, M Zaki, D Srivastava, A Broder & A Schuster (eds), CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. International Conference on Information and Knowledge Management, Proceedings, Association for Computing Machinery, pp. 257-266, 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, Torino, Italy, 18/10/22. https://doi.org/10.1145/3269206.3271769

Knowledge graph completion by context-aware convolutional learning with multi-hop neighborhoods. / Oh, Byungkook; Seo, Seungmin; Lee, Kyong Ho.

CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ed. / Norman Paton; Selcuk Candan; Haixun Wang; James Allan; Rakesh Agrawal; Alexandros Labrinidis; Alfredo Cuzzocrea; Mohammed Zaki; Divesh Srivastava; Andrei Broder; Assaf Schuster. Association for Computing Machinery, 2018. p. 257-266 (International Conference on Information and Knowledge Management, Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Knowledge graph completion by context-aware convolutional learning with multi-hop neighborhoods

AU - Oh, Byungkook

AU - Seo, Seungmin

AU - Lee, Kyong Ho

PY - 2018/10/17

Y1 - 2018/10/17

N2 - The main focus of relational learning for knowledge graph completion (KGC) lies in exploiting rich contextual information for facts. Many state-of-the-art models incorporate fact sequences, entity types, and even textual information. Unfortunately, most of them do not fully take advantage of rich structural information in a KG, i.e., connectivity patterns around each entity. In this paper, we propose a context-aware convolutional learning (CACL) model which jointly learns from entities and their multi-hop neighborhoods. Since we directly utilize the connectivity patterns contained in each multi-hop neighborhood, the structural role similarity among entities can be better captured, resulting in more informative entity and relation embeddings. Specifically, CACL collects entities and relations from the multi-hop neighborhood as contextual information according to their relative importance and uniquely maps them to a linear vector space. Our convolutional architecture leverages a deep learning technique to represent each entity along with its linearly mapped contextual information. Thus, we can elaborately extract the features of key connectivity patterns from the context and incorporate them into a score function which evaluates the validity of facts. Experimental results on the newest datasets show that CACL outperforms existing approaches by successfully enriching embeddings with neighborhood information.

AB - The main focus of relational learning for knowledge graph completion (KGC) lies in exploiting rich contextual information for facts. Many state-of-the-art models incorporate fact sequences, entity types, and even textual information. Unfortunately, most of them do not fully take advantage of rich structural information in a KG, i.e., connectivity patterns around each entity. In this paper, we propose a context-aware convolutional learning (CACL) model which jointly learns from entities and their multi-hop neighborhoods. Since we directly utilize the connectivity patterns contained in each multi-hop neighborhood, the structural role similarity among entities can be better captured, resulting in more informative entity and relation embeddings. Specifically, CACL collects entities and relations from the multi-hop neighborhood as contextual information according to their relative importance and uniquely maps them to a linear vector space. Our convolutional architecture leverages a deep learning technique to represent each entity along with its linearly mapped contextual information. Thus, we can elaborately extract the features of key connectivity patterns from the context and incorporate them into a score function which evaluates the validity of facts. Experimental results on the newest datasets show that CACL outperforms existing approaches by successfully enriching embeddings with neighborhood information.

UR - http://www.scopus.com/inward/record.url?scp=85058008757&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85058008757&partnerID=8YFLogxK

U2 - 10.1145/3269206.3271769

DO - 10.1145/3269206.3271769

M3 - Conference contribution

AN - SCOPUS:85058008757

T3 - International Conference on Information and Knowledge Management, Proceedings

SP - 257

EP - 266

BT - CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management

A2 - Paton, Norman

A2 - Candan, Selcuk

A2 - Wang, Haixun

A2 - Allan, James

A2 - Agrawal, Rakesh

A2 - Labrinidis, Alexandros

A2 - Cuzzocrea, Alfredo

A2 - Zaki, Mohammed

A2 - Srivastava, Divesh

A2 - Broder, Andrei

A2 - Schuster, Assaf

PB - Association for Computing Machinery

ER -

Oh B, Seo S, Lee KH. Knowledge graph completion by context-aware convolutional learning with multi-hop neighborhoods. In Paton N, Candan S, Wang H, Allan J, Agrawal R, Labrinidis A, Cuzzocrea A, Zaki M, Srivastava D, Broder A, Schuster A, editors, CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. Association for Computing Machinery. 2018. p. 257-266. (International Conference on Information and Knowledge Management, Proceedings). https://doi.org/10.1145/3269206.3271769