Private-preserving association rules mining
Shen Xu-chang · Jisuanji gongcheng yu sheji · 2005
Privacy preserving in datamining is a significant direction. M. Kantarcioglu hasproposed a method for horizontally partitioned data . A scenario in which two parties owning confidential databases wish to run an algorithm on the union of their database is addressed [2] without revealing any unnecessary information. A two-party algorithm for efficiently discovering frequent item setswith minimum support level is presented without either site reveal individual transaction values.