Privacy Preserving Association Rule Mining in Vertically Partitioned Databases

Abstract

Privacy considerations often constrain data mining projects. This paper addresses the problem of association rule mining where transactions are distributed across sources. Each site holds some attributes of each transaction, and the sites wish to collaborate to identify globally valid association rules. However, the sites must not reveal individual transaction data. We present a two-party algorithm for efficiently dis-covering frequent itemsets with minimum support levels, without either site revealing individual transaction values.