A Review of Knowledge Graph Completion
Information extraction methods proved to be effective at triple extraction from structured or unstructured data. The organization of such triples in the form of (head entity, relation, tail entity) is called the construction of Knowledge Graphs (KGs). Most of the current knowledge graphs are incompl...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-08-01
|
| Series: | Information |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2078-2489/13/8/396 |
| _version_ | 1827599641492848640 |
|---|---|
| author | Mohamad Zamini Hassan Reza Minou Rabiei |
| author_facet | Mohamad Zamini Hassan Reza Minou Rabiei |
| author_sort | Mohamad Zamini |
| collection | DOAJ |
| description | Information extraction methods proved to be effective at triple extraction from structured or unstructured data. The organization of such triples in the form of (head entity, relation, tail entity) is called the construction of Knowledge Graphs (KGs). Most of the current knowledge graphs are incomplete. In order to use KGs in downstream tasks, it is desirable to predict missing links in KGs. Different approaches have been recently proposed for representation learning of KGs by embedding both entities and relations into a low-dimensional vector space aiming to predict unknown triples based on previously visited triples. According to how the triples will be treated independently or dependently, we divided the task of knowledge graph completion into conventional and graph neural network representation learning and we discuss them in more detail. In conventional approaches, each triple will be processed independently and in GNN-based approaches, triples also consider their local neighborhood. |
| first_indexed | 2024-03-09T04:17:56Z |
| format | Article |
| id | doaj.art-5c26bda15867417da516e1388a70056e |
| institution | Directory Open Access Journal |
| issn | 2078-2489 |
| language | English |
| last_indexed | 2024-03-09T04:17:56Z |
| publishDate | 2022-08-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Information |
| spelling | doaj.art-5c26bda15867417da516e1388a70056e2023-12-03T13:50:56ZengMDPI AGInformation2078-24892022-08-0113839610.3390/info13080396A Review of Knowledge Graph CompletionMohamad Zamini0Hassan Reza1Minou Rabiei2Department of Computer Science, University of North Dakota, Grand Forks, ND 58202, USADepartment of Computer Science, University of North Dakota, Grand Forks, ND 58202, USADepartment of Petroleum Engineering, University of North Dakota, Grand Forks, ND 58202, USAInformation extraction methods proved to be effective at triple extraction from structured or unstructured data. The organization of such triples in the form of (head entity, relation, tail entity) is called the construction of Knowledge Graphs (KGs). Most of the current knowledge graphs are incomplete. In order to use KGs in downstream tasks, it is desirable to predict missing links in KGs. Different approaches have been recently proposed for representation learning of KGs by embedding both entities and relations into a low-dimensional vector space aiming to predict unknown triples based on previously visited triples. According to how the triples will be treated independently or dependently, we divided the task of knowledge graph completion into conventional and graph neural network representation learning and we discuss them in more detail. In conventional approaches, each triple will be processed independently and in GNN-based approaches, triples also consider their local neighborhood.https://www.mdpi.com/2078-2489/13/8/396knowledge graphsinformation extractionknowledge graph embeddings |
| spellingShingle | Mohamad Zamini Hassan Reza Minou Rabiei A Review of Knowledge Graph Completion Information knowledge graphs information extraction knowledge graph embeddings |
| title | A Review of Knowledge Graph Completion |
| title_full | A Review of Knowledge Graph Completion |
| title_fullStr | A Review of Knowledge Graph Completion |
| title_full_unstemmed | A Review of Knowledge Graph Completion |
| title_short | A Review of Knowledge Graph Completion |
| title_sort | review of knowledge graph completion |
| topic | knowledge graphs information extraction knowledge graph embeddings |
| url | https://www.mdpi.com/2078-2489/13/8/396 |
| work_keys_str_mv | AT mohamadzamini areviewofknowledgegraphcompletion AT hassanreza areviewofknowledgegraphcompletion AT minourabiei areviewofknowledgegraphcompletion AT mohamadzamini reviewofknowledgegraphcompletion AT hassanreza reviewofknowledgegraphcompletion AT minourabiei reviewofknowledgegraphcompletion |