Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell Whitley. POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice. In David Wai-Lok Cheung, Il-Yeol Song, Wesley W. Chu, Xiaohua Hu, Jimmy J. Lin, editors, Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009. pages 1037-1046, ACM, 2009. [doi]
@inproceedings{DewriRRW09-0, title = {POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice}, author = {Rinku Dewri and Indrajit Ray and Indrakshi Ray and Darrell Whitley}, year = {2009}, doi = {10.1145/1645953.1646085}, url = {http://doi.acm.org/10.1145/1645953.1646085}, researchr = {https://researchr.org/publication/DewriRRW09-0}, cites = {0}, citedby = {0}, pages = {1037-1046}, booktitle = {Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009}, editor = {David Wai-Lok Cheung and Il-Yeol Song and Wesley W. Chu and Xiaohua Hu and Jimmy J. Lin}, publisher = {ACM}, isbn = {978-1-60558-512-3}, }