A Credential Data Privacy Preserving in web Environment using Secure Data Contribution Retrieval Algorithm

IF 2.2 Q3 COMPUTER SCIENCE, CYBERNETICS International Journal of Intelligent Computing and Cybernetics Pub Date : 2017-06-30 DOI:10.22266/IJIES2017.0630.41
K. Umapathy, Neelu Khare
{"title":"A Credential Data Privacy Preserving in web Environment using Secure Data Contribution Retrieval Algorithm","authors":"K. Umapathy, Neelu Khare","doi":"10.22266/IJIES2017.0630.41","DOIUrl":null,"url":null,"abstract":"Preservation of privacy is a significant aspect of data mining and as the secrecy of sensitive information must be maintained while sharing the data among different untrusted parties. There are many application is suffering from vulnerable, data leakage, data misuse, and sensitive data disclosure issues. To protect the privacy of sensitive data without losing the usability of data, various techniques have been used in privacy-preserving data mining (PPDM). Some of the approaches are available to maintain the tight privacy, but they fail to minimize the execution time and error rate. The main objective of the article is to contribute and retrieve the data with minimal classification error and execution time with enhanced privacy. To overcome the issues, the paper introduces the Secure Data Contribution Retrieval algorithm (SDCRA) to fulfill the current issues. Proposed algorithms define a privacy policy and arrange the security based on requirements. This design applies the privacy based on the compatibility of applications. This approach is capable of satisfying the accuracy constraints for multiple datasets. It also considers the efficient data extraction with a good ranking of attributes in tables. Here, proposed SDCRA is compared with existing approaches namely as Perturbation, singular value decomposition (SVD), Singular Value Decomposition data Perturbation (SVD+DP), K-anonymity with Decision Tree (KA+DT)[] for Cancer, HIV, Diabetes dataset. Based on experimental result proposed approach performs well regarding success rate, error rate and system execution time compare than existing methods. Proposed approach improves Success Rate 1.83% reduces the Error Rate 2.33% and minimizes the system execution time 2 seconds.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"8 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2017-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Computing and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22266/IJIES2017.0630.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

Preservation of privacy is a significant aspect of data mining and as the secrecy of sensitive information must be maintained while sharing the data among different untrusted parties. There are many application is suffering from vulnerable, data leakage, data misuse, and sensitive data disclosure issues. To protect the privacy of sensitive data without losing the usability of data, various techniques have been used in privacy-preserving data mining (PPDM). Some of the approaches are available to maintain the tight privacy, but they fail to minimize the execution time and error rate. The main objective of the article is to contribute and retrieve the data with minimal classification error and execution time with enhanced privacy. To overcome the issues, the paper introduces the Secure Data Contribution Retrieval algorithm (SDCRA) to fulfill the current issues. Proposed algorithms define a privacy policy and arrange the security based on requirements. This design applies the privacy based on the compatibility of applications. This approach is capable of satisfying the accuracy constraints for multiple datasets. It also considers the efficient data extraction with a good ranking of attributes in tables. Here, proposed SDCRA is compared with existing approaches namely as Perturbation, singular value decomposition (SVD), Singular Value Decomposition data Perturbation (SVD+DP), K-anonymity with Decision Tree (KA+DT)[] for Cancer, HIV, Diabetes dataset. Based on experimental result proposed approach performs well regarding success rate, error rate and system execution time compare than existing methods. Proposed approach improves Success Rate 1.83% reduces the Error Rate 2.33% and minimizes the system execution time 2 seconds.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于安全数据贡献检索算法的web环境下凭证数据隐私保护
隐私保护是数据挖掘的一个重要方面,因为在不同的不可信方之间共享数据时必须保持敏感信息的保密性。许多应用程序都存在易受攻击、数据泄露、数据滥用和敏感数据泄露等问题。为了在不丧失数据可用性的前提下保护敏感数据的隐私,在隐私保护数据挖掘(PPDM)中使用了各种技术。有些方法可以保持严格的隐私,但它们不能最大限度地减少执行时间和错误率。本文的主要目标是以最小的分类错误和执行时间提供和检索数据,并增强隐私性。为了克服这些问题,本文引入了安全数据贡献检索算法(SDCRA)来解决当前的问题。提出的算法定义了隐私策略,并根据需求安排安全性。该设计基于应用程序的兼容性来实现隐私保护。该方法能够满足多数据集的精度约束。它还考虑了有效的数据提取和表中属性的良好排序。本文将提出的SDCRA与现有的针对癌症、HIV、糖尿病数据集的摄动、奇异值分解(SVD)、奇异值分解数据摄动(SVD+DP)、k -匿名决策树(KA+DT)[]方法进行了比较。实验结果表明,该方法在成功率、错误率和系统执行时间方面均优于现有方法。该方法提高了1.83%的成功率,降低了2.33%的错误率,使系统执行时间缩短了2秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
6.80
自引率
4.70%
发文量
26
期刊最新文献
Six classes named entity recognition for mapping location of Indonesia natural disasters from twitter data Evaluation of predicted fault tolerance based on C5.0 decision tree algorithm in irrigation system of paddy fields Manifold embedded global and local discriminative features selection for single-shot multi-categories clothing recognition and retrieval Exploring the differentiated elderly service subsidies considering consumer word-of-mouth preferences TaskMatrix.AI: Completing Tasks by Connecting Foundation Models with Millions of APIs
×
引用
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