Graph Neural Networks for Knowledge Base Question Answering
- 👤 Speaker: Daniil Sorokin, Technische Universität Darmstadt
- 📅 Date & Time: Friday 30 November 2018, 12:00 - 13:00
- 📍 Venue: FW11, Computer Laboratory
Abstract
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.
Series This talk is part of the NLIP Seminar Series series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- 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
- ndk22's list
- NLIP Seminar Series
- ob366-ai4er
- PMRFPS's
- rp587
- School of Technology
- Simon Baker's List
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Daniil Sorokin, Technische Universität Darmstadt
Friday 30 November 2018, 12:00-13:00