Answers are grounded in this paper and cite their sources.
Objective: Biomedical data can be de-identified via micro-aggregation achieving privacy. However, the existing micro-aggregation algorithms result in low similarity within the equivalence classes, and thus, produce low-utility anonymous data when dealing with a sparse biomedical dataset. To balance data utility and anonymity, we develop a novel microaggregation framework. Methods: Combining a density-based clustering method and classical micro-aggregation algorithm, we propose a density-based second division micro-aggregation framework called DBTP . The framework allows the anonymous sets to achieve the optimal k- partition with an increased homogeneity of the tuples in the equivalence class. Based on the proposed framework, we propose a k − anonymity algorithm DBTP − MDAV and an l − diversity algorithm DBTP − l − MDAV to respond to different attacks. Conclusion: Experiments on real-life biomedical datasets confirm that the anonymous algorithms under the framework developed in this paper are superior to the existing algorithms for achieving high utility.
No takes yet. Share an insight, caveat, or question.
Wu et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: