首页> 外文会议>Conference of the European Chapter of the Association for Computational Linguistics >The ContrastMedium Algorithm: Taxonomy Induction From Noisy Knowledge Graphs With Just a Few Links
【24h】

The ContrastMedium Algorithm: Taxonomy Induction From Noisy Knowledge Graphs With Just a Few Links

机译:对比度算法:几个只有几个链接的嘈杂知识图表的分类诱导

获取原文

摘要

In this paper, we present ContrastMedium, an algorithm that transforms noisy semantic networks into full-fledged, clean taxonomies. ContrastMedium is able to identify the embedded taxonomy structure from a noisy knowledge graph without explicit human supervision such as, for instance, a set of manually selected input root and leaf concepts. This is achieved by leveraging structural information from a companion reference taxonomy, to which the input knowledge graph is linked (either automatically or manually). When used in conjunction with methods for hypernym acquisition and knowledge base linking, our methodology provides a complete solution for end-to-end taxonomy induction. We conduct experiments using automatically acquired knowledge graphs, as well as a SemEval benchmark, and show that our method is able to achieve high performance on the task of taxonomy induction.
机译:在本文中,我们提出了对比度,这是一种将嘈杂的语义网络转换为全剩氯的算法,进入全面的清洁分类学。 ContrastEdium能够从嘈杂知识图中识别嵌入的分类结构,而无明确的人类监督,例如一组手动选择的输入根和叶概念。这是通过利用来自伴侣参考分类学的结构信息来实现的,输入知识图表链接到(自动或手动)。当与HyperNyM获取和知识库链接的方法结合使用时,我们的方法提供了完整的端到端分类诱导解决方案。我们使用自动获取的知识图表以及半基准进行实验,并表明我们的方法能够在分类诱导的任务上实现高性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号