question time
TwiRGCN: Temporally Weighted Graph Convolution for Question Answering over Temporal Knowledge Graphs
Sharma, Aditya, Saxena, Apoorv, Gupta, Chitrank, Kazemi, Seyed Mehran, Talukdar, Partha, Chakrabarti, Soumen
Recent years have witnessed much interest in temporal reasoning over knowledge graphs (KG) for complex question answering (QA), but there remains a substantial gap in human capabilities. We explore how to generalize relational graph convolutional networks (RGCN) for temporal KGQA. Specifically, we propose a novel, intuitive and interpretable scheme to modulate the messages passed through a KG edge during convolution, based on the relevance of its associated time period to the question. We also introduce a gating device to predict if the answer to a complex temporal question is likely to be a KG entity or time and use this prediction to guide our scoring mechanism. We evaluate the resulting system, which we call TwiRGCN, on TimeQuestions, a recently released, challenging dataset for multi-hop complex temporal QA. We show that TwiRGCN significantly outperforms state-of-the-art systems on this dataset across diverse question types. Notably, TwiRGCN improves accuracy by 9--10 percentage points for the most difficult ordinal and implicit question types.
- North America > United States > Minnesota > Hennepin County > Minneapolis (0.14)
- Asia > India > Karnataka > Bengaluru (0.04)
- South America > Colombia > Bogotá D.C. > Bogotá (0.04)
- (9 more...)
- Government > Regional Government > North America Government > United States Government (0.68)
- Transportation > Ground (0.46)
- Information Technology > Artificial Intelligence > Representation & Reasoning > Temporal Reasoning (0.72)
- Information Technology > Artificial Intelligence > Natural Language > Question Answering (0.63)
- Information Technology > Artificial Intelligence > Representation & Reasoning > Semantic Networks (0.62)
Machines may beat us in debate, but will they ever have the human touch? Kenan Malik
So a machine can now not only demolish you at chess or devastate you in Jeopardy, it can also outwit you on Question Time. Last week, in a public debate in San Francisco, IBM pitted its Project Debater software program against human opponents, including Noa Ovadia, Israel's national debating champion in 2016. Each participant had four minutes in which to make an opening statement, followed by a four-minute rebuttal and a two-minute conclusion. Drawing on a library of hundreds of millions of newspaper articles and academic papers, and some pre-installed arguments, the machine held its own. "I can't say it makes my blood boil, because I have no blood," it quipped, "but it seems some people naturally suspect technology because it's new." Project Debater is a remarkable achievement.
- North America > United States > California > San Francisco County > San Francisco (0.25)
- Asia > Middle East > Israel (0.25)
Is that a fact? Checking politicians' statements just got a whole lot easier Peter Fray
Visitors to Australia's federal parliament are often surprised by the robust verbal confrontation between the government and the opposition – technically known as questions without notice, more commonly as question time. A theatrical highpoint of every sitting day, question time is part intellectual cage fight, part kindergarten spat – and all psychological warfare. Political journalists watch the hour-long question time as drought-stricken farmers view the clouds. They look for signs, they read the climate. But what if you were interested in facts?
- Oceania > Australia (1.00)
- North America > United States > Texas > Tarrant County > Arlington (0.05)
- North America > United States > New York (0.05)
- (2 more...)
- Government > Voting & Elections (0.71)
- Government > Regional Government > Oceania Government > Australia Government (0.70)