By Topic

Protection of Sensitive Data based on Reducts in a Distributed Knowledge Discovery System

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

2 Author(s)
Seunghyun Im ; Univ. of Pittsburgh at Johnstown, Johnstown ; Ras, Z.

This paper discusses data confidentiality in a distributed knowledge discovery system (DKDS) . In particular, we provide a method that protects values of confidential attributes from being reveled by chase algorithm (Ras and Dardzinska, 2005) using reducts (Skowron and Rauszer, 1992). The method presented in this paper is intended for use in DKDS that the set of rules used by chase algorithm is not completely known in advance. Reduct is used to determine the optimal set of data to be additionally hidden.

Published in:

Multimedia and Ubiquitous Engineering, 2007. MUE '07. International Conference on

Date of Conference:

26-28 April 2007