Collective Entity Disambiguation with Structured Gradient Tree Boosting

02/28/2018
by   Yi Yang, et al.
0

We present a gradient-tree-boosting-based structured learning model for jointly disambiguating named entities in a document. Gradient tree boosting is a widely used machine learning algorithm that underlies many top-performing natural language processing systems. Surprisingly, most works limit the use of gradient tree boosting as a tool for regular classification or regression problems, despite the structured nature of language. To the best of our knowledge, our work is the first one that employs the structured gradient tree boosting (SGTB) algorithm for collective entity disambiguation. By defining global features over previous disambiguation decisions and jointly modeling them with local features, our system is able to produce globally optimized entity assignments for mentions in a document. Exact inference is prohibitively expensive for our globally normalized model. To solve this problem, we propose Bidirectional Beam Search with Gold path (BiBSG), an approximate inference algorithm that is a variant of the standard beam search algorithm. BiBSG makes use of global information from both past and future to perform better local search. Experiments on standard benchmark datasets show that SGTB significantly improves upon published results. Specifically, SGTB outperforms the previous state-of-the-art neural system by near 1% absolute accuracy on the popular AIDA-CoNLL dataset.

READ FULL TEXT
research
09/08/2015

Probabilistic Bag-Of-Hyperlinks Model for Entity Linking

Many fundamental problems in natural language processing rely on determi...
research
07/01/2016

Combining Gradient Boosting Machines with Collective Inference to Predict Continuous Values

Gradient boosting of regression trees is a competitive procedure for lea...
research
11/13/2019

Fair Adversarial Gradient Tree Boosting

Fair classification has become an important topic in machine learning re...
research
05/26/2023

Benchmarking state-of-the-art gradient boosting algorithms for classification

This work explores the use of gradient boosting in the context of classi...
research
05/24/2017

Bidirectional Beam Search: Forward-Backward Inference in Neural Sequence Models for Fill-in-the-Blank Image Captioning

We develop the first approximate inference algorithm for 1-Best (and M-B...
research
02/28/2023

Gradient-Boosted Based Structured and Unstructured Learning

We propose two frameworks to deal with problem settings in which both st...
research
02/25/2019

Entity Personalized Talent Search Models with Tree Interaction Features

Talent Search systems aim to recommend potential candidates who are a go...

Please sign up or login with your details

Forgot password? Click here to reset