The Effectiveness of Data Shuffling for Privacy-Preserving Data Mining Applications
Han Li, Krishnamurty Muralidhar, Rathindra Sarathy · Journal of Information Privacy and Security · 2012
Preserving the confidentiality of sensitive data, while permitting knowledge discovery, is an important goal in privacy-preserving data mining. This paper investigates the effectiveness of data shuffling for classification tree and regression analysis. We compare the effectiveness of data shuffling to the tree based data perturbation method which was developed specifically for the purpose of data mining. Results suggest that data shuffling provides the higher levels of data security and more effectively preserves data mining knowledge than tree based data perturbation method.