Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Why Swap When You Can Shuffle? A Comparison of the Proximity Swap and Data Shuffle for Numeric Data
verfasst von : Krish Muralidhar, Rathindra Sarathy, Ramesh Dandekar
Erschienen in: Privacy in Statistical Databases
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The rank based proximity swap has been suggested as a data masking mechanism for numerical data. Recently, more sophisticated procedures for masking numerical data that are based on the concept of “shuffling” the data have been proposed. In this study, we compare and contrast the performance of the swapping and shuffling procedures. The results indicate that the shuffling procedures perform better than data swapping both in terms of data utility and disclosure risk.