Skip to main content

Documenting the Creation, Manipulation and Evaluation of Links for Reuse and Reproducibility

  • Conference paper
  • First Online:
Knowledge Engineering and Knowledge Management (EKAW 2022)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 13514))

  • 657 Accesses

Abstract

Data integration is an essential task in the open world of the Semantic Web. Many approaches have been proposed that achieve such integration by linking related entities across data providers, but they lack the support for in-depth documentation of the involved processes such as the creation, manipulation and evaluation of links. As a consequence, detailed documentation that eases the understanding and reproducibility of underlying processes is needed for a reliable reuse of graphs of identity available in the Semantic Web. We present here an approach to document such links and their processes, building upon a representation we call VoID+. It enables link-publishers to provide data-users with information that better support them in accessing and using links. We show that our approach with the proposed VoID+ ontology allows us to address the relevant competency questions around the reuse of integrated Semantic Web data. We also demonstrate how our approach has been successfully implemented in the Lenticular Lens, a user interface tool that annotates links it discovers, manipulates or validates under user’s guidance. Based on a real-life humanities case study, we can show that the ontology amply annotates links in its life-cycle for reliable decision making by data-users.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    For readability, we use the terms “links” and “identity links” interchangeably.

  2. 2.

    https://lenticularlens.goldenagents.org/.

  3. 3.

    https://www.w3.org/TR/prov-o/.

  4. 4.

    Co-referent is a term used in entity matching jargon to indicate a set of resources pointing to the same real-life object.

  5. 5.

    Details at https://lenticularlens.org/docs/03.Ontology/ and https://tinyurl.com/VoIDPlusGit.

  6. 6.

    https://github.com/VoIDPlus-owl/EKAW2022/blob/main/CQs_for_VoIDPlus__EKAW.pdf.

  7. 7.

    http://risis.eu/, https://www.clariah.nl/, https://www.goldenagents.org/.

  8. 8.

    The tool and the present use case implementation can found at:

    https://lenticularlens.goldenagents.org/?job_id=90b598f72088ebd0e21446a12e353ffd.

  9. 9.

    saa: https://archief.amsterdam/

    This paper uses the rdf version of saa data published by the Golden Agents project.

  10. 10.

    https://www.kb.nl/bronnen-zoekwijzers/kb-collecties/oude-drukken-tot-1801/gelegenheidsgedichten-16de-18de-eeuw.

  11. 11.

    https://lenticularlens.goldenagents.org/?job_id=90b598f72088ebd0e21446a12e353ffd.

  12. 12.

    https://github.com/knaw-huc/golden-agents-occasional-poetry/.

References

  1. Albertoni, R., Pérez, A.G.: Assessing linkset quality for complementing third-party datasets. In: Proceedings of Joint EDBT/ICDT 2013 Workshops, pp. 52–59. ACM, New York (2013). https://doi.org/10.1145/2457317.2457327

  2. Alexander, K., Cyganiak, R., Hausenblas, M., Zhao, J.: Describing linked datasets. In: Bizer, C., Heath, T., Berners-Lee, T., Idehen, K. (eds.) Proceedings of WWW 2009 Workshop on Linked Data on the Web, LDOW, vol. 538, pp. 10. CEUR-WS.org, Madrid (2009)

    Google Scholar 

  3. Beek, W., Raad, J., Wielemaker, J., van Harmelen, F.: sameAs.cc: the closure of 500M owl:sameAs statements. In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 65–80. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93417-4_5

    Chapter  Google Scholar 

  4. Böhm, C., Lorey, J., Naumann, F.: Creating void descriptions for web-scale data. J. Web Semant. 9(3), 339–345 (2011)

    Article  Google Scholar 

  5. Mendes de Farias, T., Stockinger, K., Dessimoz, C.: VoIDext: vocabulary and patterns for enhancing interoperable datasets with virtual links. In: Panetto, H., Debruyne, C., Hepp, M., Lewis, D., Ardagna, C.A., Meersman, R. (eds.) OTM 2019. LNCS, vol. 11877, pp. 607–625. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-33246-4_38

    Chapter  Google Scholar 

  6. Ferrara, A., Nikolov, A., Scharffe, F.: Data linking for the semantic web. Int. J. Semant. Web Inf. Syst. (IJSWIS) 7(3), 46–76 (2011)

    Google Scholar 

  7. Hartig, O.: RDF* and SPARQL*: an alternative approach to annotate statements in RDF. In: Nikitina, N., Song, D., Fokoue, A., Haase, P. (eds.) Proceedings of ISWC, vol. 1963. CEUR-WS.org, Vienna (2017)

    Google Scholar 

  8. Idrissou, A., Zamborlini, V., Harmelen, F.V., Latronico, C.: Contextual entity disambiguation in domains with weak identity criteria, pp. 259–262. ACM (9 2019). https://doi.org/10.1145/3360901.3364440

  9. Manola, F., Miller, E., McBride, B., et al.: RDF primer. In: W3C Recommendation , vol. 10, no. 1–107, p. 6 (2004)

    Google Scholar 

  10. Ngonga Ngomo, A.-C., et al.: LIMES: a framework for link discovery on the semantic web. KI - Künstliche Intelligenz, 413–423 (2021). https://doi.org/10.1007/s13218-021-00713-x

  11. Nguyen, V., Bodenreider, O., Sheth, A.P.: Don’t like RDF reification?: Making statements about statements using singleton property. In: Chung, C., Broder, A.Z., Shim, K., Suel, T. (eds.) 23rd International World Wide Web Conference, pp. 759–770. ACM, Seoul (2014). https://doi.org/10.1145/2566486.2567973

  12. Omitola, T., Zuo, L., Gutteridge, C., Millard, I.C., Glaser, H., Gibbins, N., Shadbolt, N.: Tracing the provenance of linked data using void. In: Proceedings of International Conference on Web Intelligence, Mining and Semantics, WIMS 2011. Association for Computing Machinery, New York (2011). https://doi.org/10.1145/1988688.1988709

  13. Orlandi, F., Graux, D., O’Sullivan, D.: Benchmarking RDF metadata representations: Reification, singleton property and RDF. In: 15th IEEE ICSC, CA, USA. pp. 233–240. IEEE (2021). https://doi.org/10.1109/ICSC50631.2021.00049

  14. Raad, J., Beek, W., van Harmelen, F., Pernelle, N., Saïs, F.: Detecting erroneous identity links on the web using network metrics. In: Vrandečić, D., et al. (eds.) ISWC 2018. LNCS, vol. 11136, pp. 391–407. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00671-6_23

    Chapter  Google Scholar 

  15. Volz, J., Bizer, C., Gaedke, M., Kobilarov, G.: Discovering and maintaining links on the web of data. In: Bernstein, A., et al. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 650–665. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04930-9_41

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Al Idrissou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Idrissou, A., Zamborlini, V., Kuhn, T. (2022). Documenting the Creation, Manipulation and Evaluation of Links for Reuse and Reproducibility. In: Corcho, O., Hollink, L., Kutz, O., Troquard, N., Ekaputra, F.J. (eds) Knowledge Engineering and Knowledge Management. EKAW 2022. Lecture Notes in Computer Science(), vol 13514. Springer, Cham. https://doi.org/10.1007/978-3-031-17105-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-17105-5_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-17104-8

  • Online ISBN: 978-3-031-17105-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics