In the Web of data, entities are described by interlinked data rather than documents on the Web. In this talk, we focus on entity resolution in the Web of data, i.e., on the problem of identifying descriptions that refer to the same real-world entity within one or across knowledge bases in the Web of data. To reduce the required number of pairwise comparisons among descriptions, methods for entity resolution typically perform a preprocessing step, called blocking, which places similar entity descriptions into blocks and executes comparisons only between descriptions within the same block. The objective of this talk is to present challenges and algorithms for blocking for entity resolution, stemming from the Web openness in describing, by an unbounded number of KBs, a multitude of entity types across domains, as well as the high heterogeneity (semantic and structural) of descriptions, even for the same types of entities.
CITATION STYLE
Stefanidis, K. (2017). Blocking for Entity Resolution in the Web of Data: Challenges and Algorithms. In Springer Proceedings in Business and Economics (pp. 479–482). Springer Science and Business Media B.V. https://doi.org/10.1007/978-3-319-56288-9_63
Mendeley helps you to discover research relevant for your work.