Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Domain-Specific Knowledge Graph ConstructionEntity Resolution

Domain-Specific Knowledge Graph Construction: Entity Resolution [When knowledge graphs are constructed over a large corpus, many documents of which are independently describing the same entity in the real world, multiple nodes in the KG have to be resolved algorithmically into a single entity. The problem of devising automatic algorithms that decide when two or more nodes refer to the same underlying entity is known as Entity Resolution (ER). ER has a long history, and many techniques for it have been developed over five decades of research. In this chapter, we introduce the problem and present contemporary solutions that are widely in use as viable solutions.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Domain-Specific Knowledge Graph ConstructionEntity Resolution

Download PDF
24 pages

Loading next page...
 
/lp/springer-journals/domain-specific-knowledge-graph-construction-entity-resolution-W8lU3tWfEi
Publisher
Springer International Publishing
Copyright
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2019
ISBN
978-3-030-12374-1
Pages
33 –57
DOI
10.1007/978-3-030-12375-8_3
Publisher site
See Chapter on Publisher Site

Abstract

[When knowledge graphs are constructed over a large corpus, many documents of which are independently describing the same entity in the real world, multiple nodes in the KG have to be resolved algorithmically into a single entity. The problem of devising automatic algorithms that decide when two or more nodes refer to the same underlying entity is known as Entity Resolution (ER). ER has a long history, and many techniques for it have been developed over five decades of research. In this chapter, we introduce the problem and present contemporary solutions that are widely in use as viable solutions.]

Published: Mar 5, 2019

There are no references for this article.