.png){kind=icon}
返回
Maximizing accuracy of shared databases when concealing sensitive patterns
.png){kind=icon}
PRE
AI
DOI：10.1287/isre.1050.0056.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The sharing of databases either within or across organizations raises the possibility of unintentionally revealing sensitive relationships contained in them. Recent advances in data-mining technology have increased the chances of such disclosure. Consequently, firms that share their databases might choose to hide these sensitive relationships prior to sharing. Ideally, the approach used to hide relationships should be impervious to as many data-mining techniques as possible, while minimizing the resulting distortion to the database. This paper focuses on frequent item sets, the identification of which forms a critical initial step in a variety of data-mining tasks. it presents an optimal approach for hiding sensitive item sets, while keeping the number of modified transactions to a minimum. The approach is particularly attractive as it easily handles databases with millions of transactions. Results from extensive tests, conducted on publicly available real data and data generated using IBM's synthetic data generator indicate that the approach presented is very effective, optimally solving problems involving millions of transactions in a few seconds.
Keyword:
data quality
privacy
item set mining
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.1
论文数:
1.4K
被引数:
1.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
Evaluation of desialylation during 2-amino benzamide labeling of asparagine-linked oligosaccharides
PREAI
分享收藏
查看更多内容