Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3360901.3364427acmconferencesArticle/Chapter ViewAbstractPublication Pagesk-capConference Proceedingsconference-collections
research-article

Several Link Keys are Better than One, or Extracting Disjunctions of Link Key Candidates

Published: 23 September 2019 Publication History
  • Get Citation Alerts
  • Abstract

    Link keys express conditions under which instances of two classes of different RDF data sets may be considered as equal. As such, they can be used for data interlinking. There exist algorithms to extract link key candidates from RDF data sets and different measures have been defined to evaluate the quality of link key candidates individually. For certain data sets, however, it may be necessary to use more than one link key on a pair of classes to retrieve a more complete set of links. To this end, in this paper, we define disjunction of link keys, propose strategies to extract disjunctions of link key candidates from RDF data, and apply existing quality measures to evaluate them. We also report on experiments with these strategies.

    References

    [1]
    Manel Achichi, Mohamed Ben Ellefi, Danai Symeonidou, and Konstantin Todorov. 2016. Automatic key selection for data linking. In Knowledge Engineering and Knowledge Management - 20th International Conference, EKAW 2016, Bologna, Italy, November 19--23, 2016, Proceedings (LNCS), Vol. 10024. 3--18.
    [2]
    Mustafa Al-Bakri, Manuel Atencia, Jérôme David, Steffen Lalande, and Marie-Christine Rousset. 2016. Uncertainty-sensitive reasoning for inferring sameAs facts in linked data. In ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016) (Frontiers in Artificial Intelligence and Applications), Vol. 285. IOS Press, 698--706.
    [3]
    Mustafa Al-Bakri, Manuel Atencia, Steffen Lalande, and Marie-Christine Rousset. 2015. Inferring same-as facts from Linked Data: an iterative import-by-query approach. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25--30, 2015, Austin, Texas, USA. AAAI Press, 9--15.
    [4]
    Manuel Atencia, Jé rô me David, and Jé rô me Euzenat. 2014. Data interlinking through robust linkkey extraction. In ECAI 2014 - 21st European Conference on Artificial Intelligence, 18--22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014) (Frontiers in Artificial Intelligence and Applications), Vol. 263. IOS Press, 15--20.
    [5]
    Manuel Atencia, Jérôme David, Jérôme Euzenat, Amedeo Napoli, and Jérémy Vizzini. 2019. Link key candidate extraction with relational concept analysis. Discrete applied mathematics (2019). https://dx.doi.org/10.1016/j.dam.2019.02.012
    [6]
    Manuel Atencia, Jérôme David, and Franccois Scharffe. 2012. Keys and pseudo-keys detection for web datasets cleansing and interlinking. In Knowledge Engineering and Knowledge Management - 18th International Conference, EKAW 2012, Galway City, Ireland, October 8--12, 2012. Proceedings (LNCS), Vol. 7603. Springer, 144--153.
    [7]
    Jérôme Euzenat and Pavel Shvaiko. 2013. Ontology matching 2nd ed.). Springer, Heidelberg (DE).
    [8]
    Houssameddine Farah, Danai Symeonidou, and Konstantin Todorov. 2017. KeyRanker: Automatic RDF key ranking for data linking. In Proceedings of the Knowledge Capture Conference, K-CAP 2017, Austin, TX, USA, December 4--6, 2017 . ACM, 7:1--7:8.
    [9]
    Alfio Ferrara, Andriy Nikolov, and Franccois Scharffe. 2011. Data Linking for the Semantic Web. International Journal of Semantic Web and Information Systems, Vol. 7, 3 (2011), 46--76.
    [10]
    Bernhard Ganter and Rudolf Wille. 1999. Formal Concept Analysis. Springer, Berlin, DE.
    [11]
    Vijay Garg. 2015. Introduction to lattice theory with computer science applications .John Wiley and sons.
    [12]
    Aidan Hogan, Antoine Zimmermann, Jü rgen Umbrich, Axel Polleres, and Stefan Decker. 2012. Scalable and distributed methods for entity matching, consolidation and disambiguation over linked data corpora. Journal of Web Semantics, Vol. 10 (2012), 76--110.
    [13]
    Robert Isele and Christian Bizer. 2013. Active learning of expressive linkage rules using genetic programming. Journal of Web Semantics, Vol. 23 (2013), 2--15.
    [14]
    Markus Nentwig, Michael Hartung, Axel-Cyrille Ngonga Ngomo, and Erhard Rahm. 2017. A survey of current link discovery frameworks. Semantic Web, Vol. 8, 3 (2017), 419--436.
    [15]
    Axel-Cyrille Ngonga Ngomo and Sören Auer. 2011. LIMES: A time-efficient approach for large-scale link discovery on the Web of Data. In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16--22, 2011 . IJCAI/AAAI, 2312--2317.
    [16]
    Fatiha Saïs, Nathalie Pernelle, and Marie-Christine Rousset. 2007. L2R: A Logical Method for Reference Reconciliation. In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, July 22--26, 2007, Vancouver, British Columbia, Canada. AAAI Press, 329--334.
    [17]
    Mohamed Ahmed Sherif, Axel-Cyrille Ngonga Ngomo, and Jens Lehmann. 2017. Wombat - A generalization approach for automatic link discovery. In The Semantic Web - 14th International Conference, ESWC 2017, Portorovz, Slovenia, May 28 - June 1, 2017, Proceedings, Part I (LNCS), Vol. 10249. Springer, 103--119.
    [18]
    Danai Symeonidou, Vincent Armant, Nathalie Pernelle, and Fatiha Sa"i s. 2014. SAKey: Scalable Almost Key Discovery in RDF Data. In The Semantic Web - ISWC 2014 - 13th International Semantic Web Conference, The Semantic Web - ISWC 2014 - 13th International Semantic Web Conference, (LNCS), Vol. 8796. Springer, 33--49.
    [19]
    Julius Volz, Christian Bizer, Martin Gaedke, and Georgi Kobilarov. 2009. Silk -- A link discovery framework for the Web of Data. In Proceedings of the WWW2009 Workshop on Linked Data on the Web, LDOW 2009, Madrid, Spain, April 20, 2009. (CEUR Workshop Proceedings), Vol. 538. CEUR-WS.org.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    K-CAP '19: Proceedings of the 10th International Conference on Knowledge Capture
    September 2019
    281 pages
    ISBN:9781450370080
    DOI:10.1145/3360901
    • General Chairs:
    • Mayank Kejriwal,
    • Pedro Szekely,
    • Program Chair:
    • Raphaël Troncy
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 23 September 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. antichain
    2. data interlinking
    3. link key
    4. linked data
    5. rdf

    Qualifiers

    • Research-article

    Funding Sources

    • Agence Nationale de la Recherche

    Conference

    K-CAP '19
    Sponsor:
    K-CAP '19: Knowledge Capture Conference
    November 19 - 21, 2019
    CA, Marina Del Rey, USA

    Acceptance Rates

    Overall Acceptance Rate 55 of 198 submissions, 28%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 56
      Total Downloads
    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 10 Aug 2024

    Other Metrics

    Citations

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media