首页> 外文会议>Annual meeting of the Association for Computational Linguistics >S-mart: Novel Tree-based Structured Learning Algorithms Applied to Tweet Entity Linking
【24h】

S-mart: Novel Tree-based Structured Learning Algorithms Applied to Tweet Entity Linking

机译:S-MART:基于树的基于树的结构化学习算法应用于Tweet实体链接

获取原文

摘要

Non-linear models recently receive a lot of attention as people are starting to discover the power of statistical and embedding features. However, tree-based models are seldom studied in the context of structured learning despite their recent success on various classification and ranking tasks. In this paper, we propose S-MART, a tree-based structured learning framework based on multiple additive regression trees. S-MART is especially suitable for handling tasks with dense features, and can be used to learn many different structures under various loss functions. We apply S-MART to the task of tweet entity linking - a core component of tweet information extraction, which aims to identify and link name mentions to entities in a knowledge base. A novel inference algorithm is proposed to handle the special structure of the task. The experimental results show that S-MART significantly outperforms state-of-the-art tweet entity linking systems.
机译:非线性模型最近接受了很多关注,因为人们开始发现统计和嵌入功能的力量。然而,尽管最近在各种分类和排名任务上取得了成功,但在结构化学习的背景下很少研究基于树的模型。在本文中,我们提出了一种基于树木的基于树的结构化学习框架的S-Mart,基于多元添加剂回归树。 S-MART特别适用于处理密集功能的任务,可用于在各种损耗功能下学习许多不同的结构。我们将S-Mart应用于Tweet实体链接的任务 - 推文信息提取的核心组件,旨在将名称和链接名称提到到知识库中的实体。提出了一种新颖的推理算法来处理任务的特殊结构。实验结果表明,S-MART显着优于最先进的推文实体链接系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号