- 期刊
Clustering Based K-anonymity Algorithm for Privacy Preservation
摘要
K-anonymity is an effective model for protecting privacy while publishing data, which can be implemented by different ways. Among them, local generalization are popular because of its low information loss. But such algorithms are generally computation expensive making it difficult to perform well in the case of large amount of data. In order to solve this problem, this paper proposes a clustering based K-anonymity algorithm and optimizes it with parallelization. The experimental result shows that the algorithm performs better in information loss and performance compared with the existing KACA and Incognito algorithms.
延伸閱讀
- Li, Z., & Ma, H. (2019). A Research on K-Means Clustering Algorithm Based on Big Data Platform. IETI Transactions on Social Sciences and Humanities, 4(), 124-143. https://doi.org/10.6896/IETITSSH.201909_4.0012
- 黃宇翔、王品鈞、方志強（2017）。A k-means Based Clustering Algorithm for Mixed-Attribute Data Sets。電子商務學報，19(1)，1-28。https://doi.org/10.6188/JEB.2017.19(1).01
- Hsieh, P. Y. (2008). A Study of Some Privacy-Preserving Clustering Schemes [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2008.00149
- Chao, C. M., Chen, P. Z., & Sun, C. H. (2010). Privacy-Preserving Clustering of Data Streams. 淡江理工學刊, 13(3), 349-358. https://doi.org/10.6180/jase.2010.13.3.14
- Bhaladhare, P. R., & Jinwala, D. C. (2016). Novel Approaches for Privacy Preserving Data Mining in k-Anonymity Model. Journal of Information Science and Engineering, 32(1), 63-78. https://doi.org/10.6688/JISE.2016.32.1.4