Learning to Extract Events from Knowledge Base Revisions

被引:7
|
作者
Konovalov, Alexander [1 ]
Strauss, Benjamin [1 ]
Ritter, Alan [1 ]
O'Connor, Brendan [2 ]
机构
[1] Ohio State Univ, Columbus, OH 43210 USA
[2] Univ Massachusetts, Amherst, MA 01003 USA
基金
美国国家科学基金会;
关键词
D O I
10.1145/3038912.3052646
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Broad-coverage knowledge bases (KBs) such as Wikipedia, Free-base, Microsoft's Satori and Google's Knowledge Graph contain structured data describing real-world entities. These data sources have become increasingly important for a wide range of intelligent systems: from information retrieval and question answering, to Facebook's Graph Search, IBM's Watson, and more. Previous work on learning to populate knowledge bases from text has, for the most part, made the simplifying assumption that facts remain constant over time. But this is inaccurate-we live in a rapidly changing world. Knowledge should not be viewed as a static snapshot, but instead a rapidly evolving set of facts that must change as the world changes. In this paper we demonstrate the feasibility of accurately identifying entity-transition-events, from real-time news and social media text streams, that drive changes to a knowledge base. We use Wikipedia's edit history as distant supervision to learn event extractors, and evaluate the extractors based on their ability to predict online updates. Our weakly supervised event extractors are able to predict 10 KB revisions per month at 0.8 precision. By lowering our confidence threshold, we can suggest 34.3 correct edits per month at 0.4 precision. 64% of predicted edits were detected before they were added to Wikipedia. The average lead time of our forecasted knowledge revisions over Wikipedia's editors is 40 days, demonstrating the utility of our method for suggesting edits that can be quickly verified and added to the knowledge graph. 1
引用
收藏
页码:1007 / 1014
页数:8
相关论文
共 50 条
  • [1] Learning to Extract Local Events from the Web
    Foley, John
    Bendersky, Michael
    Josifovski, Vanja
    [J]. SIGIR 2015: PROCEEDINGS OF THE 38TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2015, : 423 - 432
  • [2] The complexity of nested counterfactuals and iterated knowledge base revisions
    Eiter, T
    Gottlob, G
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 53 (03) : 497 - 512
  • [3] EVIN: Building a Knowledge Base of Events
    Kuzey, Erdal
    Weikum, Gerhard
    [J]. WWW'14 COMPANION: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2014, : 103 - 106
  • [4] EventWiki: A Knowledge Base of Major Events
    Ge, Tao
    Cui, Lei
    Chang, Baobao
    Sui, Zhifang
    Wei, Furu
    Zhou, Ming
    [J]. PROCEEDINGS OF THE ELEVENTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION (LREC 2018), 2018, : 499 - 503
  • [5] Geometry Knowledge Base Learning from Theorem Proofs
    Fu, Hongguang
    Zhong, Xiuqin
    Li, Qunan
    Xia, Huadong
    Li, Jie
    [J]. KNOWLEDGE ENGINEERING AND MANAGEMENT , ISKE 2013, 2014, 278 : 21 - 33
  • [6] Designing a novel cross ontology measure to extract resources from knowledge base for an adaptive e-learning system
    Saleena, B.
    Srivatsa, S.K.
    [J]. International Journal of Metadata, Semantics and Ontologies, 2014, 9 (03) : 193 - 203
  • [7] Automatic knowledge base refinement: Learning from examples and deep knowledge in rheumatology
    Widmer, G.
    Horn, W.
    Nagele, B.
    [J]. Artificial Intelligence in Medicine, 1993, 5 (03) : 225 - 243
  • [8] Selective Base Revisions
    Marco Garapa
    [J]. Journal of Philosophical Logic, 2022, 51 : 1 - 26
  • [9] Learning to extract symbolic knowledge from the World Wide Web
    Craven, M
    DiPasquo, D
    Freitag, D
    McCallum, A
    Mitchell, T
    Nigam, K
    Slattery, S
    [J]. FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, 1998, : 509 - 516
  • [10] Selective Base Revisions
    Garapa, Marco
    [J]. JOURNAL OF PHILOSOPHICAL LOGIC, 2022, 51 (01) : 1 - 26