(k, e)-anonymous for ordinal data
© 2015 IEEE. Currently, the data can be gathered, analyzed, and utilized easier than ever with the aiding of Big Data technologies such as mobile devices, elastic computing platform, or convenient software tools. Thus, privacy of such data could become a bigger issue as well. In this paper, we propo...
Saved in:
Main Authors: | Surapon Riyana, Nattapon Harnsamut, Torsak Soontornphand, Juggapong Natwichai |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84964928536&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/43985 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
(k, e)-anonymous for ordinal data
by: Surapon Riyana, et al.
Published: (2018) -
Privacy preservation for trajectory data publishing by look-up table generalization
by: Nattapon Harnsamut, et al.
Published: (2018) -
Privacy preservation based on full-domain generalization for incremental data publishing
by: Torsak Soontornphand, et al.
Published: (2018) -
Privacy preservation for re-publication data by using probabilistic graph
by: Pachara Tinamas, et al.
Published: (2020) -
An efficient algorithm for incremental privacy breach on (k, e)-anonymous model
by: Bowonsak Srisungsittisunti, et al.
Published: (2018)