{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T02:26:45Z","timestamp":1766888805658},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T00:00:00Z","timestamp":1294790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s00236-010-0131-6","type":"journal-article","created":{"date-parts":[[2011,1,11]],"date-time":"2011-01-11T18:48:25Z","timestamp":1294771705000},"page":"51-66","source":"Crossref","is-referenced-by-count":64,"title":["Efficient systematic clustering method for k-anonymization"],"prefix":"10.1007","volume":"48","author":[{"given":"Md. Enamul","family":"Kabir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisa","family":"Bertino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,12]]},"reference":[{"key":"131_CR1","unstructured":"Bayardo, R.J., Agrawal, R.: Data privacy through optimal k-anonymization. In: International Conference on Data Engineering (2005)"},{"issue":"1","key":"131_CR2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1121995.1121997","volume":"35","author":"J.W. Byun","year":"2006","unstructured":"Byun J.W., Bertino E.: Micro-views, or on how to protect privacy while enhancing data usability: concepts and challenges. SIGMOD 35(1), 9\u201313 (2006)","journal-title":"SIGMOD"},{"key":"131_CR3","doi-asserted-by":"crossref","unstructured":"Byun, J.W., Kamra, A., Bertino, E., Li, N.: Efficient k-anonymization using clustering techniques. In: International Conference on Database Systems for Advanced Applications (DASFAA) (2007)","DOI":"10.1007\/978-3-540-71703-4_18"},{"key":"131_CR4","doi-asserted-by":"crossref","unstructured":"Byun, J.W., Sohn, Y., Bertino, E., Li, N.: Secure anonymization for incremental datasets. In: 3rd VLDB Workshop on Secure Data Management (SDM) (2006)","DOI":"10.1007\/11844662_4"},{"key":"131_CR5","doi-asserted-by":"crossref","unstructured":"Chiu, C.-C., Tsai, C.-Y.: A k-anonymity clustering method for effective data privacy preservation. In: Third International Conference on Advanced Data Mining and Applications (ADMA) (2007)","DOI":"10.1007\/978-3-540-73871-8_10"},{"key":"131_CR6","first-page":"103","volume-title":"Privacy-Preserving Data Mining: Models and Algorithms","author":"V. Ciriani","year":"2008","unstructured":"Ciriani V., di Vimercati S.D.C., Foresti S., Samarati P.: k-anonymous data mining: a aurvey. In: Aggarwal, C.C., Yu, P.S. (eds) Privacy-Preserving Data Mining: Models and Algorithms, pp. 103\u2013134. Kluwer Academic Publishers, Boston (2008)"},{"key":"131_CR7","unstructured":"Fung, B.C.M., Wang, K., Yu, P.S.: Top-down specialization for information and privacy preservation. In: International Conference on Data Engineering (2005)"},{"key":"131_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.Z. Gonzalez","year":"1985","unstructured":"Gonzalez T.Z.: Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38, 293\u2013306 (1985)","journal-title":"Theor Comput Sci"},{"key":"131_CR9","unstructured":"Hettich, C.B.S., Merz, C.: UCI repository of machine learning databases (1998)"},{"key":"131_CR10","doi-asserted-by":"crossref","unstructured":"Iyengar, V.S.: Transforming data to satisfy privacy constraints. In: SIGKDD (2002)","DOI":"10.1145\/775047.775089"},{"key":"131_CR11","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D., Ramakrishnan, R.: Incogniti: efficient full-domain k-anonymity. In: ACM International Conference on Management of Data (2005)","DOI":"10.1145\/1066157.1066164"},{"key":"131_CR12","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D., Ramakrishnan, R.: Mondrian multidimensional k-anonymity. In: International Conference on Data Engineering (2006)","DOI":"10.1109\/ICDE.2006.101"},{"key":"131_CR13","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T.: t-closeness: privacy beyond k-anonymity and l-diversity. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367856"},{"key":"131_CR14","doi-asserted-by":"crossref","unstructured":"Lin, J.L., Wei, M.C.: An efficient clustering method for k-anonymization. In: Proceedings of the 2008 International Workshop on Privacy and Anonymity in Information Society (2008)","DOI":"10.1145\/1379287.1379297"},{"key":"131_CR15","doi-asserted-by":"crossref","unstructured":"Loukides, G., Shao, J.: Capturing data usefulness and privacy protection in k-anonymisation. In: Proceedings of the 2007 ACM Symposium on Applied Computing (2007)","DOI":"10.1145\/1244002.1244091"},{"key":"131_CR16","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramanian, M.: l-diversity: privacy beyond k-anonymity. In: ICDE (2006)","DOI":"10.1109\/ICDE.2006.1"},{"key":"131_CR17","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: PODS, pp. 223\u2013228 (2004)","DOI":"10.1145\/1055558.1055591"},{"key":"131_CR18","doi-asserted-by":"crossref","unstructured":"Samarati, P.: Protecting respondent\u2019s privacy in microdata release. TKDE, 13(6) (2001)","DOI":"10.1109\/69.971193"},{"key":"131_CR19","doi-asserted-by":"crossref","unstructured":"Solanas, A., Sebe, F., Domingo-Ferrer, J.: Micro-aggregation-based heuristics for p-sensitive k-anonymity: One step beyond. In: International Work-shop on Privacy and Anonymity in the Information Society (2008)","DOI":"10.1145\/1379287.1379300"},{"key":"131_CR20","unstructured":"Sun, X., Li, M., Wang, H., Plank, A.: An efficient hash-based algorithm for minimal k-anonymity. In: ACSC, pp. 101\u2013107, (2008)"},{"key":"131_CR21","unstructured":"Sun, X., Wang, H., Li, J.: Priority driven K-Anonymisation for privacy protection. In: AusDM, pp. 73\u201378 (2008)"},{"issue":"5","key":"131_CR22","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney L.: Achieving k-anonymity privacy protection using generalization and supression. Int. J. Uncertainty Fuzziness Knowledge-based Syst. 10(5), 571\u2013588 (2002)","journal-title":"Int. J. Uncertainty Fuzziness Knowledge-based Syst."},{"issue":"5","key":"131_CR23","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. Uncertainty Fuzziness Knowledge-based Syst. 10(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertainty Fuzziness Knowledge-based Syst."},{"key":"131_CR24","doi-asserted-by":"crossref","unstructured":"Truta, T., Vinay, B.: Privacy protection: p-sensitive k-anonymity property. In: International Workshop on Privacy Data Management (PDM), p. 94 (2006)","DOI":"10.1109\/ICDEW.2006.116"},{"key":"131_CR25","doi-asserted-by":"crossref","unstructured":"Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., Fu, A.W.C.: Utility-based anonymization using local recording. In: KDD 2006, pp. 785\u2013790 (2006)","DOI":"10.1145\/1150402.1150504"},{"key":"131_CR26","doi-asserted-by":"crossref","unstructured":"Wong, R.C.-W., Li, J., Fu, A.W.-C., Wang, K.: (\u03b1, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing. In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2006)","DOI":"10.1145\/1150402.1150499"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-010-0131-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-010-0131-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-010-0131-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T20:27:58Z","timestamp":1685910478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-010-0131-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,12]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["131"],"URL":"https:\/\/doi.org\/10.1007\/s00236-010-0131-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,12]]}}}