Skip to Main Content
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.