TimeMachine: Timeline Generation for Knowledge-Base Entities

被引:21
作者
Althoff, Tim [1 ]
Dong, Xin Luna [2 ]
Murphy, Kevin [2 ]
Alai, Safa [2 ]
Dang, Van [2 ]
Zhang, Wei [2 ]
机构
[1] Stanford Univ, Comp Sci Dept, Stanford, CA 94305 USA
[2] Google, Mountain View, CA 94043 USA
来源
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING | 2015年
关键词
Summarization; Timeline; Knowledge Base; Submodular Optimization;
D O I
10.1145/2783258.2783325
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a method called TIMEMACHINE to generate a timeline of events and relations for entities in a knowledge base. For example for an actor, such a timeline should show the most important professional and personal milestones and relationships such as works, awards, collaborations, and family relationships. We develop three orthogonal timeline quality criteria that an ideal timeline should satisfy: (1) it shows events that are relevant to the entity; (2) it shows events that are temporally diverse, so they distribute along the time axis, avoiding visual crowding and allowing for easy user interaction, such as zooming in and out; and (3) it shows events that are content diverse, so they contain many different types of events (e.g., for an actor, it should show movies and marriages and awards, not just movies). We present an algorithm to generate such timelines for a given time period and screen size, based on submodular optimization and web-co-occurrence statistics with provable performance guarantees. A series of user studies using Mechanical Turk shows that all three quality criteria are crucial to produce quality timelines and that our algorithm significantly outperforms various baseline and state-of-the-art methods.
引用
收藏
页码:19 / 28
页数:10
相关论文
共 42 条
[1]  
Ahmed Amr., 2012, Proceedings of the fifth ACM international conference on Web search and data mining, WSDM '12, P333
[2]  
Allan J., 2001, SIGIR
[3]  
Althoff T., 2015, ARXIV150204662
[4]  
[Anonymous], 2012, UAI
[5]  
[Anonymous], 2013, WORKSH LINKEDUP CHAL
[6]  
Baeza-Yates R, 1999, MODERN INFORM RETRIE, V463
[7]  
Bamman David, 2014, Transactions of the Association for Computational Linguistics, V2, P363
[8]  
Bollacker K., 2008, P 2008 ACM SIGMOD IN, P1247, DOI DOI 10.1145/1376616.1376746
[9]   MAXIMIZING A MONOTONE SUBMODULAR FUNCTION SUBJECT TO A MATROID CONSTRAINT [J].
Calinescu, Gruia ;
Chekuri, Chandra ;
Pal, Martin ;
Vondrak, Jan .
SIAM JOURNAL ON COMPUTING, 2011, 40 (06) :1740-1766
[10]  
Carbonell J., 1998, Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, P335, DOI 10.1145/290941.291025