{"type":"ScholarlyArticle","title":"Learning URI Selection Criteria to Improve the Crawling of Linked Open Data (Extended Abstract)","authors":[{"name":"Hai Huang","slug":"hai-huang","given":"Hai","family":"Huang","affiliation":"Inria , Université Côte d'Azur , CNRS , I3S , France"},{"name":"Fabien Gandon","slug":"fabien-gandon","given":"Fabien","family":"Gandon","affiliation":"Inria , Université Côte d'Azur , CNRS , I3S , France"}],"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.","doi":"10.24963/ijcai.2020/655","url":"https://ijcai.org/proceedings/2020/655","pdf":"https://ijcai.org/proceedings/2020/0655.pdf","markdown":"https://ijcai.org/proceedings/2020/655.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/655","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Sister Conferences Best Papers","track":"Sister Conferences Best Papers","number":655,"pages":{"first":4730,"last":4734},"keywords":["Knowledge Representation and Reasoning: Semantic Web","Data Mining: Applications","Data Mining: Mining Text, Web, Social Media","Data Mining: Feature Extraction, Selection and Dimensionality Reduction"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24339/file_24339.m3u8","length_sec":261,"provider":"hls"}],"references":[{"position":1,"raw":"[Berners-Lee, 2006] Tim Berners-Lee. Linked data -design issues. 2006.","title":"Linked data -design issues","authors":"Tim Berners-Lee","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Chakrabarti et al., 1999] Soumen Chakrabarti, Martin van den Berg, and Byron Dom. Focused crawling: A new approach to topic-specific web resource discovery. Computer Networks, 31(11-16):1623-1640, 1999.","title":"Focused crawling: A new approach to topic-specific web resource discovery","authors":"Soumen Chakrabarti, Martin Van Den, Byron Berg, Dom","year":"1999","venue":"Computer Networks","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Diligenti et al., 2000] Michelangelo Diligenti, Frans Coet- zee, Steve Lawrence, C. Lee Giles, and Marco Gori. Fo- cused crawling using context graphs. In VLDB, pages 527- 534, 2000.","title":"Focused crawling using context graphs","authors":"Diligenti","year":"2000","venue":"VLDB","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Dodds, 2006] Leigh Dodds. Slug : A Semantic Web Crawler. 2006.","title":"Slug : A Semantic Web Crawler","authors":"Leigh Dodds","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Ermilov et al., 2016] Ivan Ermilov, Jens Lehmann, Michael Martin, and Sören Auer. Lodstats: The data web census dataset. In International Semantic Web Conference (2), volume 9982 of Lecture Notes in Computer Science, pages 38-46, 2016.","title":"Lodstats: The data web census dataset","authors":"Ivan Ermilov, Jens Lehmann, Michael Martin, Sören Auer","year":"2016","venue":"International Semantic Web Conference (2)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Färber et al., 2018] Michael Färber, Frederic Bartscherer, Carsten Menne, and Achim Rettinger. Linked data qual- ity of dbpedia, freebase, opencyc, wikidata, and YAGO. Semantic Web, 9(1):77-129, 2018.","title":"Linked data quality of dbpedia, freebase, opencyc, wikidata, and YAGO","authors":"Michael Färber, Frederic Bartscherer, Carsten Menne, Achim Rettinger","year":"2018","venue":"Semantic Web","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Heath and Bizer, 2011] Tom Heath and Christian Bizer. Linked Data: Evolving the Web Into a Global Data Space, volume 1. Morgan & Claypool Publishers, 2011.","title":"Tom Heath and Christian Bizer","authors":"Bizer Heath","year":"2011","venue":"Linked Data: Evolving the Web Into a Global Data Space","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Hogan et al., 2010] Aidan Hogan, Andreas Harth, Alexan- dre Passant, Stefan Decker, and Axel Polleres. Weaving the pedantic web. In LDOW, 2010.","title":"Weaving the pedantic web","authors":"Aidan Hogan, Andreas Harth, Alexandre Passant, Stefan Decker, Axel Polleres","year":"2010","venue":"LDOW","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Hogan et al., 2011] Aidan Hogan, Andreas Harth, Jürgen Umbrich, Sheila Kinsella, Axel Polleres, and Stefan Decker. Searching and browsing linked data with SWSE: the semantic web search engine. J. Web Sem., 9(4):365- 401, 2011.","title":"Searching and browsing linked data with SWSE: the semantic web search engine","authors":"Aidan Hogan, Andreas Harth, Jürgen Umbrich, Sheila Kinsella, Axel Polleres, Stefan Decker","year":"2011","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Huang and Gandon, 2019] Hai Huang and Fabien Gandon. Learning URI selection criteria to improve the crawling of linked open data. In ESWC, pages 194-208, 2019.","title":"Learning URI selection criteria to improve the crawling of linked open data","authors":"Gandon ; Huang, Hai Huang, Fabien Gandon","year":"2019","venue":"ESWC","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Isele et al., 2010] Robert Isele, Jürgen Umbrich, Christian Bizer, and Andreas Harth. Ldspider: An open-source crawling framework for the web of linked data. In Pro- ceedings of the ISWC 2010 Posters & Demonstrations Track, 2010.","title":"Ldspider: An open-source crawling framework for the web of linked data","authors":"Robert Isele, Jürgen Umbrich, Christian Bizer, Andreas Harth","year":"2010","venue":"Proceedings of the ISWC 2010 Posters & Demonstrations Track","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Levenshtein, 1966] V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl., 6:707-710, 1966.","title":"Binary codes capable of correcting deletions, insertions and reversals","authors":"V I Levenshtein","year":"1966","venue":"Sov. Phys. Dokl","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[McMahan et al., 2013] H. Brendan McMahan, Gary Holt, David Sculley, Michael Young, Dietmar Ebner, Julian Grady, Lan Nie, Todd Phillips, Eugene Davydov, Daniel Golovin, Sharat Chikkerur, Dan Liu, Martin Wattenberg, Arnar Mar Hrafnkelsson, Tom Boulos, and Jeremy Ku- bica. Ad click prediction: a view from the trenches. In SIGKDD, pages 1222-1230, 2013.","title":"Ad click prediction: a view from the trenches","authors":"H, Brendan Mcmahan, Gary Holt, David Sculley, Michael Young, Dietmar Ebner, Julian Grady, Lan Nie, Todd Phillips, Eugene Davydov, Daniel Golovin, Sharat Chikkerur, Dan Liu, Martin Wattenberg, Arnar Mar Hrafnkelsson, Tom Boulos, Jeremy Kubica","year":"2013","venue":"SIGKDD","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[McMahan, 2011] H. Brendan McMahan. Follow-the- regularized-leader and mirror descent: Equivalence theo- rems and L1 regularization. In AISTATS, pages 525-533, 2011. Meusel et al., 2014] Robert Meusel, Peter Mika, and Roi Blanco. Focused crawling for structured data. In CIKM, pages 1039-1048, 2014.","title":"Follow-theregularized-leader and mirror descent: Equivalence theorems and L1 regularization","authors":"H, Brendan Mcmahan, ; Meusel","year":"2011","venue":"AISTATS","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Umbrich et al., 2008] Jürgen Umbrich, Andreas Harth, Aidan Hogan, and Stefan Decker. Four heuristics to guide structured content crawling. In ICWE, pages 196-202, 2008.","title":"Four heuristics to guide structured content crawling","authors":"Jürgen Umbrich, Andreas Harth, Aidan Hogan, Stefan Decker","year":"2008","venue":"ICWE","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Weinberger et al., 2009] Kilian Q. Weinberger, Anirban Dasgupta, John Langford, Alexander J. Smola, and Josh Attenberg. Feature hashing for large scale multitask learn- ing. In ICML, pages 1113-1120, 2009.","title":"Feature hashing for large scale multitask learning","authors":"Q Kilian, Anirban Weinberger, John Dasgupta, Alexander J Langford, Josh Smola, Attenberg","year":"2009","venue":"ICML","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}