.png){kind=icon}
返回
Lower-bounding procedures for the 2-dimensional cell suppression problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00087-9.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To protect confidential data from disclosure, statistical offices use a technique called cell suppression which consists of suppressing data from the statistical tables they publish. As some row and column subtotals are published, omitting just the confidential values does not guarantee in every case that they cannot be disclosed or estimated within a narrow range. Therefore to protect confidential data it is often necessary to make complementary suppressions, that is, to suppress also values that are not confidential. Assigning a cost to every complementary suppression, the cell suppression problem is that of finding a set of complementary suppressions with minimum total cost. In this paper new necessary protection conditions are presented. Combining these new conditions with the ones known from the literature new lower-bounding methods for the cell suppression problem are developed. Dominance theoretical results are proven and computational experience is reported for randomly generated tables. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
integer programming
statistical disclosure
cell suppression problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
.png){kind=icon}
