Solving bin-packing problems under privacy preservation: Possibilities and trade-offs
We investigate the trade-off between privacy and solution quality that occurs when a kanonymized database is used as input to the bin-packing optimization problem. To investigate the impact of the chosen anonymization method on this trade-off, we consider two recoding methods for k-anonymity: full-domain generalization and partition-based single-dimensional recoding. To deal with the uncertainty created by anonymization in the bin-packing problem, we utilize stochastic programming and robust optimization methods. Our computational results show that the trade-off is strongly dependent on both the anonymization and optimization method. On the anonymization side, we see that using single dimensional recoding leads to significantly better solution quality than using full domain generalization. On the optimization side, we see that using stochastic programming, where we use the multiset of values in an equivalence class, considerably improves the solutions. While publishing these multisets makes the database more vulnerable to a table linkage attack, we argue that it is up to the data publisher to reason if such a loss of anonymization weighs up to the increase in optimization performance.
|Keywords||Data anonymization, Bin-packing, k-anonymity, Stochastic programming, Robust optimization|
|Persistent URL||dx.doi.org/10.1016/j.ins.2019.05.011, hdl.handle.net/1765/116697|
Hoogervorst, R, Zhang, Y, Tillem, G., Erkin, Z., & Verwer, S. (2019). Solving bin-packing problems under privacy preservation: Possibilities and trade-offs. Information Sciences, 500, 203–216. doi:10.1016/j.ins.2019.05.011