应用元组迁移来保护数据库中的隐私

Anh Truong, Le Thanh Dinh, Ngo Thi Tuong Vy
{"title":"应用元组迁移来保护数据库中的隐私","authors":"Anh Truong, Le Thanh Dinh, Ngo Thi Tuong Vy","doi":"10.1109/NICS56915.2022.10013443","DOIUrl":null,"url":null,"abstract":"Nowadays, in the age of big data, cloud computing, and the internet of things, there has been the ubiquity of open data for people to conveniently approach, use, and mine. However, most of the valuable data is data relating to personal sensitive information such as data about diseases or salaries. This data should be protected by some policies to conceal the relationship between sensitive data and people. As of late, there are many approaches and techniques for preserving data privacy, of which k-anonymity is the most popular. Nevertheless, most of the k-anonymity algorithms are too general and do not concentrate on any concrete data mining technique, so the data utility does not remain high. In this work, we introduce a k-anonymity algorithm based on tuple member migration between tuple groups to achieve k-anonymity while preserving data quality for a data mining algorithm, i.e., association rule mining because it is one of the most popular data mining techniques which discovers the association of items or itemsets in a dataset. The algorithm was evaluated on the adult dataset to assess the performance as well as the data utility.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Applying Tuple Migration to Preserve Privacy in Databases\",\"authors\":\"Anh Truong, Le Thanh Dinh, Ngo Thi Tuong Vy\",\"doi\":\"10.1109/NICS56915.2022.10013443\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, in the age of big data, cloud computing, and the internet of things, there has been the ubiquity of open data for people to conveniently approach, use, and mine. However, most of the valuable data is data relating to personal sensitive information such as data about diseases or salaries. This data should be protected by some policies to conceal the relationship between sensitive data and people. As of late, there are many approaches and techniques for preserving data privacy, of which k-anonymity is the most popular. Nevertheless, most of the k-anonymity algorithms are too general and do not concentrate on any concrete data mining technique, so the data utility does not remain high. In this work, we introduce a k-anonymity algorithm based on tuple member migration between tuple groups to achieve k-anonymity while preserving data quality for a data mining algorithm, i.e., association rule mining because it is one of the most popular data mining techniques which discovers the association of items or itemsets in a dataset. The algorithm was evaluated on the adult dataset to assess the performance as well as the data utility.\",\"PeriodicalId\":381028,\"journal\":{\"name\":\"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NICS56915.2022.10013443\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NICS56915.2022.10013443","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

如今,在大数据、云计算、物联网时代,开放数据无处不在,人们可以方便地接近、使用和挖掘。然而,大多数有价值的数据是与个人敏感信息有关的数据,例如有关疾病或工资的数据。这些数据应该通过一些策略来保护,以隐藏敏感数据与人之间的关系。最近,有许多保护数据隐私的方法和技术,其中k-匿名是最受欢迎的。然而,大多数k-匿名算法过于一般化,没有集中于任何具体的数据挖掘技术,因此数据效用不高。在这项工作中,我们引入了一种基于元组成员在元组组之间迁移的k-匿名算法,以实现k-匿名,同时保持数据挖掘算法的数据质量,即关联规则挖掘,因为它是最流行的数据挖掘技术之一,它发现数据集中项目或项目集的关联。该算法在成人数据集上进行了评估,以评估性能和数据效用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Applying Tuple Migration to Preserve Privacy in Databases
Nowadays, in the age of big data, cloud computing, and the internet of things, there has been the ubiquity of open data for people to conveniently approach, use, and mine. However, most of the valuable data is data relating to personal sensitive information such as data about diseases or salaries. This data should be protected by some policies to conceal the relationship between sensitive data and people. As of late, there are many approaches and techniques for preserving data privacy, of which k-anonymity is the most popular. Nevertheless, most of the k-anonymity algorithms are too general and do not concentrate on any concrete data mining technique, so the data utility does not remain high. In this work, we introduce a k-anonymity algorithm based on tuple member migration between tuple groups to achieve k-anonymity while preserving data quality for a data mining algorithm, i.e., association rule mining because it is one of the most popular data mining techniques which discovers the association of items or itemsets in a dataset. The algorithm was evaluated on the adult dataset to assess the performance as well as the data utility.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信