{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:20:15Z","timestamp":1765887615256},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p>\n            In this paper we study the problem of protecting privacy in the publication of set-valued data. Consider a collection of transactional data that contains detailed information about items bought together by individuals. Even after removing all personal characteristics of the buyer, which can serve as links to his identity, the publication of such data is still subject to privacy attacks from adversaries who have partial knowledge about the set. Unlike most previous works, we do not distinguish data as sensitive and non-sensitive, but we consider them both as potential quasi-identifiers and potential sensitive data, depending on the point of view of the adversary. We define a new version of the\n            <jats:italic>k<\/jats:italic>\n            -anonymity guarantee, the\n            <jats:italic>k<\/jats:italic>\n            <jats:sup>\n              <jats:italic>m<\/jats:italic>\n            <\/jats:sup>\n            -anonymity, to limit the effects of the data dimensionality and we propose efficient algorithms to transform the database. Our anonymization model relies on generalization instead of suppression, which is the most common practice in related works on such data. We develop an algorithm which finds the optimal solution, however, at a high cost which makes it inapplicable for large, realistic problems. Then, we propose two greedy heuristics, which scale much better and in most of the cases find a solution close to the optimal. The proposed algorithms are experimentally evaluated using real datasets.\n          <\/jats:p>","DOI":"10.14778\/1453856.1453874","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"115-125","source":"Crossref","is-referenced-by-count":188,"title":["Privacy-preserving anonymization of set-valued data"],"prefix":"10.14778","volume":"1","author":[{"given":"Manolis","family":"Terrovitis","sequence":"first","affiliation":[{"name":"University of Hong Kong"}]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[{"name":"University of Hong Kong"}]},{"given":"Panos","family":"Kalnis","sequence":"additional","affiliation":[{"name":"National University of Singapore"}]}],"member":"320","published-online":{"date-parts":[[2008,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142374"},{"key":"e_1_2_1_2_1","first-page":"2005","author":"Aggarwal G.","year":"2005","unstructured":"G. Aggarwal , T. Feder , K. Kenthapadi , R. Motwani , R. Panigrahy , D. Thomas , and A. Zhu . Approximation Algorithms for k-Anonymity. Journal of Privacy Technology, (Paper number : 2005 1120001), 2005 . G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Approximation Algorithms for k-Anonymity. Journal of Privacy Technology, (Paper number: 20051120001), 2005.","journal-title":"Journal of Privacy Technology, (Paper number"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0034-x"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.42"},{"key":"e_1_2_1_5_1","first-page":"758","volume-title":"Fast Data Anonymization with Low Information Loss. In vldb","author":"Ghinita G.","year":"2007","unstructured":"G. Ghinita , P. Karras , P. Kalnis , and N. Mamoulis . Fast Data Anonymization with Low Information Loss. In vldb , pages 758 -- 769 , 2007 . G. Ghinita, P. Karras, P. Kalnis, and N. Mamoulis. Fast Data Anonymization with Low Information Loss. In vldb, pages 758--769, 2007."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497480"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775089"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066164"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.101"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367856"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055591"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.369025"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.03.009"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247490"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.971193"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269668"},{"key":"e_1_2_1_21_1","first-page":"139","volume-title":"Proc. of VLDB","author":"Xiao X.","year":"2006","unstructured":"X. Xiao and Y. Tao . Anatomy: Simple and Effective Privacy Preservation . In Proc. of VLDB , pages 139 -- 150 , 2006 . X. Xiao and Y. Tao. Anatomy: Simple and Effective Privacy Preservation. In Proc. of VLDB, pages 139--150, 2006."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150504"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367857"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502572"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1453856.1453874","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:06:23Z","timestamp":1672225583000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1453856.1453874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.14778\/1453856.1453874"],"URL":"https:\/\/doi.org\/10.14778\/1453856.1453874","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}