Education, Science, Technology, Innovation and Life
Open Access
Sign In
  1. Home
  2. Journals
  3. Automation and Machine Learning
  4. Vol 3, Issue 2, 2022

Research on fast clustering privacy protection of mixed data based on blockchain

Download as PDF

DOI: 10.23977/autml.2022.030206 | Downloads: 7 | Views: 506

Author(s)

Zhuohong Zhang 1, Guihua Huang 1

Affiliation(s)

1 Guangdong University of Science and Technology, Guangzhou, 510000, China

Corresponding Author

Zhuohong Zhang

ABSTRACT

In the actual production environment, a large number of data sets to be protected are non-single type attribute data sets, that is, mixed data sets.In view of the above problems, this project proposes a fast clustering privacy protection research method based on blockchain mixed data. This method is mainly for complex data types, cloud environment for different data types with different measurement method, the difference of the hybrid data set by calculation of each sample point neighborhood density and relative distance, divided into k density and relative distance far sample points as the initial clustering center, clustering, complete and upload them to block chain. For the generated clustering results, the numerical clustering centers are calculated, and the set of attribute values of non-numerical data is generated, which ensures that each user can correctly obtain the iterative process and the final clustering centers, and reduces the error rate of data.

KEYWORDS

Cloud environment; Mixed data; Fast clustering; Block chain

CITE THIS PAPER

Zhuohong Zhang, Guihua Huang, Research on fast clustering privacy protection of mixed data based on blockchain. Automation and Machine Learning (2022) Vol. 3: 34-38. DOI: http://dx.doi.org/10.23977/autml.2022.030206.

REFERENCES

[1] YAN F, ZHANG X, LI C, et al. Differentially private histogram publishing through fractal dimension for dynamic datasets[C]//IEEEConference on Industrial Electronics and Applications (ICIEA), 2018: 1542-1546.
[2] FLETCHER S, ISLAM M Z. Differentially private random decision forests using smooth sensitivity [J]. Expert Systems with Applications, 2017, 78(7): 16-31. 
[3] LIU X Q, LI Q M. Differentially private datarelease based on clustering anonymization [J]. Journal on Communications, 2016, 37(5): 125-129.
[4] SORIA C J, DOMINGO F J, SANCHEZ D, et al. Improving the utility of differentially private data releases via k-anonymity[C]//Melbourne: 12th IEEE International Conference on Trust, Security andPrivacy in Computing and Communications(TrustCom), 2013.
[5] LI N H, QARDAJI W, SU D. Provably private data anonymization:or, k-anonymity meets differential privacy[DB/OL]. https: //arxiv.org/abs/1101.2604v1, 2011.
[6] DAN F, XIANG C Y, ZHU R H, et al. Coresets for differentially private k-means clustering and applications to privacy in mobile sensor networks [C]// Proceedings of the 2017 ACM/IEEE International Conference on Information Processing in Sensor Networks. New York: ACM, 2017: 3-15. 
[7] NI T J, QIAO M H, CHEN Z L, et al. Utility-efficient differentially private K-means clustering based on cluster merging[J]. Neurocomputing, 2021, 424: 205-214.
[8] XIONG P, ZHU T Q, WANG X F, et al. A survey on differential privacy and applications[J]. Chinese Journal of Computers, 2014, 37(1): 101-122.
[9] NISSIM K, RASKHODNIKOVA S, SMITH A. Smooth sensitivity and sampling in private data analysis[C]// Proceedings of the 39th annual ACM Symposium on Theory of Computing, 2007: 75-84. 
[10] NAYAHI V, KAVITHA V. Privacy and utility preserving data clustering for data anonymization and distribution on Hadoop[J]. Future Generation Computer Systems, 2016, 74(9): 393-408. 

Subscription
E-Mail Alert
Most popular papers
Call for Special Issue
Publication Ethics & OA Statement
Plagiarism Policy
Contact Us
Downloads: 1593
Visits: 67165

Sponsors, Associates, and Links

All published work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright © 2016 - 2031 Clausius Scientific Press Inc. All Rights Reserved.