POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice.

Rinku Dewri|Indrajit Ray|Indrakshi Ray|L. Darrell Whitley


Anthology ID:DBLP:conf/cikm/DewriRRW09
Volume:Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009
Year:2009
Venue:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:1037-1046
URL:https://doi.org/10.1145/1645953.1646085
DOI:https://doi.org/10.1145/1645953.1646085
DBLP:conf/cikm/DewriRRW09
BibTeX:
@inproceedings{dewri-2009-poka, author = {Rinku Dewri and Indrajit Ray and Indrakshi Ray and L. Darrell Whitley}, editor = {David Wai-Lok Cheung and Il-Yeol Song and Wesley W. Chu and Xiaohua Hu and Jimmy Lin}, title = {{POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice}}, booktitle = {{Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009}}, pages = {1037--1046}, publisher = {ACM}, year = {2009}, url = {https://doi.org/10.1145/1645953.1646085}, doi = {https://doi.org/10.1145/1645953.1646085} }