Exploiting Linked Data and Knowledge Graphs in Large Organisations
Softcover reprint of the original 1st ed. 2017
Book Details
Format
Paperback / Softback
ISBN-10
3319833391
ISBN-13
9783319833392
Edition
Softcover reprint of the original 1st ed. 2017
Publisher
Springer International Publishing AG
Imprint
Springer International Publishing AG
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Jul 13th, 2018
Print length
266 Pages
Ksh 27,000.00
Werezi Extended Catalogue
0 in stock
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
This book addresses the topic of exploiting enterprise-linked data with a particular focus on knowledge construction and accessibility within enterprises. It identifies the gaps between the requirements of enterprise knowledge consumption and “standard” data consuming technologies by analysing real-world use cases, and proposes the enterprise knowledge graph to fill such gaps. It provides concrete guidelines for effectively deploying linked-data graphs within and across business organizations. It is divided into three parts, focusing on the key technologies for constructing, understanding and employing knowledge graphs. Part 1 introduces basic background information and technologies, and presents a simple architecture to elucidate the main phases and tasks required during the lifecycle of knowledge graphs. Part 2 focuses on technical aspects; it starts with state-of-the art knowledge-graph construction approaches, and then discusses exploration and exploitation techniques as well as advanced question-answering topics concerning knowledge graphs. Lastly, Part 3 demonstrates examples of successful knowledge graph applications in the media industry, healthcare and cultural heritage, and offers conclusions and future visions.
Get Exploiting Linked Data and Knowledge Graphs in Large Organisations by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer International Publishing AG and it has pages.