Hiding information by cell suppression.
Joining relational data can jeopardize patient confidentiality if disseminated data for research can be joined with publicly available data containing, for example, explicit identifiers. Ambiguity in data hinders the construction of primary keys that are of importance when joining data tables. We define two values to be indiscernible if they are the same or at least one of them is a special value. Two rows in a data table are indiscernible if their corresponding entries are indiscernible. We further define a table to be k-ambiguous if each row is indiscernible from at least k rows in the same table. We present two simple heuristics to make a table k-ambiguous by cell suppression, and compare them on example data.
Vinterbo
S A
SA
Decision Systems Group, Brigham and Women's Hospital, Harvard Medical School, Boston, Massachusetts, USA. staal@dsg.harvard.edu
Ohno-Machado
L
L
Dreiseitl
S
S
D000465:Algorithms; D003219:Confidentiality; D016347:Medical Records Systems, Computerized