An efficient algorithm for incremental privacy breach on (k, e)-anonymous model
Collaboration between business partners have become crucial these days. An important issue to be addressed is data privacy. In this paper, we address a problem of data privacy based on a prominent privacy model, (k, e)-Anonymous, when a new dataset is to be released, meanwhile there might be existin...
Saved in:
Main Authors: | Bowonsak Srisungsittisunti, Juggapong Natwichai |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84893299608&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/52452 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
An efficient algorithm for incremental privacy breach on (k, e)-anonymous model
by: Bowonsak Srisungsittisunti, et al.
Published: (2018) -
An incremental privacy-preservation algorithm for the (k, e)-Anonymous model
by: Srisungsittisunti,B., et al.
Published: (2015) -
Achieving k-anonymity for associative classification in incremental-data scenarios
by: Bowonsak Seisungsittisunti, et al.
Published: (2018) -
Incremental privacy preservation for associative classification
by: Bowonsak Seisungsittisunti, et al.
Published: (2018) -
Incremental privacy preservation for associative classification
by: Bowonsak Seisungsittisunti, et al.
Published: (2018)