arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2208.01735cs.AIcs.LG
收藏

V-Coder:自适应AutoEncoder在知识图谱语义揭示中的应用

V-Coder: Adaptive AutoEncoder for Semantic Disclosure in Knowledge Graphs

Ludwig-Maximilians-Universität(慕尼黑大学)

Christian M. M. Frey, Matthias Schubert

摘要:

语义网或知识图谱(KG)成为智能系统中最重要的信息源之一。主要挑战之一是从文本数据中提取和处理明确的信息。根据人类的感知,两个命名实体之间的重叠语义联系变得清晰,这是因为我们对关系所处的上下文有常识,而当我们从机器的自动驱动过程中看待它时,情况并非如此。在这项工作中,我们感兴趣的问题,关系的解决方案的范围内的KG,即,我们正在调查的内在语义的实体之间的关系网络。我们提出了一个新的自适应AutoEncoder,称为V-编码器,以确定关系固有的连接实体从不同的领域。这些关系可以被认为是模棱两可的,是解开的候选人。与自适应学习理论(ART)类似,我们的模型通过增加竞争层中的单元来从KG中学习新模式,而不会丢弃之前观察到的模式,同时单独学习每个关系的质量。对Freebase、Yago和NELL的真实数据集的评估表明,V-Coder不仅能够从损坏的输入数据中恢复链接,而且还表明KG中关系的语义揭示显示出改善链接预测的趋势。语义评估将评估包装起来。

英文摘要:

Semantic Web or Knowledge Graphs (KG) emerged to one of the most important information source for intelligent systems requiring access to structured knowledge. One of the major challenges is the extraction and processing of unambiguous information from textual data. Following the human perception, overlapping semantic linkages between two named entities become clear due to our common-sense about the context a relationship lives in which is not the case when we look at it from an automatically driven process of a machine. In this work, we are interested in the problem of Relational Resolution within the scope of KGs, i.e, we are investigating the inherent semantic of relationships between entities within a network. We propose a new adaptive AutoEncoder, called V-Coder, to identify relations inherently connecting entities from different domains. Those relations can be considered as being ambiguous and are candidates for disentanglement. Likewise to the Adaptive Learning Theory (ART), our model learns new patterns from the KG by increasing units in a competitive layer without discarding the previous observed patterns whilst learning the quality of each relation separately. The evaluation on real-world datasets of Freebase, Yago and NELL shows that the V-Coder is not only able to recover links from corrupted input data, but also shows that the semantic disclosure of relations in a KG show the tendency to improve link prediction. A semantic evaluation wraps the evaluation up.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑