Efficient privacy preservation of big data for accurate data mining

Abstract

Computing technologies pervade physical spaces and human lives, and produce a vast amount of data that is available for analysis. However, there is a growing concern that potentially sensitive data may become public if the collected data are not appropriately sanitized before being released for investigation. Although there are more than a few privacy-preserving methods available, they are not efficient, scalable or have problems with data utility, and/or privacy. This paper addresses these issues by proposing an efficient and scalable nonreversible perturbation algorithm, PABIDOT, for privacy preservation of big data via optimal geometric transformations. PABIDOT was tested for efficiency, scalability, resistance, and accuracy using nine datasets and five classification algorithms. Experiments show that PABIDOT excels in execution speed, scalability, attack resistance and accuracy in large-scale privacy-preserving data classification when compared with two other, related privacy-preserving algorithms.

Information Sciences

References in corpus (4)

• Saving Human Lives: What Complexity Science and Information Systems can Contribute
• Privacy Loss in Apple's Implementation of Differential Privacy on MacOS 10.12
• Grand challenges in social physics: In pursuit of moral behavior
• Efficient Data Perturbation for Privacy Preserving and Accurate Data Stream Mining

Cited by in corpus (7)

• Local Differential Privacy for Deep Learning
• Privacy Preserving Face Recognition Utilizing Differential Privacy
• Privacy Preserving Distributed Machine Learning with Federated Learning
• An Efficient and Scalable Privacy Preserving Algorithm for Big Data and Data Streams
• A Survey on Vulnerability of Federated Learning: A Learning Algorithm Perspective
• PPaaS: Privacy Preservation as a Service
• An In-depth Review of Privacy Concerns Raised by the COVID-19 Pandemic