W3C home > Mailing lists > Public > public-xg-lld@w3.org > September 2010

Re: [DIGLIB] Call for Use Cases: Library Linked Data

From: Antoine Isaac <aisaac@few.vu.nl>
Date: Wed, 08 Sep 2010 10:30:52 +0200
Message-ID: <4C8749BC.5030909@few.vu.nl>
To: Günter Mühlberger <guenter.muehlberger@uibk.ac.at>
CC: public-xg-lld <public-xg-lld@w3.org>
Dear Günter,


> my name is Guenter Muehlberger, I am head of the Department for
> Digitisation and Digital Preservation at the University Innsbruck
> Library. We are involved in several digital library projects and believe
> that the idea of linked data is of high benefit for libraries.
>
> Please find my (short) answers to your questionnaire below!


Thank you very much for this extremely fast contribution!
Your answers may be short indeed. But as said our call any contribution was welcome, and we meant it. As a matter of fact I can see that your case can be used to substantiate some core library linked data requirements, which is very valuable for us.

Best regards,

Antoine


>
> Best,
>
> Guenter
>
>
> ================================================================
> ================================================================
>
> === Name ===
>
> Identification and deduplication of library records
>
> === Owner ===
>
> Guenter Muehlberger
>
> === Background and Current Practice ===
>
> Libraries have recorded their books in their electronic catalogues. Due
> to several reasons the records are often rather similar, but not
> identical. Moreover in many cases (such as in Austria or the Eastern
> European countries) the number of historical books already fully
> recorded (e.g. with MARC21) is rather low. Often just the scanned images
> of index cards are existing or just short title catalogues.
> If one wants to improve the situation currently matching of different
> library records is done semi-automatically or even manually which
> requires high effort.
>
> === Goal ===
>
> The objective is to find automated matching algorithm for library
> records, so that finally only ONE record exists for every single
> intellectual item. These matching algorithms need reference data.
> Currently access to these reference data (e.g. the API of the WorldCat)
> is limited, resp. commercially exploited. If many libraries would offer
> their records via linked data, we would have more reference data which
> makes it much easier to match and identify library records.
>
> === Target Audience ===
>
> Libraries and service providers for libraries. They could easier
> identify and get the best metadata for a (historic) book. End-user who
> will no more deal with dozens of the similar descriptions of the same
> book, but with one single record (with links to the local catalogues).
>
> === Use Case Scenario ===
>
> 1. Users search library catalogues, or the web for books. They will not
> receive dozens of the similar descriptions of the same book, but a
> single records with links to the several copies.
> 2. A network of libraries wants to unify its records by matching them
> into on. More or less the same process as above, the final result is the
> best record for a book.
>
>
> === Application of linked data for the given use case ===
>
> The are many matching algorithm around, we in Innsbruck have a prototyp
> running from a master thesis which is tuned to work with the scenario
> above.
>
> === Existing Work (optional) ===
>
> S. above.
>
> === Related Vocabularies (optional) ===
>
> === Problems and Limitations (optional) ===
>
> The scenario is rather easy to achieve but has nevertheless many
> benefits for the community.
>
> === Related Use Cases and Unanticipated Uses (optional) ===
>
> === References (optional) ===
>
>
Received on Wednesday, 8 September 2010 08:31:27 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Wednesday, 8 September 2010 08:31:32 GMT