Cart (Loading....) | Create Account
Close category search window
 

Hiding sensitive items in privacy preserving association rule mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shyue-Liang Wang ; Dept. of Comput. Sci., New York Inst. of Technol., NY, USA ; Yu-Huei Lee ; Billis, S. ; Jafari, A.

Privacy-preserving data mining [Agrawal, R., et al., May 2000] has recently emerged to address one of the negative sides of data mining technology: the threat to individual privacy. For example, through data mining, one is able to infer sensitive information, including personal information or even patterns, from non-sensitive information or unclassified data. There have been two broad approaches for privacy-preserving data mining. The first approach is to alter the data before delivery to the data miner so that real values are obscured. The second approach assumes the data is distributed between two or more sites, and these sites cooperate to learn the global data mining results without revealing the data at their individual sites. Given specific rules to be hidden, many data altering techniques for hiding association, classification and clustering rules have been proposed. However, to specify hidden rules, entire data mining process needs to be executed. For some applications, we are only interested in hiding certain sensitive items. In this work, we assume that only sensitive items are given and propose two algorithms to modify data in database so that sensitive items cannot be inferred through association rules mining algorithms. Examples illustrating the proposed algorithms are given. The efficiency of the proposed approach is further compared with Dasseni etc. (2001) approach. It is shown that our approach required less number of databases scanning and prune more number of hidden rules. However, our approach must hide all rules containing the hidden items on the right hand side, where Dasseni's approach can hide specific rules.

Published in:

Systems, Man and Cybernetics, 2004 IEEE International Conference on  (Volume:4 )

Date of Conference:

10-13 Oct. 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.