Despite their large-scale coverage, cross-domain knowledge graphs invariably suffer from inherent incompleteness and sparsity. Link prediction can alleviate this by inferring a target entity, given a source entity and a query relation. Recent embedding-based approaches operate in an uninterpretable latent semantic vector space of entities and relations, while path-based approaches operate in the symbolic space, making the inference process explainable. However, these approaches typically consider static snapshots of the knowledge graphs, severely restricting their applicability for evolving knowledge graphs with newly emerging entities. To overcome this issue, we propose an inductive representation learning framework that is able to learn representations of previously unseen entities. Our method finds reasoning paths between source and target entities, thereby making the link prediction for unseen entities interpretable and providing support evidence for the inferred link.
TempEL: Linking Dynamically Evolving and Newly Emerging Entities
Ghent University – imec(根特大学-imec微电子研究中心);University of Copenhagen(哥本哈根大学)
在我们不断发展的世界中,实体随着时间的推移而变化,新的,以前不存在或未知的实体出现。我们研究这种进化的情况下如何影响一个完善的实体链接(EL)任务的性能。在这项研究中,我们引入了TempEL,这是一个实体链接数据集,由2013年至2022年的时间分层英文维基百科快照组成,从中我们收集了实体的锚点提及和这些目标实体的描述。通过捕获这样的时间方面,我们新引入的TempEL资源与当前现有的实体链接数据集形成对比,实体链接数据集由链接到目标知识库的单个静态版本的固定提及组成(例如,Wikipedia 2010 for CoNLL-AIDA)。事实上,对于我们收集的每个时间快照,TempEL包含到连续实体的链接,即,在所有的年份中发生,以及在某个时候首次出现的全新实体。因此,我们能够量化当前最先进的EL模型的性能,用于:(i)在其知识库描述以及其提及的上下文中随时间变化的实体,以及(ii)先前不存在的新创建的实体(例如,在EL模型被训练的时候)。我们的实验结果表明,在时间性能下降方面,(i)连续实体遭受高达3.1%的EL准确性下降,而(ii)对于新实体,这种准确性下降高达17.9%。这突出了所引入的TempEL数据集的挑战,并在时间演化实体消歧领域开辟了新的研究前景。
Enhancing Disinformation Detection with Explainable AI and Named Entity Replacement
Advanced Studies Center in ICT (CEATIC)(ICT高级研究中心(CEATIC));Universidad de Jaén(哈恩大学);Universidad de Castilla-La Mancha(卡斯蒂利亚-拉曼恰大学);Universidad de Granada(格拉纳达大学)
Explainable Natural Language Processing for Corporate Sustainability Analysis
College of Design and Engineering, National University of Singapore(新加坡国立大学设计与工程学院);Asian Institute of Digital Finance, National University of Singapore(新加坡国立大学亚洲数字金融研究所);College of Computing and Data Science, Nanyang Technological University(南洋理工大学计算与数据科学学院);Institute of High Performance Computing, Agency for Science, Technology and Research(新加坡科学技术研究局高性能计算研究所);Sustainable and Green Finance Institute, National University of Singapore(新加坡国立大学可持续与绿色金融研究所);NUS Business School, National University of Singapore(新加坡国立大学商学院)
One Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completion
School of Computer Science, Central China Normal University(华中师范大学计算机学院);Faculty of Artificial Intelligence in Education, Central China Normal University(华中师范大学人工智能教育学部);School of Computer Science, Wuhan University(武汉大学计算机学院);York University(约克大学)
UM6P-CS at SemEval-2022 Task 11: Enhancing Multilingual and Code-Mixed Complex Named Entity Recognition via Pseudo Labels using Multilingual Transformer
Mohammed VI Polytechnic University(穆罕默德六世理工大学);Sidi Mohamed Ben Abdellah University(西迪·穆罕默德·本·阿卜杜拉大学);University of Sherbrooke(舍布鲁克大学)
Meta-Learning Based Knowledge Extrapolation for Knowledge Graphs in the Federated Setting
Zhejiang University(浙江大学);Huawei Technologies Co., Ltd.(华为技术有限公司);Alibaba Group(阿里巴巴集团);ZJU-Hangzhou Global Scientific and Technological Innovation Center(浙江大学杭州国际科创中心);Alibaba-Zhejiang University Joint Institute of Frontier Technologies(阿里巴巴-浙江大学前沿技术联合研究院)
Expanding the Scope: Inductive Knowledge Graph Reasoning with Multi-Starting Progressive Propagation
State Key Laboratory for Novel Software Technology, Nanjing University(南京大学计算机软件新技术国家重点实验室);National Institute of Healthcare Data Science, Nanjing University(南京大学健康医疗大数据国家研究院)