Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Approximate query processing using wavelets
The VLDB Journal — The International Journal on Very Large Data Bases
Privacy preserving mining of association rules
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Privacy preserving frequent itemset mining
CRPIT '14 Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14
Database Systems Concepts
Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data
IEEE Transactions on Knowledge and Data Engineering
SHIFT-SPLIT: I/O efficient maintenance of wavelet-transformed multidimensional data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
Quantitative Association Rules Mining Methods with Privacy-preserving
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
A Tree-Based Data Perturbation Approach for Privacy-Preserving Data Mining
IEEE Transactions on Knowledge and Data Engineering
The Data Warehouse Lifecycle Toolkit
The Data Warehouse Lifecycle Toolkit
Target-based database synchronization
Proceedings of the 2010 ACM Symposium on Applied Computing
Hi-index | 0.00 |
Association rule mining is an important data mining task applicable across many commercial and scientific domains. There are instances when association analysis must be conducted by a third party over data located at a central point, but updated from several source locations. The source locations may not allow tracking changes. The target location must then take charge of the changed data detection and privatization process. We propose a solution to conduct privacy preserving association rule mining on such data. An evaluation of our approach shows that compared to existing approaches, it renders higher privacy, preserves 90% -100% of the rules and is efficient for 10% database changes.