10.46243/jst.2023.v8.i12.pp23-30 registered

sensitive data is location trajectories. Spatiotemporal dataset is used in this framework, which include GPS trajectories for mobile users. The database includes k- anonymity for grouping the similar trajectories. The privacy metric for the publication of Spatiotemporal datasets is k- anonymity. The proposed algorithm is based on signature generation method, which is used to generate a key for the users in a digital manner. In signature generation method we use ECC algorithm for digital signature. We improved clustering approach and propose the 1,2,3B. Tech Student, Department of CSE (Cyber Security), Malla Reddy College of Engineering and Technology, Hyderabad, India. 4Assistant Professor, Department Of CSE (Data Science), Malla Reddy College Of Engineering and Technology, Hyderabad, India. DOI:https://doi.org/10.46243/jst.2023.v8.i12.pp23-30 15 D Nikhil Teja, Patan Abdulsalam Khan, A Sunny, R Shashi Rekha: PRIVACY PRESERVING LOCATION DATA PUBLISHING: A MACHINE LEARNING APPROACH k-means clustering. By using k-anonymity the similar trajectories were grouped and removed the dissimilar ones. Splitting techniques are used to protect the data privacy. In this paper, the proposed method is used to enhance the MLA framework to preserve the users privacy publication of Spatiotemporal datasets. The MLA framework has three algorithms: preprocessing, clustering, signature is used for the purpose of efficiency and security. The process of anonymization is to cluster. The ECC algorithm generate a private key and public key for the public users to see the personal details of a particular person. MLA algorithms are applied on real-world GPS datasets following different times and domains. Here the information loss is inversely proportional to the security level. Privacy preserving technique utilizes high quality datasets. Methods used in this paper are distribution of data, preprocessing the datasets, data mining algorithms, data hiding, signature generation, privacy preservation. The final results show the utility of the dataset and anonymization on MLA framework. LITERATURE SURVEY Data Privacy Through Optical K- Anonymization It proposes a practical method for determining an optimal anonymization of a given dataset. The optimal anonymization perturbs the input data as little as is necessary to achieve anonymity. Several different cost metrics have been proposed, through most aim in one way or another to minimize the amount of information loss results the generalization and suppression operations that are applied to produce the transformed dataset. The ability to compute optimal anonymizations let us more definitively investigate impacts of various coding techniques and problem variation on anonymization quality. It also allows to use better quantify the effectiveness of other nonoptimal methods. Winkler has proposed using simulated annealing to attack the problem but provides no evidence of its efficacy. The more theoretical side, Meyerson and Williams have recently proposed an approximation algorithm of optimal anonymization. Mondrian Multidimensional K- Anonymity Attacks can be reduced by using k- anonymity. The objective of k-anonymization technique is to protect the privacy of the every individual. The subject to this constrains, it is important that the released the data remain as “useful” as possible. This paper is a new multidimensional recoding model and a greedy algorithm for k-anonymization, an approach with several important advantages: the greedy algorithm has more efficient that proposed optimal kanonymization algorithms for single dimensional models. The greedy algorithm has the time complexity of O(nlogn), were the optimal algorithms are in worst cases. Higher quality results were produced while using greedy multidimensional algorithm than by using optimal single dimensional algorithm. Machanavajjhala Measured Anonymity by the l-diversity This paper proposed that uncertainty of linking QID with some particular sensitive values. Wang proposed to bond the confidence of inferring a particular sensitive value using one or more privacy templets specified the data provider. Wong proposed some generalization methods to simultaneously achieve k-anonymity and bond confidence. Xiao and Tao limited the breach probability, which is similar to the motion the confidence, and allowed a flexible threshold for each individual. K-anonymization for data owned by multiple parties for considered. T-closeness Privacy beyond K-anonymity and I-diversity While k-anonymity protect against the identity disclosure, it won‟t provide sufficient protection against attribute disclosure. The notion of I-diversity attempts to solve this problem by requiringthe equivalence class that has at least 1 well represented values for each sensitive attribute. We use the earth mover distance measure for ourcloseness requirement; thishas advantage of taking into