Privacy preserving distributed knowledge discovery: survey and future directions Online publication date: Sun, 27-Jan-2013
by Alaa Khalil Juma'a; Sufyan T. Faraj Al-Janabi; Nizar Abedlqader Ali
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 4, No. 4, 2012
Abstract: The aim of privacy preserving data mining algorithms is to extract relevant knowledge from large amounts of data while protecting at the same time sensitive information. In the first part of this paper, we discuss privacy preserving distributed data mining techniques and provide a survey on the state-of-the-art methods in this field. We have considered randomisation, k-anonymisation, and cryptographic techniques. In the second part of the paper, we have described our proposed system for privacy preserving knowledge discovery over distributed databases which is still under development phase. The system is designed to perform local operations (local mining) in each site. This produces intermediate data that can be used to obtain the final result without revealing the private information of any site. Our proposal is mainly based on association rule mining and cryptographic techniques.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook