Confining edge types in K-anonymization of shortest paths

Yu Chuan Tsai, Shyue Liang Wang, Hung-Yu Kao, Tzung Pei Hong

Research output: Contribution to conferencePaperpeer-review

1 Citation (Scopus)

Abstract

In recent years, the problem of privacy preservation on published social networks has become more and more important. The social media data are available on the popular on-line social network websites with rich personal information, which can be analyzed for connectivity and user behaviors. In this work, we study the problem of preserving sensitive paths in social networks. We examine the new concept called k-anonymous path privacy and propose two algorithms, based on the greedy approach with two different types of edges, namely Partially-Visited (PV) edges and None-Visited (NV) edges, which minimally perturbed the edge weights to achieve the path anonymity under different requirements. The numerical experiments showing the characteristics of the proposed algorithms are given. The results demonstrate that the proposed algorithms are feasible to achieve the k-anonymous path privacy, with different performances on directed and un-directed weighted graphs, and could be applied to different privacy requirements.

Original languageEnglish
Pages318-322
Number of pages5
DOIs
Publication statusPublished - 2012 Dec 12
Event3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012 - Kaohsiung City, Taiwan
Duration: 2012 Sep 262012 Sep 28

Other

Other3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012
CountryTaiwan
CityKaohsiung City
Period12-09-2612-09-28

All Science Journal Classification (ASJC) codes

  • Bioengineering
  • Software

Fingerprint Dive into the research topics of 'Confining edge types in K-anonymization of shortest paths'. Together they form a unique fingerprint.

Cite this