{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T03:00:21Z","timestamp":1773889221477,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004233","name":"Universitat Polit\u00e8cnica de Val\u00e8ncia","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004233","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>k-Anonymization is a popular approach for sharing datasets while preserving the privacy of personal and sensitive information. It ensures that each individual is indistinguishable from at least k-1 others in the anonymized dataset through data suppression or generalization, which inevitably leads to some information loss. The goal is to achieve k-anonymization with minimal information loss. This paper presents an efficient local search framework designed to address this challenge using arbitrary information loss metrics. The framework leverages anytime capabilities, allowing it to balance computation time and solution quality, thereby progressively improving the quality of the anonymized data. Our empirical evaluation shows that the proposed local search framework significantly reduces information loss compared to current state-of-the-art solutions, providing performance improvements of up to 54% and 43% w.r.t. the k-members and l-greedy heuristic solutions, the leading algorithms for large datasets. Additionally, our solution approach outperforms the Hun-garian-based solution, the best solution approach for small-size instances, by up to 4.7% on these instances.<\/jats:p>","DOI":"10.1007\/s10489-024-05909-w","type":"journal-article","created":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T02:53:07Z","timestamp":1734663187000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Iterative local search for preserving data privacy"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1622-5645","authenticated-orcid":false,"given":"Alejandro","family":"Arbelaez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9453-5150","authenticated-orcid":false,"given":"Laura","family":"Climent","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,20]]},"reference":[{"key":"5909_CR1","first-page":"2016","volume":"679","author":"P Regulation","year":"2016","unstructured":"Regulation P (2016) Regulation (eu) 2016\/679 of the European parliament and of the council. Regulation (eu) 679:2016","journal-title":"Regulation (eu)"},{"key":"5909_CR2","doi-asserted-by":"crossref","unstructured":"Kenthapadi K,\u00a0Mironov I, Thakurta AG (2019) Privacy-preserving data mining in industry. In: ACM International conference on web search and data mining, association for computing machinery, pp 840\u2013841","DOI":"10.1145\/3289600.3291384"},{"key":"5909_CR3","doi-asserted-by":"crossref","unstructured":"Karagiannis S,\u00a0Ntantogian C,\u00a0Magkos E,\u00a0Tsohou A, Ribeiro LL (2024) Mastering data privacy: leveraging k-anonymity for robust health data sharing. Int J Inf Secur 1\u201313","DOI":"10.1007\/s10207-024-00838-8"},{"key":"5909_CR4","doi-asserted-by":"publisher","first-page":"53066","DOI":"10.1109\/ACCESS.2022.3175219","volume":"10","author":"A Majeed","year":"2022","unstructured":"Majeed A, Khan S, Hwang SO (2022) Toward privacy preservation using clustering based anonymization: Recent advances and future research outlook. IEEE Access 10:53066\u201353097","journal-title":"IEEE Access"},{"key":"5909_CR5","doi-asserted-by":"publisher","first-page":"51071","DOI":"10.1109\/ACCESS.2020.2980235","volume":"8","author":"A Zigomitros","year":"2020","unstructured":"Zigomitros A, Casino F, Solanas A, Patsakis C (2020) A survey on privacy properties for data publishing of relational data. IEEE Access 8:51071\u201351099","journal-title":"IEEE Access"},{"key":"5909_CR6","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez D, Mart\u00ednez S, Domingo-Ferrer J (2016) Comment on \u201cunique in the shopping mall: On the reidentifiability of credit card metadata\u201d. Science 351(6279):1274\u20131274","DOI":"10.1126\/science.aad9295"},{"key":"5909_CR7","doi-asserted-by":"crossref","unstructured":"Doka K,\u00a0Xue M,\u00a0Tsoumakos D,\u00a0Karras P (2015) k-anonymization by freeform generalization. In: ASIA CCS \u201915, ACM, pp 519\u2013530","DOI":"10.1145\/2714576.2714590"},{"key":"5909_CR8","unstructured":"Mauger C,\u00a0Le\u00a0Mahec G,\u00a0Dequen G (2020) Modeling and evaluation of k-anonymization metrics. In: Privacy preserving artificial intelligence workshop of AAAI"},{"key":"5909_CR9","doi-asserted-by":"crossref","unstructured":"Byun J,\u00a0Kamra A,\u00a0Bertino E,\u00a0Li N (2007) Efficient k-anonymization using clustering techniques. In: Conference on Database Systems for Advanced Applications, DASFAA, vol 4443, Springer, pp 188\u2013200","DOI":"10.1007\/978-3-540-71703-4_18"},{"key":"5909_CR10","doi-asserted-by":"publisher","first-page":"101753","DOI":"10.1016\/j.cose.2020.101753","volume":"93","author":"Y Liang","year":"2020","unstructured":"Liang Y, Samavi R (2020) Optimization-based k-anonymity algorithms. Comput Secur 93:101753","journal-title":"Comput Secur"},{"issue":"02","key":"5909_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1142\/S0218488519500089","volume":"27","author":"S Madan","year":"2019","unstructured":"Madan S, Goswami P (2019) k-ddd measure and mapreduce based anonymity model for secured privacy-preserving big data publishing. Int J Uncertain Fuzziness Knowl-Based Syst 27(02):177\u2013199","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"},{"issue":"22","key":"5909_CR12","doi-asserted-by":"publisher","first-page":"10740","DOI":"10.3390\/app112210740","volume":"11","author":"JW Kim","year":"2021","unstructured":"Kim JW (2021) Efficiently supporting online privacy-preserving data publishing in a distributed computing environment. Appl Sci 11(22):10740","journal-title":"Appl Sci"},{"key":"5909_CR13","doi-asserted-by":"publisher","first-page":"102224","DOI":"10.1016\/j.cose.2021.102224","volume":"105","author":"T Kanwal","year":"2021","unstructured":"Kanwal T, Anjum A, Malik SUR, Haider S, Khan A, Manzoor U, Asheralieva A (2021) A robust privacy preserving approach for electronic health records using multiple dataset with multiple sensitive attributes. Comput Secur 105:102224","journal-title":"Comput Secur"},{"issue":"10","key":"5909_CR14","doi-asserted-by":"publisher","first-page":"2251","DOI":"10.1007\/s00607-021-00922-0","volume":"103","author":"Y Yan","year":"2021","unstructured":"Yan Y, Herman EA, Mahmood A, Feng T, Xie P (2021) A weighted k-member clustering algorithm for k-anonymization. Computing 103(10):2251\u20132273","journal-title":"Computing"},{"key":"5909_CR15","doi-asserted-by":"crossref","unstructured":"Abbasi A, Mohammadi B (2022) A clustering-based anonymization approach for privacy-preserving in the healthcare cloud. Concurr Comput Pract Exp 34(1):e6487","DOI":"10.1002\/cpe.6487"},{"issue":"3\u20134","key":"5909_CR16","first-page":"343","volume":"20","author":"S Madan","year":"2021","unstructured":"Madan S, Goswami P (2021) Hybrid privacy preservation model for big data publishing on cloud. Int J Adv Intell Paradigms 20(3\u20134):343\u2013355","journal-title":"Int J Adv Intell Paradigms"},{"issue":"7","key":"5909_CR17","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1002\/spe.2812","volume":"50","author":"F Prasser","year":"2020","unstructured":"Prasser F, Eicher J, Spengler H, Bild R, Kuhn KA (2020) Flexible data anonymization using ARX - current status and challenges ahead. Softw Pract Exp 50(7):1277\u20131304","journal-title":"Softw Pract Exp"},{"key":"5909_CR18","doi-asserted-by":"crossref","unstructured":"Kacha L, Zitouni A, Djoudi M (2022) Kab: A new k-anonymity approach based on black hole algorithm. J King Saud Univ-Comput Inf Sci 34(7):4075\u20134088","DOI":"10.1016\/j.jksuci.2021.04.014"},{"key":"5909_CR19","doi-asserted-by":"crossref","unstructured":"Onesimu JA, Karthikeyan J, Eunice J, Pomplun M, Dang H (2022) Privacy preserving attribute-focused anonymization scheme for healthcare data publishing. IEEE Access 10:86979\u201386997","DOI":"10.1109\/ACCESS.2022.3199433"},{"issue":"3","key":"5909_CR20","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1080\/03081079.2023.2173749","volume":"52","author":"O Vovk","year":"2023","unstructured":"Vovk O, Piho G, Ross P (2023) Methods and tools for healthcare data anonymization: a literature review. Int J Gen Syst 52(3):326\u2013342","journal-title":"Int J Gen Syst"},{"issue":"8","key":"5909_CR21","doi-asserted-by":"publisher","first-page":"2678","DOI":"10.2174\/2666255813999200630114256","volume":"14","author":"S Madan","year":"2021","unstructured":"Madan S, Goswami P (2021) Adaptive privacy preservation approach for big data publishing in cloud using k-anonymization. Recent Adv Comput Sci Commun 14(8):2678\u20132688","journal-title":"Recent Adv Comput Sci Commun"},{"key":"5909_CR22","doi-asserted-by":"publisher","first-page":"102488","DOI":"10.1016\/j.cose.2021.102488","volume":"111","author":"D Slijep\u010devi\u0107","year":"2021","unstructured":"Slijep\u010devi\u0107 D, Henzl M, Klausner LD, Dam T, Kieseberg P, Zeppelzauer M (2021) k-anonymity in practice: How generalisation and suppression affect machine learning classifiers. Comput Secur 111:102488","journal-title":"Comput Secur"},{"issue":"05","key":"5909_CR23","first-page":"2250083","volume":"31","author":"T Wang","year":"2022","unstructured":"Wang T, Xu L, Zhang M, Zhang H, Zhang G (2022) A new privacy protection approach based on k-anonymity for location-based cloud services, Journal of Circuits. Syst Comput 31(05):2250083","journal-title":"Syst Comput"},{"key":"5909_CR24","doi-asserted-by":"publisher","first-page":"105995","DOI":"10.1016\/j.asoc.2019.105995","volume":"87","author":"C-Y Lin","year":"2020","unstructured":"Lin C-Y (2020) A reversible privacy-preserving clustering technique based on k-means algorithm. Appl Soft Comput 87:105995","journal-title":"Appl Soft Comput"},{"issue":"11","key":"5909_CR25","doi-asserted-by":"publisher","first-page":"338","DOI":"10.3390\/fi14110338","volume":"14","author":"M Asad","year":"2022","unstructured":"Asad M, Aslam M, Jilani SF, Shaukat S, Tsukada M (2022) Shfl: K-anonymity-based secure hierarchical federated learning framework for smart healthcare systems. Future Internet 14(11):338","journal-title":"Future Internet"},{"key":"5909_CR26","doi-asserted-by":"crossref","unstructured":"Gowda VT,\u00a0Bagai R (2023) Generating t-closed partitions of datasets with multiple sensitive attributes. In: 2023 7th International Conference on Cryptography, Security and Privacy (CSP). IEEE, pp 107\u2013111","DOI":"10.1109\/CSP58884.2023.00024"},{"issue":"9","key":"5909_CR27","doi-asserted-by":"publisher","first-page":"9102","DOI":"10.1109\/TKDE.2022.3221333","volume":"35","author":"W Ren","year":"2022","unstructured":"Ren W, Ghazinour K, Lian X (2022) $$ kt $$-safety: Graph release via $$ k $$-anonymity and $$ t $$-closeness. IEEE Trans Knowl Data Eng 35(9):9102\u20139113","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05909-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-05909-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05909-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:03:37Z","timestamp":1738253017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-05909-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,20]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["5909"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-05909-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,20]]},"assertion":[{"value":"24 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"189"}}