Abstract

LBS services generate massive amounts of trajectory data over time, which will be shared with others for further intelligent services. Due to the ubiquity and openness of LBS, the user’s trajectory may be collected and interfered by attackers. Existing solutions cannot take into account the privacy and availability of trajectory data at the same time. In order to achieve the balance between privacy and availability, the Hasse Diagram Sensitivity Differential Privacy with Reinforcement Learning (HDS-DPRL) is designed in this paper. The first module uses the ameliorated K-means clustering to reduce redundant position coordinate points. The second one includes an algorithm for calculating sensitive positions based on Hasse Diagram, which is used to store trajectories and construct a partial order relationship based on the access frequency of position point visits to calculate sensitive locations. The third module employs Reinforcement Learning to compute the optimal Laplace boundary and adds bounded Laplace noise to the Hasse Diagram that stores sensitive locations implement differential privacy. Extensive experiments on synthetic datasets and real-world datasets demonstrate the superior performance of our HDS-DPRL compared to the existing solutions while providing availability and privacy. Thus, HDS-DPRL can be applied to privacy-enhanced applications of trajectories.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call