一种新的隐私保护敏感数据挖掘模型

M. Prakash, G. Singaravel
{"title":"一种新的隐私保护敏感数据挖掘模型","authors":"M. Prakash, G. Singaravel","doi":"10.1109/ICCCNT.2012.6396017","DOIUrl":null,"url":null,"abstract":"Data Mining and Knowledge Discovery is an indispensable technology for business and researches in many fields such as statistics, machine learning, pattern recognition, databases and high performance computing. In which Privacy Preserving Data Mining has the potential to increase the reach and benefits of data mining technology. This allows publishing a microdata without disclosing private information. Publishing data about individuals without revealing sensitive information about them is an important problem. k-anonymity and l-Diversity has been proposed as a mechanism for protecting privacy in microdata publishing. But both the mechanisms are insufficient to protect the privacy issues like Homogeneity attack, Skewness Attack, Similarity attack and Background Knowledge Attack. A new privacy measure called “(n, t)-proximity” is proposed which is more flexible model. Here first introduction about data mining is presented, and then research challenges are given. Followed by privacy preservation measures and problems with k-anonymity and l-Diversity are discussed. The rest of the paper is organised as (n, t)-proximity model, experimental results and analysis followed by conclusion.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"A new model for privacy preserving sensitive Data Mining\",\"authors\":\"M. Prakash, G. Singaravel\",\"doi\":\"10.1109/ICCCNT.2012.6396017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data Mining and Knowledge Discovery is an indispensable technology for business and researches in many fields such as statistics, machine learning, pattern recognition, databases and high performance computing. In which Privacy Preserving Data Mining has the potential to increase the reach and benefits of data mining technology. This allows publishing a microdata without disclosing private information. Publishing data about individuals without revealing sensitive information about them is an important problem. k-anonymity and l-Diversity has been proposed as a mechanism for protecting privacy in microdata publishing. But both the mechanisms are insufficient to protect the privacy issues like Homogeneity attack, Skewness Attack, Similarity attack and Background Knowledge Attack. A new privacy measure called “(n, t)-proximity” is proposed which is more flexible model. Here first introduction about data mining is presented, and then research challenges are given. Followed by privacy preservation measures and problems with k-anonymity and l-Diversity are discussed. The rest of the paper is organised as (n, t)-proximity model, experimental results and analysis followed by conclusion.\",\"PeriodicalId\":364589,\"journal\":{\"name\":\"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCNT.2012.6396017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCNT.2012.6396017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

摘要

数据挖掘和知识发现在统计学、机器学习、模式识别、数据库和高性能计算等许多领域都是商业和研究中不可或缺的技术。其中,保护隐私的数据挖掘有可能增加数据挖掘技术的范围和收益。这允许在不泄露私有信息的情况下发布微数据。在不泄露个人敏感信息的情况下发布个人数据是一个重要问题。k-匿名和l-多样性被提出作为微数据发布中的隐私保护机制。但这两种机制都不足以保护同质性攻击、偏度攻击、相似性攻击和背景知识攻击等隐私问题。提出了一种更灵活的隐私度量模型“(n, t)-接近度”。本文首先介绍了数据挖掘的相关知识,然后指出了数据挖掘研究面临的挑战。然后讨论了隐私保护措施以及k-匿名和l-多样性问题。本文的其余部分组织为(n, t)-接近模型,实验结果和分析,然后是结论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new model for privacy preserving sensitive Data Mining
Data Mining and Knowledge Discovery is an indispensable technology for business and researches in many fields such as statistics, machine learning, pattern recognition, databases and high performance computing. In which Privacy Preserving Data Mining has the potential to increase the reach and benefits of data mining technology. This allows publishing a microdata without disclosing private information. Publishing data about individuals without revealing sensitive information about them is an important problem. k-anonymity and l-Diversity has been proposed as a mechanism for protecting privacy in microdata publishing. But both the mechanisms are insufficient to protect the privacy issues like Homogeneity attack, Skewness Attack, Similarity attack and Background Knowledge Attack. A new privacy measure called “(n, t)-proximity” is proposed which is more flexible model. Here first introduction about data mining is presented, and then research challenges are given. Followed by privacy preservation measures and problems with k-anonymity and l-Diversity are discussed. The rest of the paper is organised as (n, t)-proximity model, experimental results and analysis followed by conclusion.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信