KGPrune: a Web Application to Extract Subgraphs of Interest from Wikidata with Analogical Pruning
<|reference_start|>KGPrune: a Web Application to Extract Subgraphs of Interest from Wikidata with Analogical Pruning: Knowledge graphs (KGs) have become ubiquitous publicly available knowledge sources, and are nowadays covering an ever increasing array of domains. However, not all knowledge represented is useful or pertaining when considering a new application or specific task. Also, due to their increasing size, handling large KGs in their entirety entails scalability issues. These two aspects asks for efficient methods to extract subgraphs of interest from existing KGs. To this aim, we introduce KGPrune, a Web Application that, given seed entities of interest and properties to traverse, extracts their neighboring subgraphs from Wikidata. To avoid topical drift, KGPrune relies on a frugal pruning algorithm based on analogical reasoning to only keep relevant neighbors while pruning irrelevant ones. The interest of KGPrune is illustrated by two concrete applications, namely, bootstrapping an enterprise KG and extracting knowledge related to looted artworks.<|reference_end|>
@article{monnin2024kgprune:,
    title={KGPrune: a Web Application to Extract Subgraphs of Interest from
  Wikidata with Analogical Pruning},
    author={Pierre Monnin, Cherif-Hassan Nousradine, Lucas Jarnac, Laurel
  Zuckerman, Miguel Couceiro},
    journal={arXiv preprint arXiv:2408.14658},
    year={2024},
    doi={10.3233/FAIA241038},
    archivePrefix={arXiv},
    eprint={2408.14658},
    primaryClass={cs.AI cs.DB cs.IR cs.LG}
}