An Effective Distributed Privacy-Preserving Data Mining Algorithm

Data mining is useful means for discovering valuable patterns, associations, trends, and dependencies in data. Data mining is often required to be performed among a group of sites, where the precondition is that no privacy of any site should be leaked out to other sites. In this paper a distributed privacy-preserving data mining algorithm is proposed. The proposed algorithm is characterized with (1) its ability to preserve the privacy without any coordinator site, and specially its ability to resist the collusion; and (2) its lightweight since only the random number is used for preserving the privacy. Performance analysis and experimental results are provided for demonstrating the effectiveness of the proposed algorithm.