Flexible Anonymization of Transactions with Sensitive Items
Yu‐Chuan Tsai, Shyue-Liang Wang, I‐Hsien Ting, Tzung‐Pei Hong
Abstract
Yu‐Chuan Tsai, Shyue-Liang Wang, I‐Hsien Ting, Tzung‐Pei Hong
Abstract
In recent years, privacy preserving data publishing attracted many attentions due to the concern of privacy breaches. The removing of personal identifiable information, such as the naïve anonymization, is not sufficient. The privacy preserving data publishing technologies transform data into a form that sensitive personal information cannot be identified and retaining to the greatest extent possible usefulness of published data. In this work, we propose a novel strategy to deal with the sensitive items and quasi-identifier items separately. The proposed algorithm has at least the same or stronger privacy level for k-anonymity on transactional data, 1/ k. According to the numerical experiment results, our proposed strategy has better performance on running time, better data utility.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In recent years, privacy preserving data publishing attracted many attentions due to the concern of privacy breaches. The removing of personal identifiable information, such as the naïve anonymization, is not sufficient. The privacy preserving data publishing technologies transform data into a form that sensitive personal information cannot be identified and retaining to the greatest extent possible usefulness of published data. In this work, we propose a novel strategy to deal with the sensitive items and quasi-identifier items separately. The proposed algorithm has at least the same or stronger privacy level for k-anonymity on transactional data, 1/ k. According to the numerical experiment results, our proposed strategy has better performance on running time, better data utility.
Key concepts: Computer science, Data publishing, Data anonymization, Identifier, k-anonymity, Personally identifiable information, Anonymity, Information sensitivity