{"title":"分类数据语义适应k -匿名化(SAKA)技术","authors":"K. Prasad, A. Pravin, T. Jacob, R. Rajakumar","doi":"10.1109/ICPC2T53885.2022.9776664","DOIUrl":null,"url":null,"abstract":"Techniques approaching k-anonymity for shielding the mini data privacy over data mining. Mini gatherings and abstraction are two conventional techniques for deploying the k-anonymity method. However, the above two methodologies lead to major errors over the anonymity of combined small data gathering. To approach this problem, we propose an efficient and new anonymity method SAKA that accommodates extra semantics than abstraction and mini data gatherings that can handle combined small data combinations. SAKA is the abbreviation for Semantics Accommodated K-Anonymity technique implied for anonymization of assorted data. The concept of SAKA is to merge the mean assorted vector of arithmetic data with abstraction values of classified data as a grouping centroid. It uses its epitome of tuples along with its equivalent clusters. Here we propose efficient algorithms to anonymize assorted data. An empirical result proves that SAKA can anonymize the assorted mini data persuasively and the algorithm implemented will provide good rapport between the quality of data and effectiveness of the algorithm thus it correlates anonymization algorithms with anonymous data.","PeriodicalId":283298,"journal":{"name":"2022 Second International Conference on Power, Control and Computing Technologies (ICPC2T)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Semantics Accommodated K-Anonymization (SAKA) Technique for Assorted Data\",\"authors\":\"K. Prasad, A. Pravin, T. Jacob, R. Rajakumar\",\"doi\":\"10.1109/ICPC2T53885.2022.9776664\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Techniques approaching k-anonymity for shielding the mini data privacy over data mining. Mini gatherings and abstraction are two conventional techniques for deploying the k-anonymity method. However, the above two methodologies lead to major errors over the anonymity of combined small data gathering. To approach this problem, we propose an efficient and new anonymity method SAKA that accommodates extra semantics than abstraction and mini data gatherings that can handle combined small data combinations. SAKA is the abbreviation for Semantics Accommodated K-Anonymity technique implied for anonymization of assorted data. The concept of SAKA is to merge the mean assorted vector of arithmetic data with abstraction values of classified data as a grouping centroid. It uses its epitome of tuples along with its equivalent clusters. Here we propose efficient algorithms to anonymize assorted data. An empirical result proves that SAKA can anonymize the assorted mini data persuasively and the algorithm implemented will provide good rapport between the quality of data and effectiveness of the algorithm thus it correlates anonymization algorithms with anonymous data.\",\"PeriodicalId\":283298,\"journal\":{\"name\":\"2022 Second International Conference on Power, Control and Computing Technologies (ICPC2T)\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 Second International Conference on Power, Control and Computing Technologies (ICPC2T)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPC2T53885.2022.9776664\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Second International Conference on Power, Control and Computing Technologies (ICPC2T)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPC2T53885.2022.9776664","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Semantics Accommodated K-Anonymization (SAKA) Technique for Assorted Data
Techniques approaching k-anonymity for shielding the mini data privacy over data mining. Mini gatherings and abstraction are two conventional techniques for deploying the k-anonymity method. However, the above two methodologies lead to major errors over the anonymity of combined small data gathering. To approach this problem, we propose an efficient and new anonymity method SAKA that accommodates extra semantics than abstraction and mini data gatherings that can handle combined small data combinations. SAKA is the abbreviation for Semantics Accommodated K-Anonymity technique implied for anonymization of assorted data. The concept of SAKA is to merge the mean assorted vector of arithmetic data with abstraction values of classified data as a grouping centroid. It uses its epitome of tuples along with its equivalent clusters. Here we propose efficient algorithms to anonymize assorted data. An empirical result proves that SAKA can anonymize the assorted mini data persuasively and the algorithm implemented will provide good rapport between the quality of data and effectiveness of the algorithm thus it correlates anonymization algorithms with anonymous data.