Abstract
In this chapter, we introduce the basic concept of a knowledge graph (KG). While a knowledge graph seems to be a very simple way of representing information, it turns out to be quite powerful and is almost a lingua franca of sorts between humans and machines. On the one hand, knowledge graphs, if constructed properly, contain much of the useful information that can be found in ‘natural language’ documents like newswire or even social media. On the other hand, machines can process knowledge graphs in a variety of ways, leading to applications and breakthroughs in areas like semantic search, question answering, entity resolution, and representation learning.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
For reasons that will become clear throughout the book, we use identifiers such as bone_1 and yard_1 to refer to instances of concepts (also called classes) such as Bone and Yard. The convention adopted herein is to use capitalized initials for concepts.
References
Achichi, M., Cheatham, M., Dragisic, Z., Euzenat, J., Faria, D., Ferrara, A., Flouris, G., Fundulaki, I., Harrow, I., Ivanova, V., et al.: Results of the ontology alignment evaluation initiative 2016. In: OM: Ontology Matching, pp. 73–129. No commercial editor. (2016)
Agichtein, E., Gravano, L.: Snowball: extracting relations from large plain-text collections. In: Proceedings of the Fifth ACM Conference on Digital Libraries, pp. 85–94. ACM (2000)
Ahn, D.: The stages of event extraction. In: Proceedings of the Workshop on Annotating and Reasoning About Time and Events, pp. 1–8. Association for Computational Linguistics (2006)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kejriwal, M. (2019). What Is a Knowledge Graph?. In: Domain-Specific Knowledge Graph Construction. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-12375-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-12375-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-12374-1
Online ISBN: 978-3-030-12375-8
eBook Packages: Computer ScienceComputer Science (R0)