By Topic

An Efficient Algorithm for Privacy Preserving Maximal Frequent Itemsets Mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Miao Yuqing ; Comput. Sci. & Eng. Coll., Guilin Univ. of Electron. Technol., Guilin, China ; Zhang Xiaohua ; Wu Kongling ; Su Jie

This paper addressed the insecurity and the inefficiency of privacy preserving association rule mining in vertically partitioned data. We presented a privacy preserving maximal frequent itemsets mining algorithm in vertically partitioned data. The algorithm adopted a more secure vector dot protocol which used an inverse matrix to hide the original input vector, and without any site revealing privacy vector. The mining strategy was based on depth-first search for the maximal frequent itemsets. Performance analysis and experimental analysis showed that the algorithm possessed higher security and efficiency.

Published in:

Parallel Architectures, Algorithms and Programming (PAAP), 2011 Fourth International Symposium on

Date of Conference:

9-11 Dec. 2011