Learning URI Selection Criteria to Improve the Crawling of Linked Open Data (Extended Abstract) - Archive ouverte HAL Access content directly
Conference Papers Year :

Learning URI Selection Criteria to Improve the Crawling of Linked Open Data (Extended Abstract)

(1, 2) , (1)
1
2

Abstract

A Linked Data crawler performs a selection to focus on collecting linked RDF (including RDFa) data on the Web. From the perspectives of throughput and coverage, given a newly discovered and targeted URI, the key issue of Linked Data crawlers is to decide whether this URI is likely to dereference into an RDF data source and therefore it is worth downloading the representation it points to. Current solutions adopt heuristic rules to filter irrelevant URIs. But when the heuristics are too restrictive this hampers the coverage of crawling. In this paper, we propose and compare approaches to learn strategies for crawling Linked Data on the Web by predicting whether a newly discovered URI will lead to an RDF data source or not. We detail the features used in predicting the relevance and the methods we evaluated including a promising adaptation of FTRL-proximal online learning algorithm. We compare several options through extensive experiments including existing crawlers as baseline methods to evaluate their efficiency.
Fichier principal
Vignette du fichier
main.pdf (499.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03064912 , version 1 (14-12-2020)

Identifiers

  • HAL Id : hal-03064912 , version 1

Cite

Hai Huang, Fabien Gandon. Learning URI Selection Criteria to Improve the Crawling of Linked Open Data (Extended Abstract). IJCAI 2020 - 29th International Joint Conference on Artificial Intelligence, Jan 2021, Yokohama, Japan. ⟨hal-03064912⟩
83 View
126 Download

Share

Gmail Facebook Twitter LinkedIn More