Skip navigation

Learning URI selection criteria to improve the crawling of linked open data (extended abstract)

Learning URI selection criteria to improve the crawling of linked open data (extended abstract)

Huang, Hai ORCID: 0000-0003-1412-0567 and Gandon, Fabien (2021) Learning URI selection criteria to improve the crawling of linked open data (extended abstract). In: JCAI'20: Twenty-Ninth International Joint Conference on Artificial Intelligence Yokohama Yokohama, Japan January 7 - 15, 2021. International Joint Conferences on Artificial Intelligence, Yokohama, Japan, pp. 4730-4734. ISBN 978-0999241165 (doi:https://doi.org/10.24963/ijcai.2020/655)

[img]
Preview
PDF (Published paper (VoR))
36599_HUANG_Learning_URI_selection_criteria_to_improve_the_crawling.pdf - Published Version

Download (423kB) | Preview

Abstract

A Linked Data crawler performs a selection to focus on collecting linked RDF (including RDFa) data on the Web. From the perspectives of through-put 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.

Item Type: Conference Proceedings
Title of Proceedings: JCAI'20: Twenty-Ninth International Joint Conference on Artificial Intelligence Yokohama Yokohama, Japan January 7 - 15, 2021
Uncontrolled Keywords: linked RDF data; crawling; FTRL
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / School / Research Centre / Research Group: Faculty of Engineering & Science
Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS)
Faculty of Liberal Arts & Sciences
Last Modified: 12 Oct 2022 16:03
URI: http://gala.gre.ac.uk/id/eprint/36599

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics