In this paper, we first present a multi-objective algorithm for hiding the sensitive information with transaction deletion based on the NSGAII framework. The proposed can efficiently sort the non-dominated solutions and find the set of Pareto results for later process. Experimental results on two real datasets illustrated that the proposed algorithm can achieve satisfactory results with fewer side effects compared to the previous single-objective evolutionary approaches.
CITATION STYLE
Lin, J. C. W., Zhang, Y., Fournier-Viger, P., Djenouri, Y., & Zhang, J. (2018). A metaheuristic algorithm for hiding sensitive itemsets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11030 LNCS, pp. 492–498). Springer Verlag. https://doi.org/10.1007/978-3-319-98812-2_45
Mendeley helps you to discover research relevant for your work.