Skip to main navigation Skip to search Skip to main content

A Record Linkage‐Based Data Deduplication Framework with DataCleaner Extension

  • Otmane Azeroual
  • , Meena Jha
  • , Anastasija Nikiforova
  • , Kewei Sha
  • , Mohammad Alsmirat
  • , Sanjay Jha
  • German Centre for Higher Education Research and Science Studies
  • Central Queensland University
  • University of Tartu
  • European Open Science Cloud (EOSC) Task Force “FAIR Metrics and Data Quality”
  • University of Houston-Clear Lake
  • Jordan University of Science and Technology

Research output: Contribution to journal › Article › peer-review

19 Scopus citations

Abstract

The data management process is characterised by a set of tasks where data quality management (DQM) is one of the core components. Data quality, however, is a multidimensional concept, where the nature of the data quality issues is very diverse. One of the most widely anticipated data quality challenges, which becomes particularly vital when data come from multiple data sources which is a typical situation in the current data‐driven world, is duplicates or non‐unique-ness. Even more, duplicates were recognised to be one of the key domain‐specific data quality dimensions in the context of the Internet of Things (IoT) application domains, where smart grids and health dominate most. Duplicate data lead to inaccurate analyses, leading to wrong decisions, negatively affect data‐driven and/or data processing activities such as the development of models, fore-casts, simulations, have a negative impact on customer service, risk and crisis management, service personalisation in terms of both their accuracy and trustworthiness, decrease user adoption and satisfaction, etc. The process of determination and elimination of duplicates is known as deduplication, while the process of finding duplicates in one or more databases that refer to the same entities is known as Record Linkage. To find the duplicates, the data sets are compared with each other using similarity functions that are usually used to compare two input strings to find similarities between them, which requires quadratic time complexity. To defuse the quadratic complexity of the problem, especially in large data sources, record linkage methods, such as blocking and sorted neighbourhood, are used. In this paper, we propose a six‐step record linkage deduplication frame-work. The operation of the framework is demonstrated on a simplified example of research data artifacts, such as publications, research projects and others of the real‐world research institution representing Research Information Systems (RIS) domain. To make the proposed framework usable we integrated it into a tool that is already used in practice, by developing a prototype of an extension for the well‐known DataCleaner. The framework detects and visualises duplicates thereby identifying and providing the user with identified redundancies in a user‐friendly manner allowing their further elimination. By removing the redundancies, the quality of the data is improved therefore improving analyses and decision‐making. This study makes a call for other researchers to take a step towards the “golden record” that can be achieved when all data quality issues are recognised and resolved, thus moving towards absolute data quality.

Original languageEnglish
Article number27
JournalMultimodal Technologies and Interaction
Volume6
Issue number4
DOIs
StatePublished - Apr 2022

Keywords

  • RIS
  • blocking
  • data linkage
  • data matching
  • data quality
  • deduplication
  • duplicate detection
  • graphs
  • modelling
  • research data
  • similarity
  • simulation
  • sorted neighbourhood
  • uniqueness

Fingerprint

Dive into the research topics of 'A Record Linkage‐Based Data Deduplication Framework with DataCleaner Extension'. Together they form a unique fingerprint.

Cite this