ABSTRACT
Recent years have witnessed a proliferation of large-scale knowledge graphs, such as Freebase, YAGO, Google's Knowledge Graph, and Microsoft's Satori. Whereas there is a large body of research on mining homogeneous graphs, this new generation of information networks are highly heterogeneous, with thousands of entity and relation types and billions of instances of vertices and edges. In this tutorial, we will present the state of the art in constructing, mining, and growing knowledge graphs. The purpose of the tutorial is to equip newcomers to this exciting field with an understanding of the basic concepts, tools and methodologies, available datasets, and open research challenges. A publicly available knowledge base (Freebase) will be used throughout the tutorial to exemplify the different techniques.
Index Terms
- Constructing and mining web-scale knowledge graphs: KDD 2014 tutorial
Recommendations
Constructing and Mining Web-scale Knowledge Graphs
SIGIR '16: Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information RetrievalRecent years have witnessed a proliferation of large-scale knowledge graphs, from purely academic projects such as YAGO to major commercial projects such as Google's Knowledge Graph and Microsoft's Satori. Whereas there is a large body of research on ...
Constructing and Mining Web-Scale Knowledge Graphs: WWW 2015 Tutorial
WWW '15 Companion: Proceedings of the 24th International Conference on World Wide WebRecent years have witnessed a proliferation of large-scale knowledge graphs, such as Freebase, Google's Knowledge Graph, YAGO, Facebook's Entity Graph, and Microsoft's Satori. Whereas there is a large body of research on mining homogeneous graphs, this ...
Constructing connected bicritical graphs with edge-connectivity 2
A graph G is said to be bicritical if the removal of any pair of vertices decreases the domination number of G . For a bicritical graph G with the domination number t , we say that G is t -bicritical. Let λ ( G ) denote the edge-connectivity of G . In 2]...
Comments