IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v17y2021i2p1550147721993402.html
   My bibliography  Save this article

A trajectory data publishing algorithm satisfying local suppression

Author

Listed:
  • Xiaohui Li
  • Yuliang Bai
  • Yajun Wang
  • Bo Li

Abstract

Suppressing the trajectory data to be released can effectively reduce the risk of user privacy leakage. However, the global suppression of the data set to meet the traditional privacy model method reduces the availability of trajectory data. Therefore, we propose a trajectory data differential privacy protection algorithm based on local suppression Trajectory privacy protection based on local suppression (TPLS) to provide the user with the ability and flexibility of protecting data through local suppression. The main contributions of this article include as follows: (1) introducing privacy protection method in trajectory data release, (2) performing effective local suppression judgment on the points in the minimum violation sequence of the trajectory data set, and (3) proposing a differential privacy protection algorithm based on local suppression. In the algorithm, we achieve the purpose Maximal frequent sequence (MFS) sequence loss rate in the trajectory data set by effective local inhibition judgment and updating the minimum violation sequence set, and then establish a classification tree and add noise to the leaf nodes to improve the security of the data to be published. Simulation results show that the proposed algorithm is effective, which can reduce the data loss rate and improve data availability while reducing the risk of user privacy leakage.

Suggested Citation

  • Xiaohui Li & Yuliang Bai & Yajun Wang & Bo Li, 2021. "A trajectory data publishing algorithm satisfying local suppression," International Journal of Distributed Sensor Networks, , vol. 17(2), pages 15501477219, February.
  • Handle: RePEc:sae:intdis:v:17:y:2021:i:2:p:1550147721993402
    DOI: 10.1177/1550147721993402
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147721993402
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147721993402?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:17:y:2021:i:2:p:1550147721993402. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.