Efficient Apriori based algorithms for privacy preserving frequent itemset mining

Csiszárik, Adrián and Lestyán, Szilvia and Lukács, András (2014) Efficient Apriori based algorithms for privacy preserving frequent itemset mining. In: 2014 5th IEEE Conference on Cognitive Infocommunications (CogInfoCom). Institute of Electrical and Electronics Engineers (IEEE), Piscataway (NJ), pp. 431-435. ISBN 9781479972791; 9781479972814; 1479972819; 1479972800; 9781479972807

Text IEEE-EfficientAprioriBasedAlgorithmsfor.pdf Restricted to Registered users only Download (416kB) | Request a copy

Abstract

Frequent Itemset Mining as one of the principal routine of data analysis and a basic tool of large scale information aggregation also bears a serous interest in Privacy Preserving Data Mining. In this paper Apriori based distributed, privacy preserving Frequent Itemset Mining algorithms are considered. Our secure algorithms are designed to fit in the Secure Multiparty Computation model of privacy preserving computation.

Actions (login required)

View Item