Mining Knowledge Graphs from Text 教程: 如何从文本中挖掘知识图谱

Mining Knowledge Graphs from Text

WSDM 2018 Tutorial (schedule)
February 5, 2018, 1:30PM - 5:00PM
Location: Ballroom Terrace (The Ritz-Carlton, Marina del Rey)

Jay Pujara Sameer Singh

Jay PujaraSameer Singh

Knowledge graphs have become an increasingly crucial component in machine intelligence systems, powering ubiquitous digital assistants and inspiring several large scale academic projects across the globe. Our tutorial explains why knowledge graphs are important, how knowledge graphs are constructed, and where new research opportunities exist for improving the state-of-the-art. In this tutorial, we cover the many sophisticated approaches that complete and correct knowledge graphs. We organize this exploration into two main classes of models. The first include probabilistic logical frameworks that use graphical models, random walks, or statistical rule mining to construct knowledge graphs. The second class of models includes latent space models such as matrix and tensor factorization and neural networks. We conclude the tutorial with a critical comparison of techniques and results. We will offer practical advice for novices to identify common empirical challenges and concrete data sets for initial experimentation. Finally, we will highlight promising areas of current and future work.

Our goal is to present an accessible and structured overview of the existing approaches to extracting candidate facts from text and incorporating these into a well-formed knowledge graph. Our approach includes identifying the common themes and challenges in the area, and comparing and contrasting the existing approaches on the basis of these aspects. We believe such a unifying framework will provide the necessary tools and perspectives to enable the newcomers to the field to explore, evaluate, and develop novel techniques for automated knowledge graph construction.

Outline (with draft slides)

Tutorial Overview

Part 1: Knowledge Graph Primer [ Slides ]

  • What is a Knowledge Graph?
  • Why are Knowledge Graphs Important?
  • Where do Knowledge Graphs come from?
  • Knowledge Representation Choices
  • Problem Overview

Part 2: Knowledge Extraction Primer [ Slides ]

  • NLP Fundamentals (tagging, parsing, named entity recognition and entity resolution)
  • Learning knowledge extractors
  • Scoring extracted knowledge
  • Categories of IE techniques
  • Compositional models: Knowledge fusion

Part 3: Knowledge Graph Construction

  • Graph construction overview
  • Probabilistic Models [ Slides ]
    • Motivation
    • Graphical models
    • Random walk approaches

Coffee Break

  • Embedding Techniques [ Slides ]
    • Relation extraction techniques
      • Matrix factorization
      • Embedding entity pairs
    • Graph completion techniques
      • Tensor factorization
      • Entity and relation embeddings
      • Compositional models

Part 4: Critical Overview and Conclusion [ Slides ]

  • Summary
  • Success stories
  • Datasets, tasks, softwares
  • Exciting active research
  • Future research directions

See materials for our previous tutorial at AAAI 2017

https://kgtutorial.github.io/

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Contents Knowledge Graphs: Venturing Out into the Wild . . . . . . . . . . . . . . . . . . . . 1 Gerard de Melo Information Extraction from the Web by Matching Visual Presentation Patterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 Radek Burget Statistical Induction of Coupled Domain/Range Restrictions from RDF Knowledge Bases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 Basil Ell, Sherzod Hakimov, and Philipp Cimiano Wikipedia and DBpedia for Media - Managing Audiovisual Resources in Their Semantic Context . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 Jean-Pierre Evain, Mike Matton, and Tormod Vaervagen Identifying Global Representative Classes of DBpedia Ontology Through Multilingual Analysis: A Rank Aggregation Approach . . . . . . . . . . 57 Eun-kyung Kim and Key-Sun Choi Identifying Poorly-Defined Concepts in WordNet with Graph Metrics . . . . . . 66 John P. McCrae and Narumol Prangnawarat Extracting Process Graphs from Medical Text Data: An Approach Towards a Systematic Framework to Extract and Mine Medical Sequential Processes Descriptions from Large Text Sources. . . . . . . . . . . . . . . . . . . . . 76 Andreas Niekler and Christian Kahmann Chainable and Extendable Knowledge Integration Web Services. . . . . . . . . . 89 Felix Sasaki, Milan Dojchinovski, and Jan Nehring Entity Typing Using Distributional Semantics and DBpedia . . . . . . . . . . . . . 102 Marieke van Erp and Piek Vossen WC3: Analyzing the Style of Metadata Annotation Among Wikipedia Articles by Using Wikipedia Category and the DBpedia Metadata Database . . . 119 Masaharu Yoshioka Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值