By Topic

Privacy-preserving DBSCAN on horizontally partitioned data

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)
Dongjie Jiang ; Sch. of Comput. Sci. & Telecommun. Eng., Jiangsu Univ., Zhenjiang ; Anrong Xue ; Shiguang Ju ; Weihe Chen
more authors

Privacy preserving data mining of distributed data is an important direction for data mining, and privacy preserving clustering is one of the main researches. At present, most privacy preserving clustering algorithms are concentrated on k-means and based on two parties and a trusted third party, clustering results are uncertain and hard to find complex shape clusters, and the protocols are inefficient because of using encryption, so we propose a algorithm called HPPDBSCAN based on semi-honest models for horizontally partitioned databases using some secure protocols such as secure sum computation, scalar product computation, standardization, and comparison by means of a semi-honest third party. The algorithm resolves the problem of privacy preserving under semi-honest circumstance for multi-party. Theoretic argument and example analysis demonstrate that the scheme is secure and complete with good efficiency.

Published in:

IT in Medicine and Education, 2008. ITME 2008. IEEE International Symposium on

Date of Conference:

12-14 Dec. 2008