将文物数据转化为可机器解析的智能知识图谱。
Automated Construction of FAIR Digital Object Knowledge Graphs from Flat Cultural Heritage Records
- 用大模型自动识别元数据中应转为唯一标识符的条目。
- 处理637条考古记录,86%的字段成功链接,58.5%原无标识的值被解析。
- 跨语言同义合并准确率达17/33,适合文化遗产数字化项目使用。
FAIR数字对象(FDO)框架要求元数据值尽可能用持久标识符(PID)表示,以构建全机器可操作的知识图谱。欧洲纳数据模型设计早于FDO规范,多数元数据以纯文本存储,不利于自动化处理。本文提出一条流水线,将扁平化的欧洲纳记录转化为符合FDO标准、基于CIDOC-CRM结构的知识图谱。每个遗产实体被建模为具有独立PID、类型、配置文件和元数据层的FDO。核心挑战在于自动区分必须转为PID引用的值与可保留为字面量的值(如注释、测量值、日期)。我们采用大语言模型对每项元数据进行分类,将其路由至受控词汇表(Getty AAT、Wikidata、VIAF、PeriodO),并链接到共享实体FDO。在来自五个欧洲纳提供方的637条考古记录上评估,该管道成功链接86%的元数据槽位,其中58.5%的值为欧洲纳原先未增强的。同时,它合并了字节相同的匹配无法识别的跨语言表面形式,33组中17组经人工审核确认正确。图谱连通性不仅依赖字符串匹配,更关键的是每个节点都具备类型且可解析。
原文摘要 · Abstract (English)
The FAIR Digital Object (FDO) framework mandates that metadata attribute values be expressed as persistent identifiers (PIDs) wherever possible, to produce a fully machine-actionable graph in which every reference is resolvable. The Europeana Data Model was designed long before the FDO specification, and it stores most metadata values as plain text. This serves human browsing well enough, but gives an automated agent nothing to follow across records or collections. We present a pipeline that transforms flat Europeana records into an FDO-compliant knowledge graph structured with CIDOC-CRM. Following the FDO specification, we model every heritage entity as a discrete FDO with its own PID, type, profile, and metadata layer. The core technical challenge is automating the FDO-prescribed distinction between values that must become PID references (resolvable entities) and those that may remain literals (terminal leaves such as notes, measurements, and dates). We address this with a large language model that classifies each metadata value, routes it to a controlled vocabulary (Getty AAT, Wikidata, VIAF, PeriodO), and links it to a shared entity FDO. We evaluate using 637 archaeological records from five Europeana providers, processing each with the LLM. The pipeline links 86% of metadata slots, resolving 58.5% of values Europeana had not already enriched. It also merges cross-lingual surface forms that byte-identical matching keeps apart, where 17 of 33 such merges are correct on manual review. Graph connectivity does not separate this from string matching; what distinguishes the FDO graph is that every node is typed and resolvable.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。