By Topic

Privacy Parallel Algorithm for Mining Association Rules and its Application in HRM

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

3 Author(s)
Xueping Zhang ; Coll. of Inf. Sci. & Eng., Henan Univ. of Technol., Zhengzhou, China ; Yanxia Zhu ; Nan Hua

Parallel association rules mining has been improved the efficiency of data mining, and meanwhile concerned with the privacy preserving problem. A simple and effective method of parallel association rules mining which based on privacy protection----parallel association rules mining algorithm with privacy preserving (PARMA-P) has been introduced in this paper. It could achieve effective concealment of frequent item-set and then the association rules by the means of using imported hash assignment strategy in frequent item sets of FP sub tree could be protected. It has been used in HRM of an enterprise and experiments show that the algorithm can be simple and effective in protection of data privacy.

Published in:

Computational Intelligence and Design, 2009. ISCID '09. Second International Symposium on  (Volume:2 )

Date of Conference:

12-14 Dec. 2009