.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
The problem of disseminating a data set for machine learning while controlling the disclosure of data source identity is described using a commuting diagram of functions. This formalization is used to present and analyze an optimization problem balancing privacy and data utility requirements. The analysis points to the application of a generalization mechanism for maintaining privacy in view of machine learning needs. We present new proofs of NP-hardness of the problem of minimizing information loss while satisfying a set of privacy requirements, both with and without the addition of a particular uniform coding requirement. As an initial analysis of the approximation properties of the problem, we show that the cell suppression problem with a constant number of attributes can be approximated within a constant. As a side effect, proofs of NP-hardness of the minimum k-union, maximum k-intersection, and parallel versions of these are presented. Bounded versions of these problems are also shown to be approximable within a constant.
Keyword:
privacy
disclosure control
combinatorial optimization
complexity
approximation properties
machine learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享.png){kind=icon}
收藏分享收藏分享收藏分享收藏The Use and Abuse of Historical Reenactment: Thoughts on Recent Trends in Public History.png)
Criticism.png)
CriticismIF0
PREAI
分享收藏Ch. 18: Midwest. Climate Change Impacts in the United States: The Third National Climate Assessment
IF0
PREAI
分享收藏
查看更多内容