التفاصيل البيبلوغرافية
العنوان: |
Efficient pruning of large knowledge graphs |
المؤلفون: |
Stefano Faralli, Irene Finocchi, Simone Paolo Ponzetto, Paola Velardi |
المساهمون: |
Faralli, Stefano, Finocchi, Irene, Paolo Ponzetto, Simone, Velardi, Paola |
بيانات النشر: |
International Joint Conferences on Artificial Intelligence |
سنة النشر: |
2018 |
المجموعة: |
Sapienza Università di Roma: CINECA IRIS |
مصطلحات موضوعية: |
knowledge graph, Wikipedia category graph, pruning knowledge graphs |
الوصف: |
In this paper we present an efficient and highly accurate algorithm to prune noisy or over-ambiguous knowledge graphs given as input an extensional definition of a domain of interest, namely as a set of instances or concepts. Our method climbs the graph in a bottom-up fashion, iteratively layering the graph and pruning nodes and edges in each layer while not compromising the connectivity of the set of input nodes. Iterative layering and protection of pre-defined nodes allow to extract semantically coherent DAG structures from noisy or over-ambiguous cyclic graphs, without loss of information and without incurring in computational bottlenecks, which are the main problem of stateof- the-art methods for cleaning large, i.e., Webscale, knowledge graphs. We apply our algorithm to the tasks of pruning automatically acquired taxonomies using benchmarking data from a SemEval evaluation exercise, as well as the extraction of a domain-adapted taxonomy from theWikipedia category hierarchy. The results show the superiority of our approach over state-of-art algorithms in terms of both output quality and computational efficiency. |
نوع الوثيقة: |
conference object |
وصف الملف: |
STAMPA |
اللغة: |
English |
Relation: |
ispartofbook:Proceedings of 27th International Joint Conference on Artificial Intelligence; International Joint Conference on Artificial Intelligence IJCAI; http://hdl.handle.net/11573/1112858; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85055684350 |
الاتاحة: |
http://hdl.handle.net/11573/1112858 |
Rights: |
info:eu-repo/semantics/openAccess |
رقم الانضمام: |
edsbas.E306DC71 |
قاعدة البيانات: |
BASE |