SMSPPRL: A Similarity Matching Strategy for Privacy Preserving Record Linkage

V. Shelake, N. Shekokar
{"title":"SMSPPRL: A Similarity Matching Strategy for Privacy Preserving Record Linkage","authors":"V. Shelake, N. Shekokar","doi":"10.1109/PDGC50313.2020.9315828","DOIUrl":null,"url":null,"abstract":"Now-a-days, huge amount of personal and sensitive data of individuals resides across different data sources that refer to the same entity. Thus, it is crucial and necessary to detect and link duplicate records from multiple data sets in secure manner referred to as privacy preserving record linkage (PPRL). The PPRL enables data integration, analysis and research activities for business benefits. Since real world data exhibits its dirty and erroneous representations, achieving linkage accuracy is a prominent factor for PPRL techniques. Hence, approximate matching techniques play a crucial role for achieving linkage accuracy in PPRL applications. In this paper, different suitable attribute combinations for PPRL are identified. This paper introduces a similarity matching strategy for privacy preserving record linkage named as SMSPPRL for achieving increased linkage accuracy. Our SMSPPRL technique performs better than existing PPRL techniques Basic Bloom, hardened balanced Bloom filter in terms of linkage accuracy.","PeriodicalId":347216,"journal":{"name":"2020 Sixth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Sixth International Conference on Parallel, Distributed and Grid Computing (PDGC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDGC50313.2020.9315828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Now-a-days, huge amount of personal and sensitive data of individuals resides across different data sources that refer to the same entity. Thus, it is crucial and necessary to detect and link duplicate records from multiple data sets in secure manner referred to as privacy preserving record linkage (PPRL). The PPRL enables data integration, analysis and research activities for business benefits. Since real world data exhibits its dirty and erroneous representations, achieving linkage accuracy is a prominent factor for PPRL techniques. Hence, approximate matching techniques play a crucial role for achieving linkage accuracy in PPRL applications. In this paper, different suitable attribute combinations for PPRL are identified. This paper introduces a similarity matching strategy for privacy preserving record linkage named as SMSPPRL for achieving increased linkage accuracy. Our SMSPPRL technique performs better than existing PPRL techniques Basic Bloom, hardened balanced Bloom filter in terms of linkage accuracy.
SMSPPRL:一种隐私保护记录链接的相似度匹配策略
如今,大量的个人和敏感数据驻留在引用同一实体的不同数据源中。因此,以一种被称为隐私保护记录链接(PPRL)的安全方式检测和链接来自多个数据集的重复记录是至关重要和必要的。PPRL支持数据集成、分析和研究活动,以获得商业利益。由于真实世界的数据显示出其肮脏和错误的表示,因此实现链接准确性是PPRL技术的一个重要因素。因此,在PPRL应用中,近似匹配技术对于实现联动精度起着至关重要的作用。本文确定了适合PPRL的不同属性组合。为了提高链接精度,提出了一种用于隐私保护记录链接的相似度匹配策略SMSPPRL。我们的SMSPPRL技术在链接精度方面优于现有的PPRL技术(Basic Bloom, hardened balanced Bloom filter)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信