{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T15:14:51Z","timestamp":1784733291043,"version":"3.55.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T00:00:00Z","timestamp":1276128000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s00778-010-0192-8","type":"journal-article","created":{"date-parts":[[2010,6,9]],"date-time":"2010-06-09T13:02:13Z","timestamp":1276088533000},"page":"83-106","source":"Crossref","is-referenced-by-count":83,"title":["Local and global recoding methods for anonymizing set-valued data"],"prefix":"10.1007","volume":"20","author":[{"given":"Manolis","family":"Terrovitis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panos","family":"Kalnis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,6,10]]},"reference":[{"key":"192_CR1","unstructured":"Aggarwal, C.C.: On k-anonymity and the curse of dimensionality. In: VLDB \u201905: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 901\u2013909. VLDB Endowment (2005)"},{"key":"192_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R. Thomas, D., Zhu, A.: Achieving anonymity via clustering. In: Proceedings of ACM PODS, pp. 153\u2013162 (2006)","DOI":"10.1145\/1142351.1142374"},{"key":"192_CR3","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Approximation algorithms for k-anonymity. J. Priv. Tech. (Paper number:20051120001) (2005)"},{"key":"192_CR4","unstructured":"Atzori, M., Bonchi, F., Giannotti, F., Pedreschi, D.: Anonymity preserving pattern discovery. VLDB J. (accepted for publication) (2008)"},{"key":"192_CR5","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R.: Data privacy through optimal k-anonymization. In: Proceedings of ICDE, pp 217\u2013228 (2005)","DOI":"10.1109\/ICDE.2005.42"},{"key":"192_CR6","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. pp. 137\u2013150. December (2004)"},{"key":"192_CR7","unstructured":"Ghinita, G., Karras, P., Kalnis, P., Mamoulis, N.: Fast data anonymization with low information loss. In: vldb, pp. 758\u2013769 (2007)"},{"key":"192_CR8","doi-asserted-by":"crossref","unstructured":"Ghinita, G., Tao, Y., Kalnis, P.: On the anonymization of sparse high-dimensional data. In: Proceedings of ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497480"},{"key":"192_CR9","unstructured":"Han, J., Fu, Y.: Discovery of multiple-level association rules from large databases. In: vldb, pp. 420\u2013431 (1995)"},{"issue":"5","key":"192_CR10","first-page":"798","volume":"11","author":"J. Han","year":"1999","unstructured":"Han J., Fu Y.: Mining multiple-level association rules in large databases. IEEE TKDE 11(5), 798\u2013805 (1999)","journal-title":"IEEE TKDE"},{"key":"192_CR11","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"issue":"1","key":"192_CR12","first-page":"934","volume":"2","author":"Y. He","year":"2009","unstructured":"He Y., Naughton J.F.: Anonymization of set-valued data via top-down, local generalization. PVLDB 2(1), 934\u2013945 (2009)","journal-title":"PVLDB"},{"key":"192_CR13","doi-asserted-by":"crossref","unstructured":"Iyengar, V.S.: Transforming data to satisfy privacy constraints. In: Proceedings of SIGKDD, pp. 279\u2013288 (2002)","DOI":"10.1145\/775047.775089"},{"key":"192_CR14","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: efficient full-domain k-anonymity. In: Proceedings of ACM SIGMOD, pp. 49\u201360 (2005)","DOI":"10.1145\/1066157.1066164"},{"key":"192_CR15","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Mondrian multidimensional k-anonymity. In: Proceedings of ICDE (2006)","DOI":"10.1109\/ICDE.2006.101"},{"key":"192_CR16","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: t-Closeness: privacy beyond k-anonymity and l-diversity. In: Proceedings of ICDE, pp. 106\u2013115 (2007)","DOI":"10.1109\/ICDE.2007.367856"},{"key":"192_CR17","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-Diversity: privacy beyond k-anonymity. In: Proceedings of ICDE (2006)","DOI":"10.1109\/ICDE.2006.1"},{"key":"192_CR18","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal K-anonymity. In: Proceedings of ACM PODS, pp. 223\u2013228 (2004)","DOI":"10.1145\/1055558.1055591"},{"key":"192_CR19","unstructured":"Nergiz, M., Clifton, C., Nergiz, A.: Multirelational k-anonymity. Technical Report CSD TR 08-002"},{"key":"192_CR20","doi-asserted-by":"crossref","unstructured":"Nergiz, M., Clifton, C., Nergiz, A.: Multirelational k-anonymity. In: Proceedings of ICDE, pp. 1417\u20131421 (2007)","DOI":"10.1109\/ICDE.2007.369025"},{"issue":"3","key":"192_CR21","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/j.datak.2007.03.009","volume":"63","author":"M.E. Nergiz","year":"2007","unstructured":"Nergiz M.E., Clifton C.: Thoughts on k-anonymization. Data. Knowl. Eng. 63(3), 622\u2013645 (2007)","journal-title":"Data. Knowl. Eng."},{"key":"192_CR22","doi-asserted-by":"crossref","unstructured":"Park, H., Shim, K.: Approximate algorithms for k-anonymity. In: Proceedings of ACM SIGMOD, pp. 67\u201378 (2007)","DOI":"10.1145\/1247480.1247490"},{"key":"192_CR23","volume-title":"Numerical recipes in C","author":"W.H. Press","year":"1992","unstructured":"Press W.H., Teukolsky S.A., Vetterling W.T., Flannery B.P.: Numerical recipes in C, 2nd edn. Cambridge University Press, Cambridge (1992)","edition":"2"},{"issue":"6","key":"192_CR24","first-page":"1010","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati P.: Protecting respondents\u2019 identities in microdata release. IEEE TKDE 13(6), 1010\u20131027 (2001)","journal-title":"IEEE TKDE"},{"issue":"5","key":"192_CR25","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney L.: k-Anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 10(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"192_CR26","doi-asserted-by":"crossref","unstructured":"Terrovitis, M., Mamoulis, N., Kalnis, P.: Privacy-preserving anonymization of set-valued data. In: Proceedings of the VLDB Endowment (PVLDB) (former VLDB proceedings) 1(1) (2008)","DOI":"10.14778\/1453856.1453874"},{"issue":"4","key":"192_CR27","first-page":"434","volume":"16","author":"V.S. Verykios","year":"2004","unstructured":"Verykios V.S., Elmagarmid A.K., Bertino E., Saygin Y., Dasseni E.: Association rule hiding. IEEE TKDE 16(4), 434\u2013447 (2004)","journal-title":"IEEE TKDE"},{"key":"192_CR28","doi-asserted-by":"crossref","unstructured":"Xiao, X., Tao, Y.: Anatomy: simple and effective privacy preservation. In: Proceedings of VLDB, pp. 139\u2013150 (2006)","DOI":"10.1145\/1142473.1142500"},{"key":"192_CR29","doi-asserted-by":"crossref","unstructured":"Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., Fu, A.: Utility-based anonymization using local recoding. In: Proceedings of SIGKDD, pp. 785\u2013790 (2006)","DOI":"10.1145\/1150402.1150504"},{"key":"192_CR30","doi-asserted-by":"crossref","unstructured":"Xu, Y., Wang, K., Fu, A.W.-C., Yu, P.S.: Anonymizing transaction databases for publication. In: Proceedings of KDD, pp. 767\u2013775 (2008)","DOI":"10.1145\/1401890.1401982"},{"key":"192_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Koudas, N., Srivastava, D., Yu, T.: Aggregate query answering on anonymized tables. In: Proceedings of ICDE, pp. 116\u2013125 (2007)","DOI":"10.1109\/ICDE.2007.367857"},{"key":"192_CR32","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Kohavi, R., Mason, L.: Real world performance of association rule algorithms. In: Proceedings of KDD, pp. 401\u2013406 (2001)","DOI":"10.1145\/502512.502572"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-010-0192-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-010-0192-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-010-0192-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:11:18Z","timestamp":1740168678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-010-0192-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,10]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["192"],"URL":"https:\/\/doi.org\/10.1007\/s00778-010-0192-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,10]]}}}