Non-linear dimensionality reduction for privacy-preserving data classification

Alotaibi, K., Rayward-Smith, V.J., Wang, W. and De La Iglesia, B. ORCID: (2012) Non-linear dimensionality reduction for privacy-preserving data classification. In: Proceedings - 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and 2012 ASE/IEEE International Conference on Social Computing, SocialCom/PASSAT 2012. UNSPECIFIED, pp. 694-701. ISBN 9780769548487

Full text not available from this repository. (Request a copy)


Many techniques have been proposed to protect the privacy of data outsourced for analysis by external parties. However, most of these techniques distort the underlying data properties, and therefore, hinder data mining algorithms from discovering patterns. The aim of Privacy-Preserving Data Mining (PPDM) is to generate a data-friendly transformation that maintains both the privacy and the utility of the data. We have proposed a novel privacy-preserving framework based on non-linear dimensionality reduction (i.e. non-metric multidimensional scaling) to perturb the original data. The perturbed data exhibited good utility in terms of distance-preservation between objects. This was tested on a clustering task with good results. In this paper, we test our novel PPDM approach on a classification task using a k-Nearest Neighbour (k-NN) classification algorithm. We compare the classification results obtained from both the original and the perturbed data and find them to be much same particularly for the few lower dimensions. We show that, for distance-based classification, our approach preserves the utility of the data while hiding the private details.

Item Type: Book Section
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Pure Connector
Date Deposited: 22 Jul 2013 16:15
Last Modified: 18 Apr 2023 01:03
DOI: 10.1109/SocialCom-PASSAT.2012.76

Actions (login required)

View Item View Item