Exact and heuristic methods for cell suppression in multi-dimensional linked tables / Roehrig, S. F. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 291–304 Titre : Exact and heuristic methods for cell suppression in multi-dimensional linked tables Type de document : texte imprimé Auteurs : Roehrig, S. F., Auteur ; Padman, R., Auteur ; Krishnan, R., Auteur Année de publication : 2011 Article en page(s) : pp. 291–304 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Privacy Confidentiality Heuristics Inferential disclosure Cell suppression Tabu search Index. décimale : 001.424 Résumé : 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. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010133a.html [article] Exact and heuristic methods for cell suppression in multi-dimensional linked tables [texte imprimé] / Roehrig, S. F., Auteur ; Padman, R., Auteur ; Krishnan, R., Auteur . - 2011 . - pp. 291–304. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 291–304 Mots-clés : Privacy Confidentiality Heuristics Inferential disclosure Cell suppression Tabu search Index. décimale : 001.424 Résumé : 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. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010133a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire