检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Pedro de Moraes Ligabue Anarosa Alves Franco Brandão Sarajane Marques Peres Fabio Gagliardi Cozman Paulo Pirozelli
机构地区:[1]Escola Politécnica,Universidade de São Paulo,Rua Visconde da Luz,60,São Paulo,São Paulo 05508-010,Brazi [2]Escola Politécnica,Universidade de São Paulo,Av.Prof.Luciano Gualberto,tv 3,158,São Paulo 05508-010,Brazil [3]Escola de Artes Ciências e Humanidades,Universidade de São Paulo,Rua Arlindo Béttio,1000,São Paulo 03828-000,Brazil [4]Instituto de Estudos Avançados,Universidade de São Paulo,Rua da Praça do Relógio,109,São Paulo 05508-050,Brazil
出 处:《Data Intelligence》2024年第1期64-103,共40页数据智能(英文)
基 金:The authors of this work would like to thank the Center for Artificial Intelligence(C4AI-USP)and the support from the São Paulo Research Foundation(FAPESP grant#2019/07665-4)and from the IBM Corporation;Fabio G.Cozman acknowledges partial support by CNPq grant Pq 305753/2022-3;This study was financed in part by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior-Brazil(CAPES)-Finance Code 001。
摘 要:Knowledge graphs are employed in several tasks,such as question answering and recommendation systems,due to their ability to represent relationships between concepts.Automatically constructing such a graphs,however,remains an unresolved challenge within knowledge representation.To tackle this challenge,we propose CtxKG,a method specifically aimed at extracting knowledge graphs in a context of limited resources in which the only input is a set of unstructured text documents.CtxKG is based on OpenIE(a relationship triple extraction method)and BERT(a language model)and contains four stages:the extraction of relationship triples directly from text;the identification of synonyms across triples;the merging of similar entities;and the building of bridges between knowledge graphs of different documents.Our method distinguishes itself from those in the current literature(i)through its use of the parse tree to avoid the overlapping entities produced by base implementations of OpenIE;and(ii)through its bridges,which create a connected network of graphs,overcoming a limitation similar methods have of one isolated graph per document.We compare our method to two others by generating graphs for movie articles from Wikipedia and contrasting them with benchmark graphs built from the OMDb movie database.Our results suggest that our method is able to improve multiple aspects of knowledge graph construction.They also highlight the critical role that triple identification and named-entity recognition have in improving the quality of automatically generated graphs,suggesting future paths for investigation.Finally,we apply CtxKG to build BlabKG,a knowledge graph for the Blue Amazon,and discuss possible improvements.
关 键 词:knowledge graph word embeddings relationship triple extraction Blue Amazon Atlantic Ocean Brazilian coast
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49