Document Type : Original/Review Paper
Authors
1 Department of Electronic & Computer Engineering, Institute for Higher Education Pouyandegan Danesh, Chalous, Iran.
2 Department of Computer Engineering, University of Guilan, Rasht, Iran.
3 Department of Mathematics, Chalous Branch, Islamic Azad University, Chalous, Iran.
Abstract
Data sanitization is a process that is used to promote the sharing of transactional databases among organizations and businesses, it alleviates concerns for individuals and organizations regarding the disclosure of sensitive patterns. It transforms the source database into a released database so that counterparts cannot discover the sensitive patterns and so data confidentiality is preserved against association rule mining method. This process strongly rely on the minimizing the impact of data sanitization on the data utility by minimizing the number of lost patterns in the form of non-sensitive patterns which are not mined from sanitized database. This study proposes a data sanitization algorithm to hide sensitive patterns in the form of frequent itemsets from the database while controls the impact of sanitization on the data utility using estimation of impact factor of each modification on non-sensitive itemsets. The proposed algorithm has been compared with Sliding Window size Algorithm (SWA) and Max-Min1 in term of execution time, data utility and data accuracy. The data accuracy is defined as the ratio of deleted items to the total support values of sensitive itemsets in the source dataset. Experimental results demonstrate that proposed algorithm outperforms SWA and Max-Min1 in terms of maximizing the data utility and data accuracy and it provides better execution time over SWA and Max-Min1 in high scalability for sensitive itemsets and transactions.
Keywords
- Data Sanitization
- Association rule hiding
- Frequent Itemsets
- Association Rule Mining
- Privacy preserving data mining
Main Subjects
)