{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T12:59:23Z","timestamp":1781182763711,"version":"3.54.1"},"reference-count":23,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"name":"Inner Mongolia Key R&D and Achievement Transformation Program","award":["2025YFSH0157"],"award-info":[{"award-number":["2025YFSH0157"]}]},{"name":"National Natural Science Foundation of Inner Mongolia","award":["2023LHMS01008"],"award-info":[{"award-number":["2023LHMS01008"]}]},{"name":"National Key Foreign Expert Program of China","award":["D20250092"],"award-info":[{"award-number":["D20250092"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,4,18]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In response to the limitations of existing clustering-based k-anonymity models in handling outlier data and the insufficient consideration of balancing information loss and data utility, an optimal clustering-based k-anonymity algorithm (OCBKA) was proposed. By transforming the optimization problem of k-anonymity utility into the optimal clustering problem of anonymous equivalence classes, OCBKA employed the Local Outlier Factor algorithm to rank data based on outlier scores, thereby identifying and separating outliers. Simultaneously, by constructing natural equivalence classes, the algorithm adopted a clustering approach to select optimal cluster centers, completing the clustering process. The distances generated during cluster formation are retained to enhance the algorithm\u2019s efficiency. Experimental results demonstrated the algorithm\u2019s effectiveness in reducing information loss and improving execution time, significantly reducing the impact of outlier data on information loss.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf136","type":"journal-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T13:07:09Z","timestamp":1763125629000},"page":"655-666","source":"Crossref","is-referenced-by-count":0,"title":["A study of improved k-anonymity privacy-preserving algorithms for data sharing"],"prefix":"10.1093","volume":"69","author":[{"given":"Xu","family":"Cui","sequence":"first","affiliation":[{"name":"Inner Mongolia University of Technology, School of Data Science and Application, Jinchuan Industrial Park, Hohhot Economic and Technological Development Zone , Inner Mongolia, Hohhot 010051 ,","place":["China"]},{"name":"Songyuan Vocational and Technical College, School of Information Technology , No. 820 Zhongshan Street, Ningjiang District, Songyuan City, Jilin Province, Songyuan 138000 ,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruiqiang","family":"Ma","sequence":"additional","affiliation":[{"name":"Inner Mongolia University of Technology, School of Data Science and Application, Jinchuan Industrial Park, Hohhot Economic and Technological Development Zone , Inner Mongolia, Hohhot 010051 ,","place":["China"]},{"name":"Meiji University , Kandasurugadai, Chiyoda Ward, Tokyo Met. $\\overline{\\top} $101-0062, Tokyo 371-8510 ,","place":["Japan"]},{"name":"Mongolia Key Laboratory of Beijiang Cyberspace Security , Jinchuan Industrial Park, Hohhot Economic and Technological Development Zone, Inner Mongolia, Hohhot 010051 ,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanan","family":"Guo","sequence":"additional","affiliation":[{"name":"Inner Mongolia University of Technology, School of Data Science and Application , Jinchuan Industrial Park, Hohhot Economic and Technological Development Zone, Inner Mongolia, Hohhot 010051 ,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haoran","family":"Yang","sequence":"additional","affiliation":[{"name":"Inner Mongolia University of Technology, School of Data Science and Application , Jinchuan Industrial Park, Hohhot Economic and Technological Development Zone, Inner Mongolia, Hohhot 010051 ,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"2026061108212523700_ref1","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1089\/big.2021.0169","article-title":"A review of anonymization for healthcare data","volume":"12","author":"Olatunji","year":"2024","journal-title":"Big Data"},{"key":"2026061108212523700_ref2","first-page":"564","article-title":"Big data publishing privacy protection based on scalable l-diversity","volume":"30","author":"Zou","year":"2021","journal-title":"Appl Res Comput"},{"key":"2026061108212523700_ref3","first-page":"1497","article-title":"Improved k-anonymity privacy protection algorithm based on different sensitivities","volume":"43","author":"Zhai","year":"2023","journal-title":"J Comput Appl"},{"key":"2026061108212523700_ref4","doi-asserted-by":"crossref","first-page":"20067","DOI":"10.1109\/ACCESS.2019.2962368","article-title":"Comprehensive survey on big data privacy protection","volume":"8","author":"Binjubeir","year":"2019","journal-title":"IEEE Access"},{"key":"2026061108212523700_ref5","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","article-title":"k-anonymity: a model for protecting privacy","volume":"10","author":"Sweeney","year":"2002","journal-title":"Int J Uncertainty Fuzziness Knowledge-Based Syst"},{"key":"2026061108212523700_ref6","first-page":"1625","article-title":"k-anonymous data privacy protection mechanism based on optimal clustering","volume":"59","author":"Zhang","year":"2022","journal-title":"J Comput Res Dev"},{"key":"2026061108212523700_ref7","first-page":"188","article-title":"Efficient k-anonymization using clustering techniques","volume-title":"International Conference on Database Systems for Advanced Applications","author":"Byun","year":"2007"},{"key":"2026061108212523700_ref8","first-page":"46","article-title":"An efficient clustering method for k-anonymization","volume-title":"ACM. Proceedings of the 2008 International Workshop on Privacy and Anonymity in Information Society.","author":"Lin","year":"2008"},{"key":"2026061108212523700_ref9","first-page":"462","article-title":"k-anonymity algorithm based on improved clustering","volume-title":"IACR. Algorithms and Architectures for Parallel Processing: 18th International Conference, ICA3PP 2018. Guangzhou, China","author":"Zheng"},{"key":"2026061108212523700_ref10","doi-asserted-by":"crossref","first-page":"2077","DOI":"10.1007\/s12652-021-03417-0","article-title":"An efficient privacy-preserving approach for data publishing","volume":"14","author":"Qian","year":"2023","journal-title":"J Ambient Intell Hum Comput"},{"key":"2026061108212523700_ref11","doi-asserted-by":"crossref","first-page":"1613","DOI":"10.3390\/e25121613","article-title":"Designing a novel approach using a greedy and information-theoretic clustering-based algorithm for anonymizing microdata sets","volume":"25","author":"Khatir","year":"2023","journal-title":"Entropy"},{"key":"2026061108212523700_ref12","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.3390\/s23031554","article-title":"k-anonymity privacy protection algorithm for multi-dimensional data against skewness and similarity attacks","volume":"23","author":"Su","year":"2023","journal-title":"Sensors"},{"key":"2026061108212523700_ref13","first-page":"52","article-title":"Research of improved k-anonymity algorithm and its application in privacy protection","volume":"22","author":"Gu","year":"2022","journal-title":"Netinfo Security"},{"key":"2026061108212523700_ref14","doi-asserted-by":"crossref","first-page":"4075","DOI":"10.1016\/j.jksuci.2021.04.014","article-title":"KAB: A new k-anonymity approach based on black hole algorithm","volume":"34","author":"Kacha","year":"2022","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"2026061108212523700_ref15","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.jksuci.2022.12.008","article-title":"Local generalization and Bucketization technique for personalized privacy preservation","volume":"35","author":"Li","year":"2023","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"2026061108212523700_ref16","doi-asserted-by":"crossref","first-page":"2251","DOI":"10.1007\/s00607-021-00922-0","article-title":"A weighted K-member clustering algorithm for k-anonymization","volume":"103","author":"Yan","year":"2021","journal-title":"Computing."},{"key":"2026061108212523700_ref17","doi-asserted-by":"crossref","first-page":"103027","DOI":"10.1016\/j.cose.2022.103027","article-title":"Design of privacy preserving model based on clustering involved anonymization along with feature selection","volume":"126","author":"Srijayanthi","year":"2023","journal-title":"Comput Secur"},{"key":"2026061108212523700_ref18","doi-asserted-by":"crossref","first-page":"e6487","DOI":"10.1002\/cpe.6487","article-title":"A clustering-based anonymization approach for privacy-preserving in the healthcare cloud","volume":"34","author":"Abbasi","year":"2022","journal-title":"Concurrency Comput Pract Exper"},{"key":"2026061108212523700_ref19","doi-asserted-by":"crossref","first-page":"757","DOI":"10.14778\/3067421.3067425","article-title":"Local search methods for K-means with outliers","volume":"10","author":"Gupta","year":"2017","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026061108212523700_ref20","first-page":"402","article-title":"K-anonymity mechanism based on iterative binary clustering","volume":"9","author":"Wang","year":"2023","journal-title":"J Inf Secur Res"},{"key":"2026061108212523700_ref21","first-page":"22","article-title":"Data anonymization based on natural equivalent class","volume-title":"IEEE. 2019 IEEE 23rd International Conference on Computer Supported Cooperative Work in Design (CSCWD), Porto, Portugal","author":"Guo"},{"key":"2026061108212523700_ref22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/bdcc5010001","article-title":"A review of local outlier factor algorithms for outlier detection in big data streams","volume":"5","author":"Alghushairy","year":"2020","journal-title":"Big Data Cognit Comput"},{"key":"2026061108212523700_ref23","doi-asserted-by":"crossref","first-page":"102488","DOI":"10.1016\/j.cose.2021.102488","article-title":"k-anonymity in practice: how generalisation and suppression affect machine learning classifiers","volume":"111","author":"Slijep\u010devi\u0107","year":"2021","journal-title":"Comput Secur"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/4\/655\/65802546\/bxaf136.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/4\/655\/65802546\/bxaf136.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T12:21:35Z","timestamp":1781180495000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/69\/4\/655\/8374050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":23,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,12,8]]},"published-print":{"date-parts":[[2026,4,18]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf136","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,4]]},"published":{"date-parts":[[2025,12,8]]}}}