Advertisement
Published in:
2020 | OriginalPaper | Chapter
Matching Anonymized Individuals with Errors for Service Systems
Author : Wai Kin (Victor) Chan
Published in: Smart Service Systems, Operations Management, and Analytics
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Data privacy is of great importance for the healthy development of service systems. Companies and governments that provide services to people often have big concerns in sharing their data. Because of that, data must be preprocessed (e.g., anonymized) before they can be shared. However, without identification, it is difficult to match data from different sources and thus the data cannot be used together. This paper investigates how the performance of two simple individual matching methods was affected by errors in the similarity scores between individuals. The first method is a greedy method (GM) that simply matches individuals based on the maximum similarity scores. The second method is an optimal assignment problem (AP), which maximizes the total similarity scores of the matched individuals. Consistent with the literature, we found that GM outperforms AP in most situations. However, we also discovered that AP could be better in fixing errors.