loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07)
Protection of Sensitive Data based on Reducts in a Distributed Knowledge Discovery System
Seoul, Korea
April 26-April 28
ISBN: 0-7695-2777-9
Seunghyun Im, University of Pittsburgh at Johnstown
Zbigniew Ras, University of North Carolina at Charlotte
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 [8] using reducts [13]. 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.
Citation:
Seunghyun Im, Zbigniew Ras, "Protection of Sensitive Data based on Reducts in a Distributed Knowledge Discovery System," mue, pp.762-766, 2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.