Graph Neural Networks for Knowledge Base Question Answering

Add to your list(s) Download to your calendar using vCal

• Daniil Sorokin, Technische Universität Darmstadt
• Friday 30 November 2018, 12:00-13:00
• FW11, Computer Laboratory.

If you have a question about this talk, please contact Andrew Caines.

Room changed

In this talk, we present a semantic parsing approach to Knowledge Base Question Answering. We address the problem of learning vector representations for complex semantic parses that consist of multiple entities and relations. Previous work largely focused on selecting the correct semantic relations for a question and disregarded the structure of the semantic parse: the connections between entities and the directions of the relations. We propose to use Gated Graph Neural Networks to encode the graph structure of the semantic parse.

We will present a formulation of Gated Graph Neural Networks for labeled knowledge base subgraphs and show how it can be used in a question answering pipeline. Empirically, we demonstrate on two data sets that the graph networks outperform the baseline models that do not explicitly model the semantic structure.

This talk is part of the NLIP Seminar Series series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge talks
• Chris Davis' list
• Computer Education Research
• Computing Education Research
• Department of Computer Science and Technology talks and seminars
• FW11, Computer Laboratory
• Graduate-Seminars
• Guy Emerson's list
• Interested Talks
• Language Sciences for Graduate Students
• NLIP Seminar Series
• PMRFPS's
• Simon Baker's List
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.