mlsanityData to 7 Oct 2026

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

arXiv 1609.08075 ↗First posted 26 Sep 2016cs.CLcited by 16

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Sep 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 9; 2022: 4; 2023: 2; 2024: 1.

16 papers.

Sort: