{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T06:30:16Z","timestamp":1778308216796,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,8,27]],"date-time":"2011-08-27T00:00:00Z","timestamp":1314403200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10618-011-0235-9","type":"journal-article","created":{"date-parts":[[2011,8,26]],"date-time":"2011-08-26T07:33:55Z","timestamp":1314344035000},"page":"134-168","source":"Crossref","is-referenced-by-count":35,"title":["A practical approximation algorithm for optimal k-anonymity"],"prefix":"10.1007","volume":"25","author":[{"given":"Batya","family":"Kenig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamir","family":"Tassa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,8,27]]},"reference":[{"key":"235_CR1","unstructured":"Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Anonymizing tables. In: ICDT, pp 246\u2013258"},{"key":"235_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proc. 20th int. conf. very large data bases, VLDB, pp 487\u2013499"},{"key":"235_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: ACM-SIGMOD conference on management of data, pp 439\u2013450","DOI":"10.1145\/335191.335438"},{"key":"235_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo R, Agrawal R (2005) Data privacy through optimal k-anonymization. In: International conference on data engineering (ICDE), pp 217\u2013228","DOI":"10.1109\/ICDE.2005.42"},{"key":"235_CR5","unstructured":"Byun J-W, Kamra A, Bertino E, Li N (2007) Efficient k-anonymization using clustering techniques. In: DASFAA, pp 188\u2013200"},{"key":"235_CR6","doi-asserted-by":"crossref","unstructured":"Ghinita G, Karras P, Kalnis P, Mamoulis N (2009) A framework for efficient data anonymization under privacy and accuracy constraints. ACM Trans Database Syst 34(2)","DOI":"10.1145\/1538909.1538911"},{"issue":"2","key":"235_CR7","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1109\/TKDE.2008.129","volume":"21","author":"A Gionis","year":"2009","unstructured":"Gionis A, Tassa T (2009) k-anonymization with minimal loss of information. IEEE Trans Knowl Data Eng 21(2): 206\u2013219","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"235_CR8","doi-asserted-by":"crossref","unstructured":"Gionis A, Mazza A, Tassa T (2008) k-anonymization revisited. In: International conference on data engineering (ICDE), pp 744\u2013753","DOI":"10.1109\/ICDE.2008.4497483"},{"key":"235_CR9","first-page":"149","volume":"3","author":"J Goldberger","year":"2010","unstructured":"Goldberger J, Tassa T (2010) Efficient anonymizations with enhanced utility. TDP 3: 149\u2013175","journal-title":"TDP"},{"issue":"10","key":"235_CR10","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using fp-trees. IEEE Trans Knowl Data Eng 17(10): 1347\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"235_CR11","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"C-J Hsiao","year":"2005","unstructured":"Hsiao C-J (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4): 462\u2013478","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"235_CR12","doi-asserted-by":"crossref","unstructured":"Iyengar V (2002) Transforming data to satisfy privacy constraints. In: KDD \u201902: proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, pp 279\u2013288","DOI":"10.1145\/775047.775089"},{"key":"235_CR13","doi-asserted-by":"crossref","unstructured":"LeFevre K, DeWitt D, Ramakrishnan R (2005) Incognito: efficient full-domain k-anonymity. In: ACM-SIGMOD conference on management of data, pp 49\u201360","DOI":"10.1145\/1066157.1066164"},{"key":"235_CR14","doi-asserted-by":"crossref","unstructured":"LeFevre K, DeWitt DJ, Ramakrishnan R (2006) Mondrian multidimensional k-anonymity. In: ICDE, p 25","DOI":"10.1109\/ICDE.2006.101"},{"key":"235_CR15","doi-asserted-by":"crossref","unstructured":"Li N, Li T, Venkatasubramanian S (2007) t-closeness: privacy beyond k-anonymity and \u2113-diversity. In: Proceedings of IEEE international conference on data engineering (ICDE) 2007, pp 106\u2013115","DOI":"10.1109\/ICDE.2007.367856"},{"issue":"1","key":"235_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1217299.1217302","volume":"1","author":"A Machanavajjhala","year":"2007","unstructured":"Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M (2007) \u2113-diversity: privacy beyond k-anonymity. ACM Trans Knowl Discov Data 1(1): 3","journal-title":"ACM Trans Knowl Discov Data"},{"key":"235_CR17","doi-asserted-by":"crossref","unstructured":"Meyerson A, Williams R (2004) On the complexity of optimal k-anonymity. In: PODS \u201904: proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, pp 223\u2013228","DOI":"10.1145\/1055558.1055591"},{"issue":"3","key":"235_CR18","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/j.datak.2007.03.009","volume":"63","author":"M Nergiz","year":"2007","unstructured":"Nergiz M, Clifton C (2007) Thoughts on k-anonymization. Data Knowl Eng 63(3): 622\u2013645","journal-title":"Data Knowl Eng"},{"key":"235_CR19","doi-asserted-by":"crossref","unstructured":"Park H, Shim K (2007) Approximate algorithms for k-anonymity. In: SIGMOD \u201907: proceedings of the 2007 ACM SIGMOD international conference on management of data, pp 67\u201378","DOI":"10.1145\/1247480.1247490"},{"key":"235_CR20","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Workshop on research issues in data mining and knowledge discovery, DMKD, pp 21\u201330"},{"issue":"6","key":"235_CR21","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P Samarati","year":"2001","unstructured":"Samarati P (2001) Protecting respondents\u2019 identities in microdata release. IEEE Trans Knowl Data Eng 13(6): 1010\u20131027","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"235_CR22","doi-asserted-by":"crossref","unstructured":"Samarati P, Sweeney L (1998) Generalizing data to provide anonymity when disclosing information (abstract). In: PODS \u201998: proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, p 188","DOI":"10.1145\/275487.275508"},{"key":"235_CR23","unstructured":"Srikant R, Agrawal R (1995) Minning generalized association rules. In: VLDB, pp 407\u2013419"},{"key":"235_CR24","unstructured":"Sweeney L (2000) Uniqueness of simple demographics in the U.S. population. Laboratory for international Data Privacy LIDAP-WP4"},{"issue":"5","key":"235_CR25","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) k-anonymity: a model for protecting privacy. Int J Uncertain Fuzz Knowl Based Syst 10(5): 557\u2013570","journal-title":"Int J Uncertain Fuzz Knowl Based Syst"},{"key":"235_CR26","doi-asserted-by":"crossref","unstructured":"Truta T, Campan A, Meyer P (2007) Generating microdata with p-sensitive k-anonymity property. In: SDM, pp 124\u2013141","DOI":"10.1007\/978-3-540-75248-6_9"},{"key":"235_CR27","doi-asserted-by":"crossref","unstructured":"Wong R, Li J, Fu A, Wang K (2006) (\u03b1, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing. In: In ACM SIGKDD, pp 754\u2013759","DOI":"10.1145\/1150402.1150499"},{"key":"235_CR28","unstructured":"Xiao X, Tao Y (2006) Anatomy: simple and effective privacy preservation. In: VLDB, pp 139\u2013150"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-011-0235-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-011-0235-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-011-0235-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T00:48:08Z","timestamp":1686271688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-011-0235-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,27]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["235"],"URL":"https:\/\/doi.org\/10.1007\/s10618-011-0235-9","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,27]]}}}