Data Matching and Privacy

A special issue of Information (ISSN 2078-2489). This special issue belongs to the section "Information Processes".

Deadline for manuscript submissions: closed (10 December 2021) | Viewed by 445

Special Issue Editor


E-Mail Website
Guest Editor
Department of Applied Informatics, University of Macedonia, GR-546 36 Thessaloniki, Greece
Interests: data management; big data; data mining; databases; privacy

Special Issue Information

Dear Colleagues,

Data matching has long been a research area of paramount importance. Its objective is to compare data originating from distinct datasets belonging to the same or distinct organizations and locate the same entities. Then, these datasets may be integrated so as to allow for data analysis of enriched data corpora, offering the capacity to generate new knowledge in various domains. Nowadays, the ever-increasing production of personal data has posed a new challenge for data matching, which is privacy preservation. An indicator of the importance of privacy preservation is the fact that it has been acknowledged by the legislations of many countries. Considering this limitation, new methodologies need to emerge that are capable of performing data matching while preserving privacy. In this Special Issue, we aim to host the latest developments in the area of data matching with respect to privacy. As such, we invite high-quality contributions on novel algorithms, techniques and systems that are able to maintain privacy for the task of data matching. Topics of interest include:

  • Privacy-preserving matching of relational data;
  • Privacy-preserving matching of non-relational data;
  • Privacy-preserving matching of data streams;
  • Federated learning approaches to privacy-preserving data matching;
  • Machine learning for privacy-preserving data matching;
  • Measuring the quality of privacy-preserving matching;
  • Data matching and privacy in the cloud;
  • Quantifying the privacy offered by privacy-preserving data matching;
  • Bias and fairness in privacy-preserving data matching;
  • Novel applications of privacy-preserving data matching;
  • Big data matching and privacy;
  • Novel similarity measures for approximate privacy-preserving data matching;
  • Scalable privacy-preserving data matching;
  • Privacy-preserving data matching from heterogeneous sources;
  • Privacy-preserving data matching systems.

Dr. Alexandros Karakasidis
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Information is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Privacy preservation
  • Data matching
  • Data quality

Published Papers

There is no accepted submissions to this special issue at this moment.
Back to TopTop