The Effectiveness of Data Shuffling for Privacy-Preserving Data Mining Applications

Han Li, Krishnamurty Muralidhar and Rathindra Sarathy

Journal of Information Privacy and Security, 2012, vol. 8, issue 2, 3-17

Abstract: 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.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/15536548.2012.10845652 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uipsxx:v:8:y:2012:i:2:p:3-17

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uips20

DOI: 10.1080/15536548.2012.10845652

Access Statistics for this article

Journal of Information Privacy and Security is currently edited by Chuleeporn Changchit

More articles in Journal of Information Privacy and Security from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().