资源论文Inferring Temporal Knowledge for Near-Periodic Recurrent Events

Inferring Temporal Knowledge for Near-Periodic Recurrent Events

2019-11-05 | |  50 |   41 |   0
Abstract We define the novel problem of extracting and predicting occurrence dates for a class of recurrent events that are held periodically as per a nearregular schedule (e.g., conferences, film festivals, sports championships). Knowledge-bases such as Freebase contain a large number of such recurring events, but they also miss substantial information regarding specific event instances and their occurrence dates. We develop a temporal extraction and inference engine to fill in the missing dates as well as to predict their future occurrences. Our engine performs joint inference over several knowledge sources – (1) information about an event instance and its date extracted from text by our temporal extractor, (2) information about the typical schedule (e.g., “every second week of June”) for a recurrent event extracted by our schedule extractor, and (3) known dates for other instances of the same event. The output of our system is a representation for the event schedule and an occurrence date for each event instance. We find that our system beats humans in predicting future occurrences of recurrent events by significant margins. We release our code and system output for further research.

上一篇:Translating Embeddings for Knowledge Graph Completion with Relation Attention Mechanism

下一篇:Learning Out-of-Vocabulary Words in Intelligent Personal Agents

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...