A(k, p)-anonymity Framework to Sanitize Transactional Database with Personalized Sensitivity

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of Internet Technology Pub Date : 2019-05-01 DOI:10.3966/160792642019052003013
Binbin Zhang, Jerry Chun‐wei Lin, Qiankun Liu, Philippe Fournier-Viger, Y. Djenouri
{"title":"A(k, p)-anonymity Framework to Sanitize Transactional Database with Personalized Sensitivity","authors":"Binbin Zhang, Jerry Chun‐wei Lin, Qiankun Liu, Philippe Fournier-Viger, Y. Djenouri","doi":"10.3966/160792642019052003013","DOIUrl":null,"url":null,"abstract":"In recent years, analyzing transactional data has become an important data analytic task since it can discover important information in several domains, for recommendation, prediction, and personalization. Nonetheless, transactional data sometimes contains sensitive and confidential information such as personal identifiers, information aboutsexual orientations, medical diseases, and religious beliefs. Such information can be analyzed using various data mining algorithms, which may cause security threats to individuals. Several algorithms were proposed to hide sensitive information in databases but most of them assume that sensitive information is the same for all users, which is an unrealistic assumption. Hence, this paper presents a (k, p)-anonymity framework to hide personal sensitive information. The developed ANonymity for Transactional database (ANT) algorithm can hide multiple pieces of sensitive information in transactions. Besides, it let users assign sensitivity values to indicate how sensitive each piece of information is. The designed anonymity algorithm ensures that the percentage of anonymized data does not exceed a predefined maximum sensitivity threshold. Results of several experiments indicate that the proposed algorithm outperforms the-state-of-the-art PTA and Gray-TSP algorithms in terms of information loss and runtime.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"20 1","pages":"801-808"},"PeriodicalIF":0.9000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Internet Technology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3966/160792642019052003013","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 3

Abstract

In recent years, analyzing transactional data has become an important data analytic task since it can discover important information in several domains, for recommendation, prediction, and personalization. Nonetheless, transactional data sometimes contains sensitive and confidential information such as personal identifiers, information aboutsexual orientations, medical diseases, and religious beliefs. Such information can be analyzed using various data mining algorithms, which may cause security threats to individuals. Several algorithms were proposed to hide sensitive information in databases but most of them assume that sensitive information is the same for all users, which is an unrealistic assumption. Hence, this paper presents a (k, p)-anonymity framework to hide personal sensitive information. The developed ANonymity for Transactional database (ANT) algorithm can hide multiple pieces of sensitive information in transactions. Besides, it let users assign sensitivity values to indicate how sensitive each piece of information is. The designed anonymity algorithm ensures that the percentage of anonymized data does not exceed a predefined maximum sensitivity threshold. Results of several experiments indicate that the proposed algorithm outperforms the-state-of-the-art PTA and Gray-TSP algorithms in terms of information loss and runtime.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一个(k,p)-匿名框架用于区分具有个性化敏感性的事务数据库
近年来,分析事务性数据已成为一项重要的数据分析任务,因为它可以发现多个领域的重要信息,用于推荐、预测和个性化。尽管如此,事务性数据有时包含敏感和机密信息,如个人标识符、性取向、医疗疾病和宗教信仰信息。这些信息可以使用各种数据挖掘算法进行分析,这可能会对个人造成安全威胁。提出了几种隐藏数据库敏感信息的算法,但大多数算法都假设所有用户的敏感信息是相同的,这是不现实的假设。因此,本文提出了一个(k, p)-匿名框架来隐藏个人敏感信息。提出的事务数据库匿名(ANT)算法可以隐藏事务中的多条敏感信息。此外,它还允许用户指定敏感性值,以指示每条信息的敏感程度。设计的匿名算法确保匿名数据的百分比不超过预定义的最大灵敏度阈值。实验结果表明,该算法在信息丢失和运行时间方面优于目前最先进的PTA和Gray-TSP算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Internet Technology
Journal of Internet Technology COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
3.20
自引率
18.80%
发文量
112
审稿时长
13.8 months
期刊介绍: The Journal of Internet Technology accepts original technical articles in all disciplines of Internet Technology & Applications. Manuscripts are submitted for review with the understanding that they have not been published elsewhere. Topics of interest to JIT include but not limited to: Broadband Networks Electronic service systems (Internet, Intranet, Extranet, E-Commerce, E-Business) Network Management Network Operating System (NOS) Intelligent systems engineering Government or Staff Jobs Computerization National Information Policy Multimedia systems Network Behavior Modeling Wireless/Satellite Communication Digital Library Distance Learning Internet/WWW Applications Telecommunication Networks Security in Networks and Systems Cloud Computing Internet of Things (IoT) IPv6 related topics are especially welcome.
期刊最新文献
Abnormal Detection Method of Transship Based on Marine Target Spatio-Temporal Data Multidimensional Concept Map Representation of the Learning Objects Ontology Model for Personalized Learning Multiscale Convolutional Attention-based Residual Network Expression Recognition A Dynamic Access Control Scheme with Conditional Anonymity in Socio-Meteorological Observation A Behaviorally Evidence-based Method for Computing Spatial Comparisons of Image Scenarios
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1