Privacy preserving processing of data decision tree based on sample selection and Singular Value Decomposition

Priyank Jain, Neelam Pathak, Pratibhadevi Tapashetti, A. Umesh
{"title":"Privacy preserving processing of data decision tree based on sample selection and Singular Value Decomposition","authors":"Priyank Jain, Neelam Pathak, Pratibhadevi Tapashetti, A. Umesh","doi":"10.1109/ISIAS.2013.6947739","DOIUrl":null,"url":null,"abstract":"Data mining is a set of automated techniques used to extract hidden or buried information from large databases. With the development of data mining technologies, privacy protection has become a challenge for data mining applications in many fields. To solve this problem, many privacy-preserving data mining methods have been proposed. One important type of such methods is based on Singular Value Decomposition (SVD). In the proposed algorithm, attributes are grouped according to their distance difference similarity by clustering the data set using decision tree classification. Secondly, the algorithm packetizes the attributes according to their SA value in each group. Thirdly, for each group it selects attributes from the smallest bucket and searches for a similar attributes in the attributes-1 largest buckets from the same group to create an equivalence class following the unique attribute-distinct diversity anonymization model. The proposed algorithm satisfies the “utility based anonymization principle that crucial information is protected from being suppressed. Also, weights given to attributes improve clustering and give the ability to control the generalization's depth. In prototype decision tree is combination of clustering and classification technique such methods are called ensemble classifier, this new proposed method is more efficient in balancing data privacy and data utility.","PeriodicalId":370107,"journal":{"name":"2013 9th International Conference on Information Assurance and Security (IAS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 9th International Conference on Information Assurance and Security (IAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIAS.2013.6947739","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Data mining is a set of automated techniques used to extract hidden or buried information from large databases. With the development of data mining technologies, privacy protection has become a challenge for data mining applications in many fields. To solve this problem, many privacy-preserving data mining methods have been proposed. One important type of such methods is based on Singular Value Decomposition (SVD). In the proposed algorithm, attributes are grouped according to their distance difference similarity by clustering the data set using decision tree classification. Secondly, the algorithm packetizes the attributes according to their SA value in each group. Thirdly, for each group it selects attributes from the smallest bucket and searches for a similar attributes in the attributes-1 largest buckets from the same group to create an equivalence class following the unique attribute-distinct diversity anonymization model. The proposed algorithm satisfies the “utility based anonymization principle that crucial information is protected from being suppressed. Also, weights given to attributes improve clustering and give the ability to control the generalization's depth. In prototype decision tree is combination of clustering and classification technique such methods are called ensemble classifier, this new proposed method is more efficient in balancing data privacy and data utility.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于样本选择和奇异值分解的数据决策树隐私保护处理
数据挖掘是一组用于从大型数据库中提取隐藏或隐藏信息的自动化技术。随着数据挖掘技术的发展,隐私保护已成为数据挖掘在许多领域应用所面临的挑战。为了解决这一问题,人们提出了许多保护隐私的数据挖掘方法。其中一种重要的方法是基于奇异值分解(SVD)。该算法采用决策树分类对数据集进行聚类,根据属性的距离差相似度对属性进行分组。其次,算法根据属性在每组中的SA值对属性进行分组;第三,对于每个组,它从最小的桶中选择属性,并在同一组的attributes-1最大的桶中搜索相似的属性,以创建一个遵循唯一属性-不同多样性匿名化模型的等价类。该算法满足“基于效用的匿名化”原则,即关键信息不会被抑制。此外,赋予属性的权重可以改善聚类,并提供控制泛化深度的能力。在原型决策树是聚类和分类技术的结合,这种方法被称为集成分类器,这种新方法在平衡数据隐私和数据效用方面更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Quantitative penetration testing with item response theory An intelligent system for video events detection The state of the art of risk assessment and management for information systems A survey on digital tracing traitors schemes Finger verification Using SVD features
×
引用
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