A compression strategy for an efficient TSP-based microaggregation

作者：

Highlights：

• We improve the performance of TSP-based heuristics regardless of the size of data.

• According to data, we can reduce the computational time and the introduced error.

• Extensive experiments show how our method is able to outperform the current soa.

摘要

•We improve the performance of TSP-based heuristics regardless of the size of data.•According to data, we can reduce the computational time and the introduced error.•Extensive experiments show how our method is able to outperform the current soa.

论文关键词：Statistical disclosure control,Microaggregation,Data privacy,Travelling Salesman Problem,Data protection,k-anonymity

论文评审过程：Received 10 July 2022, Revised 29 September 2022, Accepted 3 October 2022, Available online 10 October 2022, Version of Record 17 October 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.118980