Privacy preserving association rule mining in vertically partitioned data

  • Authors:
  • Jaideep Vaidya;Chris Clifton

  • Affiliations:
  • Purdue University, West Lafayette, Indiana;Purdue University, West Lafayette, Indiana

  • Venue:
  • Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

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 discovering frequent itemsets with minimum support levels, without either site revealing individual transaction values.