Author:
Tang Zhenying,Zhao Wei,Wang Chenfei,Yang Zixing,Xu Yin,Cui Shenhao
Abstract
Abstract
In view of the data security problems faced by big data technology in the development of electric power industry, this paper proposes a power big data desensitization algorithm applied to privacy protection, that is, a binary K-clustering algorithm (BKC-LDA) based on K-anonymity and L diversity. First, in order to reduce the computational complexity, a classification attribute is determined to classify the data table initially, and the equivalent class number K and the sensitive attribute value category L are limited according to the number of the original ancestor in the source data table. Then, considering the influence of the change of the internal range of the attribute value on the clustering, the equation for calculating the distance between the original ancestors with weight is established, using the idea of greedy and binary K clustering to classify the data table initially sets are clustered and generalized. In addition, this big data desensitization method determines the security level policies of different permissions by adjusting the size of K and L. Our algorithm can adapt to the desensitization of power big data with different attributes in different scenarios. It can not only fully mine the value of data, but also effectively protect the privacy of users.
Reference9 articles.
1. k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY[J];Sweeney;International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems,2002
2. l-Diversity: Privacy Beyond k-Anonymity[C];Machanavajjhala,2006
3. Achieving anonymity via clustering;Aggarwal,2006
4. Greedy clustering anonymous method for privacy protection of table data publishing [J];huowen;Journal of software,2017
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Ghostwriting-Federal Learning Key Technology Research for Big Data Privacy Protection;2022 4th International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI);2022-10