S-MART: Novel Tree-based Structured Learning Algorithms Applied to Tweet Entity Linking
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
LEMONADE: A Large Multilingual Expert-Annotated Abstractive Event Dataset for the Real World
KGMEL: Knowledge Graph-Enhanced Multimodal Entity Linking
Entity-aware Cross-lingual Claim Detection for Automated Fact-checking
Audiopedia: Audio QA with Knowledge
Reverse Region-to-Entity Annotation for Pixel-Level Visual Entity Linking
Unsupervised Named Entity Disambiguation for Low Resource Domains
토론
이 논문과 연결된 포럼 글이 아직 없습니다.