A Study of Some Privacy-Preserving Clustering Schemes
Date Issued
2008
Date
2008
Author(s)
Hsieh, Ping-Yen
Abstract
Clustering is one of the most useful techniques to do some data analysis. But the conventional way to perform clustering usually offends one’s privacy. In the era of digital information, privacy is a very important concern in our daily life. To preserve one’s privacy, we exploit several privacy-preserving clustering schemes in this thesis. In the beginning, introduction to clustering, distributed clustering, and privacy-preserving clustering schemes will be given in order. And then, two major schemes, privacy-preserving k-means clustering and privacy-preserving hierarchical clustering, are illustrated in details. We implement these algorithms and perform experiments with both simulated ones and realistic data sets to learn the characteristics of each privacy-preserving clustering algorithm and evaluate the feasibility and usefulness of privacy-preserving clustering schemes.
Subjects
Clustering
Distributed Clustering
Privacy-Preserving Clustering
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-97-R95944004-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):1a4d1d4f5b535f8a297beef40a9b5830