Issue No. 12 - December (2010 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.213
Osman Abul , TOBB University of Economics and Technology, Ankara
Francesco Bonchi , Yahoo! Research, Barcelona
Fosca Giannotti , ISTI-CNR, Pisa
The process of discovering relevant patterns holding in a database was first indicated as a threat to database security by O'Leary in [CHECK END OF SENTENCE]. Since then, many different approaches for knowledge hiding have emerged over the years, mainly in the context of association rules and frequent item sets mining. Following many real-world data and application demands, in this paper, we shift the problem of knowledge hiding to contexts where both the data and the extracted knowledge have a sequential structure. We define the problem of hiding sequential patterns and show its NP-hardness. Thus, we devise heuristics and a polynomial sanitization algorithm. Starting from this framework, we specialize it to the more complex case of spatiotemporal patterns extracted from moving objects databases. Finally, we discuss a possible kind of attack to our model, which exploits the knowledge of the underlying road network, and enhance our model to protect from this kind of attack. An exhaustive experiential analysis on real-world data sets shows the effectiveness of our proposal.
Sequential patterns, spatiotemporal patterns, knowledge hiding, data publishing.
O. Abul, F. Bonchi and F. Giannotti, "Hiding Sequential and Spatiotemporal Patterns," in IEEE Transactions on Knowledge & Data Engineering, vol. 22, no. , pp. 1709-1723, 2009.