Cart (Loading....) | Create Account
Close category search window
 

An Algorithm for Privacy-Preserving Quantitative Association Rules 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

5 Author(s)
Weiwei Jing ; MOST Co-Key Lab. of High Performance Comput. & Its Application, Univ. of Sci. & Technol. of China, Hefei ; Liusheng Huang ; Yonglong Luo ; Weijiang Xu
more authors

When data mining occurs on distributed data, privacy of parties becomes great concerns. This paper considers the problem of mining quantitative association rules without revealing the private information of parties who compute jointly and share distributed data. The issue is an area of privacy preserving data mining (PPDM) research. Some researchers have considered the case of mining Boolean association rules; however, this method cannot be easily applied to quantitative rules mining. A new secure set union algorithm is proposed in this paper, which unifies the input sets of parties without revealing any element's owner and has lower time cost than existing algorithms. The new algorithm takes the advantages of both in privacy-preserving Boolean association rules mining and in privacy-preserving quantitative association mining. This paper also presents an algorithm for privacy-preserving quantitative association rules mining over horizontally portioned data, based on CF tree and secure sum algorithm. Besides, the analysis of the correctness, the security and the complexity of our algorithms are provided

Published in:

Dependable, Autonomic and Secure Computing, 2nd IEEE International Symposium on

Date of Conference:

Sept. 29 2006-Oct. 1 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.