KGPrune: a Web Application to Extract Subgraphs of Interest from Wikidata with Analogical Pruning
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910654555750400 |
|---|---|
| author | Monnin, Pierre Nousradine, Cherif-Hassan Jarnac, Lucas Zuckerman, Laurel Couceiro, Miguel |
| author_facet | Monnin, Pierre Nousradine, Cherif-Hassan Jarnac, Lucas Zuckerman, Laurel Couceiro, Miguel |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_14658 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | KGPrune: a Web Application to Extract Subgraphs of Interest from Wikidata with Analogical Pruning Monnin, Pierre Nousradine, Cherif-Hassan Jarnac, Lucas Zuckerman, Laurel Couceiro, Miguel Artificial Intelligence Databases Information Retrieval Machine Learning 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. |
| title | KGPrune: a Web Application to Extract Subgraphs of Interest from Wikidata with Analogical Pruning |
| topic | Artificial Intelligence Databases Information Retrieval Machine Learning |
| url | https://arxiv.org/abs/2408.14658 |