Use of a Structured Knowledge Base Enhances Metadata Curation by Large Language Models
Not on the map. Why?
Abstract (arXiv)
Metadata play a crucial role in ensuring the findability, accessibility, interoperability, and reusability of datasets. This paper investigates the potential of large language models (LLMs), specifically GPT-4, to improve adherence to metadata standards. We conducted experiments on 200 random data records describing human samples relating to lung cancer from the NCBI BioSample repository, evaluating GPT-4's ability to suggest edits for adherence to metadata standards. We computed the adherence accuracy of field name-field value pairs through a peer review process, and we observed a marginal average improvement in adherence to the standard data dictionary from 79% to 80% (p<0.5). We then prompted GPT-4 with domain information in the form of the textual descriptions of CEDAR templates and recorded a significant improvement to 97% from 79% (p<0.01). These results indicate that, while LLMs may not be able to correct legacy metadata to ensure satisfactory adherence to standards when unaided, they do show promise for use in automated metadata curation when integrated with a structured knowledge base
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 16 references that are in the map. First posted on arXiv 8 Apr 2024.
Builds on
5 of 16 references.
References · 5
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2023A Benchmark to Understand the Role of Knowledge Graphs on Large Language Model's Accuracy for Question Answering on Enterprise SQL Databasescited by 25
- 2019Aligning Biomedical Metadata with Ontologies Using Clustering and Embeddingscited by 4
- 2018The variable quality of metadata about biological samples used in biomedical experimentscited by 3
- 2019The CEDAR Workbench: An Ontology-Assisted Environment for Authoring Metadata that Describe Scientific Experimentscited by 3
Built on by
Citing papers per year: 2024: 2.
2 papers.