.png){kind=icon}
Return
A New Multidimensional Data Anonymization Algorithm for Privacy-Preserving Data Publishing
.png){kind=icon}
OA
AI
DOI：10.3390/electronics15143167.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Developing a privacy-preserving data publishing algorithm that prevents individuals’ identity information from being disclosed without ignoring the utility of the data is still an important goal to be achieved. Finding the optimal balance between data utility and data privacy is an NP-hard problem. In this study, a new k-anonymization-based data anonymization algorithm is proposed. The proposed algorithm partitions the data space with a new efficient partitioning strategy based on the k-dimensional tree (KD-tree), resolves the boundary problem while maintaining the trade-off balance, and introduces a new mechanism to address the problems caused by outliers. Moreover, it can be applied to both numerical and categorical data. The experimental results indicate that the proposed algorithm achieves competitive or improved performance compared with the baseline algorithms across seven commonly used evaluation metrics. Overall, the findings suggest that the proposed framework can improve the utility–privacy trade-off in multidimensional k-anonymization.
Keywords:
data anonymization
information loss
privacy-preserving data publishing
<i>k</i>-anonymity
generalization
Journal
IF:
2.6
Papers:
1.0W
Citations:
4.7W
Organization
Cited Papers
A probabilistic approach to mitigate composition attacks on privacy in non-coordinated environments
OAAI
OAAIShareSaveAn Efficient Big Data Anonymization Algorithm Based on Chaos and Perturbation Techniques.png)
EntropyOAAI
EntropyIF0
OAAIShareSaveShareSave
View more