loading...
Privacy-Preserving Two-Party K-Means Clustering via Secure Approximation
Niagara Falls, Ontario, Canada May 21-May 23
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINAW.2007.29521st International Conference on Adva ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Chunhua Su, Kyushu University, Japan
Feng Bao, Institute for Infocomm Research, Singapore
Jianying Zhou, Institute for Infocomm Research, Singapore
Tsuyoshi Takagi, Future University-Hakodate, Japan
Kouichi Sakurai, Kyushu University, Japan
K-means clustering is a powerful and frequently used technique in data mining. However, privacy breaching is a serious problem if the k-means clustering is used without any security treatment, while privacy is a real concern in many practical applications. Recently, four privacy-preserving solutions based on cryptography have been proposed by different researchers. Unfortunately none of these four schemes can achieve both security and completeness with good efficiency. In this paper, we present a new scheme to overcome the problems occurred previously. Our scheme deals with data standardization in order to make the result more reasonable. We show that our scheme is secure and complete with good efficiency.
Index Terms:
clustering, privacy-preserving, secure approximation
Citation:
Chunhua Su, Feng Bao, Jianying Zhou, Tsuyoshi Takagi, Kouichi Sakurai, "Privacy-Preserving Two-Party K-Means Clustering via Secure Approximation," ainaw, vol. 1, pp.385-391, 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions