Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62024
Title: DETECTIVE: a decision tree based categorical value clustering and perturbation technique for preserving privacy in data mining
Contributor(s): Islam, M Z (author); Brankovic, L  (author)orcid 
Publication Date: 2005
DOI: 10.1109/INDIN.2005.1560461
Handle Link: https://hdl.handle.net/1959.11/62024
Abstract: 

Data mining is a powerful tool for information discovery from huge datasets. Various sectors, including commercial, government, financial, medical, and scientific, are applying data mining techniques on their datasets that typically contain sensitive individual information. During this process the datasets get exposed to several parties, which can potentially lead to disclosure of sensitive information and thus to breaches of privacy. Several data mining privacy preserving techniques have been recently proposed. In this paper we focus on data perturbation techniques, i.e., those that add noise to the data in order to prevent exact disclosure of confidential values. Some of these techniques were designed for datasets having only numerical non-class attributes and a categorical class attribute. However, natural datasets are more likely to have both numerical and categorical non-class attributes, and occasionally they contain only categorical attributes. Noise addition techniques developed for numerical attributes are not suitable for such datasets, due to the absence of natural ordering among categorical values. In this paper we propose a new method for adding noise to categorical values, which makes use of the clusters that exist among these values. We first discuss several existing categorical clustering methods and point out the limitations they exhibit in our context. Then we present a novel approach towards clustering of categorical values and use it to perturb data while maintaining the patterns in the dataset. Our clustering approach partitions the values of a given categorical attribute rather than the records of the datasets" additionally, our approach operates on the horizontally partitioned dataset and it is possible for two values to belong to the same cluster in one horizontal partition of the dataset, and to two distinct clusters in another partition. Finally, we provide some experimental results in order to evaluate our perturbation technique and to compare our clustering approach with an existing method, the so-called CACTUS.

Publication Type: Conference Publication
Conference Details: INDIN 2005: 3rd IEEE International Conference on Industrial Informatics (INDIN) Conference, Perth, WA, Australia, 10th to 12th of August, 2005
Source of Publication: 2005 3rd IEEE International Conference on Industrial Informatics, INDIN, p. 701-708
Publisher: IEEE Xplore
Place of Publication: United States of America
Fields of Research (FoR) 2020: 460402 Data and information privacy
460502 Data mining and knowledge discovery
Socio-Economic Objective (SEO) 2020: 220499 Information systems, technologies and services not elsewhere classified
Peer Reviewed: Yes
HERDC Category Description: E1 Refereed Scholarly Conference Publication
Appears in Collections:Conference Publication
School of Science and Technology

Files in This Item:
1 files
File SizeFormat 
Show full item record
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.