{"title":"Representation-Based Completion of Knowledge Graph with Open-World Data","authors":"Kun Yue, Jiahui Wang, Xinbai Li, Kuang Hu","doi":"10.1109/ICCCS49078.2020.9118444","DOIUrl":null,"url":null,"abstract":"The method of knowledge graph completion (KGC) by adding external knowledge with new entities was discussed in this paper. Adopting the TransE-based representation of relations and triples in Knowledge Graph, we extract triples from open-world data and evaluate their correctness to fulfill KGC, where vectors are used for similarity evaluation. From the “structural” point of view, triples were first built from open-world data according to the similarity between TransE-based representation of pairs of entities and that of relations in KG. From the “semantic” point of view, the correctness of each external triple was evaluated by measuring the distance in the triple locally and ranking in the entire KG globally. ON the FreeBase and DBPedia KGs by different KG representation models and KGC methods, experimental results show that our proposal outperforms some state-of-the-art methods.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCS49078.2020.9118444","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The method of knowledge graph completion (KGC) by adding external knowledge with new entities was discussed in this paper. Adopting the TransE-based representation of relations and triples in Knowledge Graph, we extract triples from open-world data and evaluate their correctness to fulfill KGC, where vectors are used for similarity evaluation. From the “structural” point of view, triples were first built from open-world data according to the similarity between TransE-based representation of pairs of entities and that of relations in KG. From the “semantic” point of view, the correctness of each external triple was evaluated by measuring the distance in the triple locally and ranking in the entire KG globally. ON the FreeBase and DBPedia KGs by different KG representation models and KGC methods, experimental results show that our proposal outperforms some state-of-the-art methods.