CURRENTLY PATERNITY LEAVE. Notes on my work with (cultural heritage) FAIR data. Topics cover Programming, Open Science, Digital Humanities, Knowledge Graphs, Linked Data, Metadata, data catalogs, Wikidata, RDF, SPARQL and the Semantic Web.

Royal Library of Belgium

Sven Lieber

Hi everyone,  today’s summer-break edition is for anyone who likes free and open knowledge. There is a short video that explains the intriguing new
<strong>
 Wikifunctions
</strong>
project. Besides that I will talk about my experiences of creating a Wikidata page about a company, hopefully it inspires you to also contribute to free and open knowledge.

FAIR Data Digest #11

Hi everyone,  last week I told you about
<em>
 European Research Infrastructures Consortia
</em>
or ERIC in short. Today we gonna look into one of these ERICs that is active in the Cultural Heritage field. I also have to celebrate a tiny anniversary related to Wikidata and I will share a resource about FAIR Jupyter notebooks.

FAIR Data Digest #7

Dear subscriber,  Welcome to the first edition of my new weekly newsletter! Within different recurring categories I will provide updates of my work, my personal journey, and topics such as Knowledge Graphs, Linked Data, FAIR data, Open Science and many more. It is conference season!

FAIR Data Digest #1

Hi everyone,  today’s edition is about FAIR data that is not necessarily related to cultural heritage, but related to cars 🚗. We will have a look into an Open Data dataset of the Dutch government that provides data which hopefully helps me to answer some questions about
<strong>
 child safety seats
</strong>
. Statistics shown in this post come from this GitHub repository.

FAIR Data Digest #23

Hi everyone,  I hope you had a great summer. The academic year is about to start and I hope you are hungry for some knowledge :-) In today’s edition I want to introduce you to the European Open Science Cloud (EOSC).  ::: {.subscription-widget-wrap attrs=“{"url":"https://fairdata.substack.com/subscribe?","text":"Subscribe","language":"en"}” component-name=“SubscribeWidgetToDOM”}  Thanks for reading FAIR Data Digest!

FAIR Data Digest #14

Hi everyone,  this last summer-break edition ties in with the previous edition. Last week I’ve wrote over research to make
<strong>
 publication metadata
</strong>
from the free publishing service CEUR-WS
<strong>
 available in a FAIR fashion
</strong>
, such that the data can be explored.

FAIR Data Digest #13

Hi everyone,  welcome to the 3rd edition of my newsletter! Besides the fact that we have suffered the first official heat wave in Belgium this year, I have other hot information to share.

FAIR Data Digest #3

Dear subscriber,  welcome to the second edition of the newsletter and also a warm welcome to all new subscribers. It has been an interesting week. In this edition I will talk about some work updates, a one-day workshop I’ve attended last week and I have a video recommendation.

FAIR Data Digest #2

Hi everyone,  welcome to today’s edition on the the
<em>
 European Day of Languages
</em>
(Q496423).  ::: {.subscription-widget-wrap attrs=“{"url":"https://fairdata.substack.com/subscribe?","text":"Subscribe","language":"en"}” component-name=“SubscribeWidgetToDOM”}  Thanks for reading FAIR Data Digest! Subscribe for free to receive new posts and support my work.

FAIR Data Digest #17

Hi everyone,  in today’s slightly more technical edition I will focus on my recent encounters with the Linked Data query language SPARQL. Many of you may know it as a language to retrieve data (possibly from Wikidata). I mainly use it for a project where I recently found some performance issues that could be resolved by either rewriting the query or changing the approach.

FAIR Data Digest #22

Hello everyone,  welcome to today’s Halloween edition about
<em>
 data anti-patterns
</em>
that hopefully will scare you so much you don’t do them :-) Things you better avoid when aiming for FAIR data. Anti patterns?

FAIR Data Digest #20

Hi everyone,  greetings from Karlsruhe in Germany where I am attending a conference about research data infrastructure at the moment.

FAIR Data Digest #15

Hi everyone,  I’m on vacation now, but thanks to pre-scheduling you won’t miss out FAIR data updates! Today I want to share with you a research paper in which the authors report on the creation of large amounts of FAIR data which they host on Wikidata.

FAIR Data Digest #12

Hi everyone,  it has been a while since we talked about research infrastructures. Many of them might sound abstract or just like super specialized app stores. But today we have a brief look into something very tangible: heritage objects that are analyzed by instruments or are digitized in other forms. There is lots of diverse data in Heritage Science. ❓ FAIR Buzzword Bingo: what is E-RIHS?

FAIR Data Digest #21

Hi everyone,  welcome back to today’s edition in which I share a work update related to bibliographic data and provide information to an upcoming interesting talk. ::: {.subscription-widget-wrap attrs=“{"url":"https://fairdata.substack.com/subscribe?","text":"Subscribe","language":"en"}” component-name=“SubscribeWidgetToDOM”}  Thanks for reading FAIR Data Digest! Subscribe for free to receive new posts and support my work.

FAIR Data Digest #19

Hi everyone,  this edition starts with two announcements before it dives into the topic of software engineering skills for data science. This newsletter started as a
<strong>
 weekly newsletter
</strong>
in which I shared topics around FAIR data and updates about my work. Selecting one or more topics each week is fun and helps myself to
<em>
 summarize
</em>
and
<em>
 understand
</em>
topics better.

FAIR Data Digest #18

Hi everyone,  welcome to another summer-break edition. This time with a webinar recording about persistent identifiers for FAIR data and news about data cataloging with DCAT both in Europe and the US.  ::: {.subscription-widget-wrap attrs=“{"url":"https://fairdata.substack.com/subscribe?","text":"Subscribe","language":"en"}” component-name=“SubscribeWidgetToDOM”}  Thanks for reading FAIR Data Digest!

FAIR Data Digest #10

Hi everyone,  greetings to one of our summer editions! Whether you're on vacation, just back, or about to head off, I've got some interesting content to share with you.

FAIR Data Digest #9

Hi everyone,  in today’s edition I will try to explain what DARIAH / CLARIAH is and what they do in the context of FAIR data. I am also sharing a video of some recent presentations about Wikipedia from the Wikimedia Research Showcase. ::: {.subscription-widget-wrap attrs=“{"url":"https://fairdata.substack.com/subscribe?","text":"Subscribe","language":"en"}” component-name=“SubscribeWidgetToDOM”}  Thanks for reading FAIR Data Digest!

FAIR Data Digest #8

Hi everyone,  if you are a researcher and you want to follow the FAIR data principles you are not left alone. In today’s edition I will try to explain what ERIC is and what they have to do with FAIR data. As for work updates: I was on a small camping vacation in France, so there are no work updates, but I came back with many ideas for the future!

FAIR Data Digest #6

Hi everyone,  did you ever wonder how FAIR data is put into practice? This week I went down the rabbit hole and what I brought back is the start of a new series to
<strong>
 unravel the many FAIR data initiatives
</strong>
. There are also some good news for (Belgian) FAIR data in my work update!

FAIR Data Digest #5

Hi everyone,  this week it’s all about hands-on! I will talk about a webinar on trying to fix quality issues in Wikidata by using its ontology. Additionally I will share a few resources around basics and advanced uses of the query language SPARQL that is used to query Linked Data, for example from Wikidata.

FAIR Data Digest #4

Hi everyone,  as promised, today you will hear more about the research data infrastructure conference where I and around
<strong>
 680 other people
</strong>
attended last week in Karlsruhe, Germany. Grab a cup of coffee of tea and enjoy today’s edition!

FAIR Data Digest #16

FAIR Data Digest

Hi everyone,

welcome back to today's edition in which I share a work update related
to bibliographic data and provide information to an upcoming interesting
talk.

::: {.subscription-widget-wrap attrs="{\"url\":\"https://fairdata.substack.com/subscribe?\",\"text\":\"Subscribe\",\"language\":\"en\"}" component-name="SubscribeWidgetToDOM"}
::: {.subscription-widget .show-subscribe}
::: {.preamble}
Thanks for reading FAIR Data Digest! Subscribe for free to receive new
posts and support my work.
:::

::: {.fake-input-wrapper}
::: {.fake-input}
:::

::: {.fake-button}
:::
:::
:::
:::

🏢 Books exist in many different versions. The same book might be
published as paperback or as ebook and that even in different
translations. Both for user experience and data quality it is
interesting to cluster the bibliographic records of such editions of a
book together. Algorithms to do that were described in several research
papers in the past. But I couldn't find any easy to use open source
tool. In today's work update I talk about the clustering and **present a
fast implementation in Python that I developed recently** that hopefully
can easily be reused. \#FAIRsoftware.

📅 Are you interested in Digital Humanities or are you curious about
Belgian journalism? Join us **next Monday** for the next online session
of The **DH virtual discussion group for early career researchers**
where [Sergio Alonso
Mislata](https://www.linkedin.com/in/sergio-alonso-mislata-24646113b/)
will present behind the scenes of his work for the *Centre for Archives
on the Media and Information
([CAMille](https://www.kbr.be/en/projects/camille/))*, a joint lab
between the Royal Library of Belgium and the Université Libre de
Bruxelles (ULB).

[DH Virtual Discussion
Group](https://bib.kuleuven.be/english/artes/artesresearch/dh-virtual-discussion-group){.button
.primary}

<div>

------------------------------------------------------------------------

</div>

# 🏢 Work update: FRBR clustering {#work-update-frbr-clustering}

<div>

------------------------------------------------------------------------

</div>

What do the books \"*The invention of Nature*\" and \"*De uitvinder van
de natuur*\" have in common? Well, they are all different versions of
the same *work* \"*The invention of nature*\" by Andrea Wulf
([Q24908385](https://www.wikidata.org/wiki/Q24908385)), whether it is in
a different format or a different language. In technical terms, these
records are on the so-called *manifestation* level. But for simplicity I
will refer to them simply as book versions.

Library catalogs usually contain records of all the different versions.
However, identifying the higher *work* level has advantages for both the
librarians and the users of the catalog. In today's work update (no pun
intended) I want to talk about how I recently did this for the BELTRANS
project in a performant way using a so-called *inverted index*.

A few research papers were published in the past decade about how one
can cluster manifestation-level book descriptions in library catalogs to
work-level records. I collected a few relevant references in [a
list](https://orkg.org/list/R608176) at the Open Research Knowledge
Graph (ORKG) ([Q108127463](https://www.wikidata.org/wiki/Q108127463)).

::: {.captioned-image-container}
<figure>
<a
href="https://substackcdn.com/image/fetch/f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F634bd2ba-8094-484c-86eb-42c74db841ea_1399x478.jpeg"
class="image-link is-viewable-img image2" target="_blank"
data-component-name="Image2ToDOM"></a>
<div class="image2-inset">
<img
src="https://substackcdn.com/image/fetch/w_1456,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F634bd2ba-8094-484c-86eb-42c74db841ea_1399x478.jpeg"
class="sizing-normal"
data-attrs="{&quot;src&quot;:&quot;https://substack-post-media.s3.amazonaws.com/public/images/634bd2ba-8094-484c-86eb-42c74db841ea_1399x478.jpeg&quot;,&quot;srcNoWatermark&quot;:null,&quot;fullscreen&quot;:null,&quot;imageSize&quot;:null,&quot;height&quot;:478,&quot;width&quot;:1399,&quot;resizeWidth&quot;:null,&quot;bytes&quot;:88986,&quot;alt&quot;:null,&quot;title&quot;:null,&quot;type&quot;:&quot;image/jpeg&quot;,&quot;href&quot;:null,&quot;belowTheFold&quot;:true,&quot;topImage&quot;:false,&quot;internalRedirect&quot;:null}"
srcset="https://substackcdn.com/image/fetch/w_424,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F634bd2ba-8094-484c-86eb-42c74db841ea_1399x478.jpeg 424w, https://substackcdn.com/image/fetch/w_848,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F634bd2ba-8094-484c-86eb-42c74db841ea_1399x478.jpeg 848w, https://substackcdn.com/image/fetch/w_1272,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F634bd2ba-8094-484c-86eb-42c74db841ea_1399x478.jpeg 1272w, https://substackcdn.com/image/fetch/w_1456,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F634bd2ba-8094-484c-86eb-42c74db841ea_1399x478.jpeg 1456w"
sizes="100vw" loading="lazy" width="1399" height="478" />
<div class="image-link-expand">
<img
src="data:image/svg+xml;base64,PHN2ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciIHdpZHRoPSIxNiIgaGVpZ2h0PSIxNiIgdmlld2JveD0iMCAwIDI0IDI0IiBmaWxsPSJub25lIiBzdHJva2U9IiNGRkZGRkYiIHN0cm9rZS13aWR0aD0iMiIgc3Ryb2tlLWxpbmVjYXA9InJvdW5kIiBzdHJva2UtbGluZWpvaW49InJvdW5kIiBjbGFzcz0ibHVjaWRlIGx1Y2lkZS1tYXhpbWl6ZTIgIj48cG9seWxpbmUgcG9pbnRzPSIxNSAzIDIxIDMgMjEgOSI+PC9wb2x5bGluZT48cG9seWxpbmUgcG9pbnRzPSI5IDIxIDMgMjEgMyAxNSI+PC9wb2x5bGluZT48bGluZSB4MT0iMjEiIHgyPSIxNCIgeTE9IjMiIHkyPSIxMCI+PC9saW5lPjxsaW5lIHgxPSIzIiB4Mj0iMTAiIHkxPSIyMSIgeTI9IjE0Ij48L2xpbmU+PC9zdmc+"
class="lucide lucide-maximize2" />
</div>
</div>
<figcaption>An illustration of how the clustering algorithm finds
matches: for each book version (red) multiple descriptive keys are
created (blue). If at least one such key overlaps the two book versions
should be clustered together.</figcaption>
</figure>
:::

What I missed so far is a practical modern implementation. Something
that does not require to install a whole XML-based software stack and a
Java application. I implemented such a **clustering algorithm in
Python** and released it in a GitHub repository from the Royal Library
of Belgium (DOI:
[10.5281/zenodo.10011416)](https://zenodo.org/doi/10.5281/zenodo.10011416).
Check out my blog where I provide some more details and
behind-the-scenes.

[Read the full blog post for
details](https://doi.org/10.59350/4hd4r-1tk44){.button .primary}

<div>

------------------------------------------------------------------------

</div>

That's it for this week of the FAIR Data Digest. If you found the
content interesting, please share and subscribe. See you *in two weeks*!

Sven

::: {.captioned-button-wrap attrs="{\"url\":\"https://fairdata.substack.com/p/fair-data-digest-19?utm_source=substack&utm_medium=email&utm_content=share&action=share\",\"text\":\"Share\"}" component-name="CaptionedButtonToDOM"}
::: {.preamble}
Thank you for reading FAIR Data Digest. This post is public so feel free
to share it.
:::

[Share](https://fairdata.substack.com/p/fair-data-digest-19?utm_source=substack&utm_medium=email&utm_content=share&action=share){.button
.primary}
:::
