An Efficient Blocking Technique for Reference Matching using MapReduce
| dc.contributor.author | Paradies, Marcus | |
| dc.date.accessioned | 2018-01-10T13:17:53Z | |
| dc.date.available | 2018-01-10T13:17:53Z | |
| dc.date.issued | 2011 | |
| dc.description.abstract | Document Clustering has become an increasingly important task in the area of data mining and information retrieval. With growing data volumes, CPU—and memory-efficient techniques for clustering algorithms are receiving considerable attention in the research community. To deal with huge amounts of data (e.g., documents from Wikipedia or CiteSeerX which are several GB in size), distributed clustering techniques have been designed to provide scalable and flexible approaches. We study the problem of document clustering in the area of Entity Matching, where documents from various data sources are matched together. More specifically, we focus on a common optimization technique called blocking which reduces the enormous search space by clustering the data sources into smaller groups and processes comparisons only within a group. In this article, we describe our experiences and findings in applying the MapReduce framework to deal with huge bibliographic data sets and to provide a flexible, scalable and easy-to-use blocking technique to reduce the search space for Entity Matching. | |
| dc.identifier.pissn | 1610-1995 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/11609 | |
| dc.publisher | Springer | |
| dc.relation.ispartof | Datenbank-Spektrum: Vol. 11, No. 1 | |
| dc.relation.ispartofseries | Datenbank-Spektrum | |
| dc.subject | Cloud computing | |
| dc.subject | Entity matching | |
| dc.subject | Hierarchical clustering | |
| dc.title | An Efficient Blocking Technique for Reference Matching using MapReduce | |
| dc.type | Text/Journal Article | |
| gi.citation.endPage | 49 | |
| gi.citation.startPage | 47 |