Anonymizing set-valued social data

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

The increasing popularity of social networks has generated tremendous amount of data to be exploited for commercial, research and many other valuable applications. However, the release of these data has raised an issue that personal privacy may be breached. Current practices of simply removing all identifiable personal information (such as names and social security numbers) before releasing the data is insufficient. More effective anonymization techniques are required. In this work, we propose a k-anonymization-based technique on set-valued network node data. The proposed algorithm is based on the principle of minimizing the number of addition and deletion operations to achieve k-anonymity. Numerical experiments on real dataset show that it requires less number of operations than current suppression-based approach.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010
Pages809-812
Number of pages4
DOIs
Publication statusPublished - 2010 Dec 1
Event2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010 - Hangzhou, China
Duration: 2010 Dec 182010 Dec 20

Publication series

NameProceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010

Other

Other2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010
CountryChina
CityHangzhou
Period10-12-1810-12-20

Fingerprint

Experiments
K-anonymity
Social Networks
Deletion
Privacy
Numerical Experiment
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Wang, S. L., Tsai, Y. C., Kao, H-Y., & Hong, T. P. (2010). Anonymizing set-valued social data. In Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010 (pp. 809-812). [5724922] (Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010). https://doi.org/10.1109/GreenCom-CPSCom.2010.33
Wang, Shyue Liang ; Tsai, Yu Chuan ; Kao, Hung-Yu ; Hong, Tzung Pei. / Anonymizing set-valued social data. Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010. 2010. pp. 809-812 (Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010).
@inproceedings{39b6ab394d1f4fb8bfecb1e64ff5a23c,
title = "Anonymizing set-valued social data",
abstract = "The increasing popularity of social networks has generated tremendous amount of data to be exploited for commercial, research and many other valuable applications. However, the release of these data has raised an issue that personal privacy may be breached. Current practices of simply removing all identifiable personal information (such as names and social security numbers) before releasing the data is insufficient. More effective anonymization techniques are required. In this work, we propose a k-anonymization-based technique on set-valued network node data. The proposed algorithm is based on the principle of minimizing the number of addition and deletion operations to achieve k-anonymity. Numerical experiments on real dataset show that it requires less number of operations than current suppression-based approach.",
author = "Wang, {Shyue Liang} and Tsai, {Yu Chuan} and Hung-Yu Kao and Hong, {Tzung Pei}",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/GreenCom-CPSCom.2010.33",
language = "English",
isbn = "9780769543314",
series = "Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010",
pages = "809--812",
booktitle = "Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010",

}

Wang, SL, Tsai, YC, Kao, H-Y & Hong, TP 2010, Anonymizing set-valued social data. in Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010., 5724922, Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010, pp. 809-812, 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010, Hangzhou, China, 10-12-18. https://doi.org/10.1109/GreenCom-CPSCom.2010.33

Anonymizing set-valued social data. / Wang, Shyue Liang; Tsai, Yu Chuan; Kao, Hung-Yu; Hong, Tzung Pei.

Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010. 2010. p. 809-812 5724922 (Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Anonymizing set-valued social data

AU - Wang, Shyue Liang

AU - Tsai, Yu Chuan

AU - Kao, Hung-Yu

AU - Hong, Tzung Pei

PY - 2010/12/1

Y1 - 2010/12/1

N2 - The increasing popularity of social networks has generated tremendous amount of data to be exploited for commercial, research and many other valuable applications. However, the release of these data has raised an issue that personal privacy may be breached. Current practices of simply removing all identifiable personal information (such as names and social security numbers) before releasing the data is insufficient. More effective anonymization techniques are required. In this work, we propose a k-anonymization-based technique on set-valued network node data. The proposed algorithm is based on the principle of minimizing the number of addition and deletion operations to achieve k-anonymity. Numerical experiments on real dataset show that it requires less number of operations than current suppression-based approach.

AB - The increasing popularity of social networks has generated tremendous amount of data to be exploited for commercial, research and many other valuable applications. However, the release of these data has raised an issue that personal privacy may be breached. Current practices of simply removing all identifiable personal information (such as names and social security numbers) before releasing the data is insufficient. More effective anonymization techniques are required. In this work, we propose a k-anonymization-based technique on set-valued network node data. The proposed algorithm is based on the principle of minimizing the number of addition and deletion operations to achieve k-anonymity. Numerical experiments on real dataset show that it requires less number of operations than current suppression-based approach.

UR - http://www.scopus.com/inward/record.url?scp=79953087401&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79953087401&partnerID=8YFLogxK

U2 - 10.1109/GreenCom-CPSCom.2010.33

DO - 10.1109/GreenCom-CPSCom.2010.33

M3 - Conference contribution

SN - 9780769543314

T3 - Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010

SP - 809

EP - 812

BT - Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010

ER -

Wang SL, Tsai YC, Kao H-Y, Hong TP. Anonymizing set-valued social data. In Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010. 2010. p. 809-812. 5724922. (Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010). https://doi.org/10.1109/GreenCom-CPSCom.2010.33