Entity Resolution in the Web of Data

Entity Resolution in the Web of Data

Vassilis Christophides, Vasilis Efthymiou, Kostas Stefanidis
ISBN: 9781627058032 | PDF ISBN: 9781627058049
Copyright © 2015 | 122 Pages | Publication Date: August, 2015

BEFORE YOU ORDER: You may have Academic or Corporate access to this title. Click here to find out: 10.2200/S00655ED1V01Y201507WBE013

Ordering Options: Paperback $40.00   E-book $32.00   Paperback & E-book Combo $50.00


Why pay full price? Members receive 15% off all orders.
Learn More Here

Read Our Digital Content License Agreement (pop-up)

Purchasing Options:


In recent years, several knowledge bases have been built to enable large-scale knowledge sharing, but also an entity-centric Web search, mixing both structured data and text querying. These knowledge bases offer machine-readable descriptions of real-world entities, e.g., persons, places, published on the Web as Linked Data. However, due to the different information extraction tools and curation policies employed by knowledge bases, multiple, complementary and sometimes conflicting descriptions of the same real-world entities may be provided. Entity resolution aims to identify different descriptions that refer to the same entity appearing either within or across knowledge bases.

The objective of this book is to present the new entity resolution challenges stemming from the openness of the Web of data in describing entities by an unbounded number of knowledge bases, the semantic and structural diversity of the descriptions provided across domains even for the same real-world entities, as well as the autonomy of knowledge bases in terms of adopted processes for creating and curating entity descriptions. The scale, diversity, and graph structuring of entity descriptions in the Web of data essentially challenge how two descriptions can be effectively compared for similarity, but also how resolution algorithms can efficiently avoid examining pairwise all descriptions.

The book covers a wide spectrum of entity resolution issues at the Web scale, including basic concepts and data structures, main resolution tasks and workflows, as well as state-of-the-art algorithmic techniques and experimental trade-offs.

Table of Contents

List of Figures
List of Tables
Preface
Acknowledgments
Web of Data: Describing and Linking Entities
Matching and Resolving Entities
Blocking
Iterative Entity Resolution
Experimental Evaluation of Blocking Algorithms
Conclusions
Bibliography
Authors' Biographies

About the Author(s)

Vassilis Christophides, University of Crete, Greece and INRIA, France
Vassilis Christophides is a professor of Computer Science at the University of Crete. He has been recently appointed to an advanced research position at INRIA Paris-Rocquencourt. Previously, he worked as a Distinguished Scientist at Technicolor, R&I Center in Paris. He studied Electrical Engineering at the National Technical University of Athens (NTUA), Greece, July 1988, he received his DEA in computer science from the University PARIS VI, June 1992, and his Ph.D. from the Conservatoire National des Arts et Metiers (CNAM) of Paris, October 1996. His main research interests include Databases and Web Information Systems, as well as Big Data Processing and Analysis. He has published over 130 articles in high-quality international conferences, journals, and workshops. He has been scientific coordinator of a number of research projects funded by the European Union, the Greek State, and private foundations on the Semantic Web and Digital Preservation at the Institute of Computer Science of FORTH. He has received the 2004 SIGMOD Test of Time Award and the Best Paper Award at the 2nd and 6th International Semantic Web Conference in 2003 and 2007. He served as General Chair of the joint EDBT/ICDT Conference in 2014 at Athens and as Area Chair for the ICDE "Semi-structured, Web, and Linked Data Management" track in 2016 at Bali, Indonesia.

Vasilis Efthymiou, University of Crete, Greece and ICS-FORTH, Greece
Vasilis Efthymiou is a Ph.D. candidate at the University of Crete and a member of the Information Systems Laboratory of the Institute of Computer Science at FORTH. The topic of his Ph.D. research is entity resolution in the Web of data. He got his MSc and BSc degrees from the same university in 2012 and 2010, respectively. He has received undergraduate and postgraduate scholarships from FORTH, working in the areas of Semantic Web, non-monotonic reasoning, and Ambient Intelligence.

Kostas Stefanidis, ICS-FORTH, Greece
Kostas Stefanidis is a research scientist at ICS-FORTH, Greece. Previously, he worked as a post-doctoral researcher at the IDI Dept. of NTNU in Norway, with a scholarship funded by the ERCIM Marie Curie Network, and the CSE Dept. of CUHK in Hong Kong. He got his Ph.D. in personalized data management from the University of Ioannina, Greece, in 2009. His research interests lie in the intersection of databases, Web and information retrieval, and include personalized and context-aware data management systems, recommender systems, keyword-based search, and information extraction, resolution, and integration. Kostas has been involved in several international projects and co-authored more than 35 papers in peer-reviewed conferences and journals, including ACM SIGMOD, IEEE ICDE, and ACM TODS. He is the General co-Chair of the Workshop on Exploratory Search in Databases and the Web (ExploreDB), and the Web & Information Chair of SIGMOD/PODS 2016, and the Proceedings Chair of EDBT/ICDT 2016.

Reviews

Customers who bought this product also purchased
Domain-Sensitive Temporal Tagging
Domain-Sensitive Temporal Tagging
Browse by Subject
Case Studies in Engineering
ACM Books
IOP Concise Physics
0 items
LATEST NEWS

Newsletter
Note: Registered customers go to: Your Account to subscribe.

E-Mail Address:

Your Name: