請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37787
標題: | 以隱私保護為目的之群聚方式研究 A Study of Some Privacy-Preserving Clustering Schemes |
作者: | Ping-Yen Hsieh 謝秉諺 |
指導教授: | 吳家麟 |
關鍵字: | 群聚,分散式群聚,隱私保護群聚, Clustering,Distributed Clustering,Privacy-Preserving Clustering, |
出版年 : | 2008 |
學位: | 碩士 |
摘要: | 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. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37787 |
全文授權: | 有償授權 |
顯示於系所單位: | 資訊網路與多媒體研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-97-1.pdf 目前未授權公開取用 | 965.55 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。