KG20C & KG20C-QA: Scholarly Knowledge Graph Benchmarks for Link Prediction and Question Answering
University of Information Technology, Vietnam(越南信息技术大学);Vietnam National University, Ho Chi Minh City(越南国立大学胡志明市分校);National Institute of Informatics(日本国立情报学研究所);The Graduate University for Advanced Studies, SOKENDAI(综合研究大学院大学)
Hung-Nghiep Tran, Atsuhiro Takasu
备注:
extracted and extended from author's PhD thesis, "Multi-Relational Embedding for Knowledge Graph Representation and Analysis"
In this paper, we present KG20C and KG20C-QA, two curated datasets for advancing question answering (QA) research on scholarly data. KG20C is a high-quality scholarly knowledge graph constructed from the Microsoft Academic Graph through targeted selection of venues, quality-based filtering, and schema definition. Although KG20C has been available online in non-peer-reviewed sources such as GitHub repository, this paper provides the first formal, peer-reviewed description of the dataset, including clear documentation of its construction and specifications. KG20C-QA is built upon KG20C to support QA tasks on scholarly data. We define a set of QA templates that convert graph triples into natural language question--answer pairs, producing a benchmark that can be used both with graph-based models such as knowledge graph embeddings and with text-based models such as large language models. We benchmark standard knowledge graph embedding methods on KG20C-QA, analyze performance across relation types, and provide reproducible evaluation protocols. By officially releasing these datasets with thorough documentation, we aim to contribute a reusable, extensible resource for the research community, enabling future work in QA, reasoning, and knowledge-driven applications in the scholarly domain. The full datasets will be released at https://github.com/tranhungnghiep/KG20C/ upon paper publication.
NeuroSym-BioCAT: Leveraging Neuro-Symbolic Methods for Biomedical Scholarly Document Categorization and Question Answering
TIB—Leibniz Information Centre for Science and Technology(莱布尼茨科学与技术信息中心(TIB));L3S Research Center, Leibniz University Hannover(汉诺威莱布尼茨大学L3S研究中心);Daffodil International University(水仙国际大学)
Cleaning Noisy and Heterogeneous Metadata for Record Linking Across Scholarly Big Datasets
从PDF格式的学术文档中自动提取的元数据通常是嘈杂和异构的,通常包含不完整的字段和错误的值。清理元数据的一种常见方法是使用书目参考数据集。挑战在于以高精度匹配语料库之间的记录。现有的解决方案是基于信息检索和字符串相似性的标题,只有当标题是干净的。我们介绍了一个系统,旨在匹配学术文档实体与噪声元数据对参考数据集。blocking函数使用经典的BM25算法从ElasticSearch索引的参考数据中找到匹配的候选项。核心组件使用监督方法,结合从所有可用的元数据字段中提取的特征。该系统还利用可用的引用信息来匹配实体。元数据和引用的组合实现了高准确性,在相同的测试数据集上显著优于基线方法。我们应用这个系统来匹配CiteSeerX对Web of Science,PubMed和DBLP的数据库。这种方法将部署在CiteSeerX系统中,以清理元数据并将记录链接到其他学术大数据集。
Covid-19 pandemic and the unprecedented mobilisation of scholarly efforts prompted by a health crisis: Scientometric comparisons across SARS, MERS and 2019-nCov literature
The Science Data Lake: A Unified Open Infrastructure Integrating 293 Million Papers Across Eight Scholarly Sources with Embedding-Based Ontology Alignment