PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Giannotti F., Bonchi F., Abul O. Hiding sequential and spatiotemporal patterns. In: Ieee Transactions on Knowledge and Data Engineering, vol. 22 (12) pp. 1709 - 1723. IEEE, 2010.
 
 
Abstract
(English)
The process of discovering relevant patterns holding in a database was first indicated as a threat to database security by O'Leary in [1]. 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.
URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5374402
DOI: 10.1109/TKDE.2009.213
Subject Sequential patterns
Spatiotemporal patterns
Knowledge hiding
Data publishing
H.2.8 Database Management. Database Applications
H.2.7 Database Administration
E.3 Data Encryption


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional