Exact and heuristic methods for cell suppression in multi-dimensional linked tables
| Autor: | Rema Padman, George T. Duncan, Stephen Roehrig, Ramayya Krishnan |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
Marketing
Information privacy Theoretical computer science Operations research Computer science Heuristic Strategy and Management 05 social sciences Management Science and Operations Research 01 natural sciences Tabu search Management Information Systems Scheduling (computing) 010104 statistics & probability 0502 economics and business Information system Process capability index 0101 mathematics Heuristics Integer programming 050205 econometrics |
| Zdroj: | Journal of the Operational Research Society. 62:291-304 |
| ISSN: | 1476-9360 0160-5682 |
| DOI: | 10.1057/jors.2010.133 |
| Popis: | The increasing demand for information, coupled with the increasing capability of computer systems, has compelled information providers to reassess their procedures for preventing disclosure of confidential information. This paper considers the problem of protecting an unpublished, sensitive table by suppressing cells in related, published tables. A conventional integer programming technique for two-dimensional tables is extended to find an optimal suppression set for the public tables. This can be used to protect the confidentiality of sensitive data in three- and higher-dimensional tables. More importantly, heuristics that are intimately related to the structure of the problem are also presented to mitigate the computational difficulty of the integer program. An example is drawn from healthcare management. Data tables are randomly generated to assess the computational time/space restrictions of the IP model, and to evaluate the heuristics. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink