Research Article
Highly Secure Privacy-Preserving Outsourced k-Means Clustering under Multiple Keys in Cloud Computing
| Input: : m-dimensional data records, where ; | | k: predefined number of clusters; | | I: predefined max number of iterations; | | Begin: Pick k cluster centers , , | | for to I do | | if {different k clusters compared with the case } | | (1) Distribute each data record to the cluster with the minimum among for | | (2) Update the cluster center to the average values of data records in for | | end if | | end for | | Output: k clusters |
|