{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T02:27:49Z","timestamp":1774578469542,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T00:00:00Z","timestamp":1613779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T00:00:00Z","timestamp":1613779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61762059"],"award-info":[{"award-number":["61762059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s00607-021-00922-0","type":"journal-article","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T17:07:55Z","timestamp":1613840875000},"page":"2251-2273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["A weighted K-member clustering algorithm for K-anonymization"],"prefix":"10.1007","volume":"103","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2885-9867","authenticated-orcid":false,"given":"Yan","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eyeleko Anselme","family":"Herman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adnan","family":"Mahmood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengshou","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,20]]},"reference":[{"key":"922_CR1","doi-asserted-by":"crossref","unstructured":"Zheng WT, Zhongyue W, Tongtong Lv, Ma Y, Jia C (2018) K-anonymity algorithm based on improved clustering. In: Proceedings of the 18th international conference on algorithms and architectures for parallel processing (ICA3PP 2018). Guangzhou, China, November, pp 462\u2013476","DOI":"10.1007\/978-3-030-05054-2_36"},{"key":"922_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.ins.2017.05.031","volume":"412","author":"Z Huang","year":"2017","unstructured":"Huang Z, Liu S, Mao X, Chen K, Li J (2017) Insight of the protection for data security under selective opening attacks. Inf Sci 412:223\u2013241","journal-title":"Inf Sci"},{"key":"922_CR3","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1109\/TPDS.2013.271","volume":"25","author":"J Li","year":"2014","unstructured":"Li J, Huang X, Chen X, Xiang Y (2014) Insight of the protection for data security under selective opening attacks. IEEE Trans Parallel Distrib Syst 25:2201\u20132210","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"922_CR4","doi-asserted-by":"publisher","first-page":"104775","DOI":"10.1109\/ACCESS.2020.2999580","volume":"8","author":"Y Yan","year":"2020","unstructured":"Yan Y, Gao X, Adnan M, Feng T, Xie PS (2020) ENG differential private spatial decomposition and location publishing based on unbalanced quadtree partition algorithm. IEEE Access 8(1):104775\u2013104787","journal-title":"IEEE Access"},{"issue":"3","key":"922_CR5","doi-asserted-by":"publisher","first-page":"420","DOI":"10.3390\/electronics9030420","volume":"9","author":"Y Yan","year":"2020","unstructured":"Yan Y, Wang BQ, Quan Z, Sheng Adnan M, Feng T, Xie PS (2020) Modelling the publishing process of big location data using deep learning prediction methods. Electronics 9(3):420","journal-title":"Electronics"},{"key":"922_CR6","doi-asserted-by":"publisher","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 Fuzziness Knowl Based Syst 10:557\u2013570","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"key":"922_CR7","doi-asserted-by":"crossref","unstructured":"Meyerson A, Williams R (2004) On the complexity of optimal K-anonymity. In: Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (PODS \u201904). Paris, France, pp 223\u2013228","DOI":"10.1145\/1055558.1055591"},{"key":"922_CR8","doi-asserted-by":"crossref","unstructured":"Samarati P, Sweeney L (1998) Generalizing data to provide anonymity when disclosing information. In: Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (PODS \u201998). Seattle, WA, USA, p 188","DOI":"10.1145\/275487.275508"},{"key":"922_CR9","doi-asserted-by":"crossref","unstructured":"Byun JW, Kamra S, Bertino E, Li N (2007) Efficient k-anonymization using clustering techniques. In: Proceedings of the 12th international conference on database systems for advanced applications (DASFAA\u201907). Bangkok, Thailand, pp 188\u2013200","DOI":"10.1007\/978-3-540-71703-4_18"},{"key":"922_CR10","doi-asserted-by":"crossref","unstructured":"Lin J, MengCheng W (2008) An efficient clustering method for k-anonymization. In: Proceedings of the 11th international conference on extending database technology. Nantes, France, pp 46\u201350","DOI":"10.1145\/1379287.1379297"},{"key":"922_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/1233321.1233324","volume":"8","author":"J Xu","year":"2006","unstructured":"Xu J, Wang W, Pei J, Wang X, Shi B, Fu AWC (2006) Utility-based anonymization for privacy preservation with less information loss. ACM SIGKDD Explor Newsl 8:26\u201330","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"922_CR12","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1109\/TDSC.2016.2604383","volume":"15","author":"H Li","year":"2018","unstructured":"Li H, Zhu H, Du S, Liang X, Shen X (2018) Privacy leakage of location sharing in mobile social networks: attacks and defense. IEEE Trans Depend Secur Comput 15:646\u2013660","journal-title":"IEEE Trans Depend Secur Comput"},{"key":"922_CR13","unstructured":"Ren XM (2012) Research for privacy protection method based on K-anonymity. Harbin Engineering University (Master thesis)"},{"key":"922_CR14","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/TST.2015.7128936","volume":"20","author":"QH Liu","year":"2015","unstructured":"Liu QH, Shen H, Sang Yp (2015) Privacy preserving data publishing for multiple numerical sensitive attributes. Tsinghua Sci Technol 20:246\u2013254","journal-title":"Tsinghua Sci Technol"},{"key":"922_CR15","first-page":"63","volume":"32","author":"PR Bhaladhare","year":"2016","unstructured":"Bhaladhare PR, Jinwala DC (2016) Novel approaches for privacy preserving data mining in K-anonymity model. Inf Sci Eng 32:63\u201378","journal-title":"Inf Sci Eng"},{"key":"922_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.ins.2016.10.038","volume":"378","author":"Y Xin","year":"2017","unstructured":"Xin Y, Xie ZQ, Yang J (2017) The privacy preserving method for dynamic trajectory releasing based on adaptive clustering. Inf Sci 378:131\u2013143","journal-title":"Inf Sci"},{"key":"922_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3125622","volume":"18","author":"B Palanisamy","year":"2018","unstructured":"Palanisamy B, Liu L, Zhou Y, Wang Q (2018) Privacy-preserving publishing of multilevel utility-controlled graph datasets. ACM Trans Internet Technol 18:1\u201321","journal-title":"ACM Trans Internet Technol"},{"key":"922_CR18","first-page":"1","volume":"2018","author":"F Liu","year":"2018","unstructured":"Liu F, Li T (2018) A clustering K-anonymity privacy-preserving method for wearable IoT devices. Secur Commun Netw 2018:1\u20138","journal-title":"Secur Commun Netw"},{"key":"922_CR19","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/1541880.1541882","volume":"41","author":"V Chandola","year":"2009","unstructured":"Chandola V, Banerjee A, Kumar V (2009) Anomaly detection: a survey. ACM Comput Surv 41:58","journal-title":"ACM Comput Surv"},{"key":"922_CR20","first-page":"563","volume-title":"Introduction to data mining","author":"PN Tan","year":"2019","unstructured":"Tan PN, Steinbach M, Karpatne A, Kumar V (2019) Introduction to data mining, 2nd edn. Pearson, Boston, pp 563\u2013565","edition":"2"},{"key":"922_CR21","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/335191.335388","volume":"29","author":"MM Breunig","year":"2000","unstructured":"Breunig MM, Kriegel HP, Ng RT, Sander J (2000) LOF: identifying density-based local outliers. ACM SIGMOD Rec 29:93\u2013104","journal-title":"ACM SIGMOD Rec"},{"key":"922_CR22","unstructured":"Meyerson A, Williams R (2016) The non-uniform k-center problem. In: Proceedings of the 43rd international colloquium on automata languages and programming (ICALP 2016). Rome, Italy, pp 223\u2013228"},{"key":"922_CR23","doi-asserted-by":"crossref","unstructured":"Gupta S, Kumar R, Lu K, Moseley B, Vassilvitskii S (2017) Local search methods for k-means with outliers. In: Processing of the VLDB endowment. pp 757\u2013768","DOI":"10.14778\/3067421.3067425"},{"key":"922_CR24","doi-asserted-by":"crossref","unstructured":"Huang L, Jiang S, Li J, Wu X (2018) Epsilon-coresets for clustering (with outliers) in doubling metrics. In: Proceedings of the 2018 IEEE 59th annual symposium on foundations of computer science (FOCS). pp 814\u2013825","DOI":"10.1109\/FOCS.2018.00082"},{"key":"922_CR25","doi-asserted-by":"crossref","unstructured":"Ceccarello M, Pietracaprina A, Pucci G (2019) Solving k-center clustering (with outliers) in mapreduce and streaming, almost as accurately as sequentially. In: Processing of the VLDB endowment. pp 766\u2013778","DOI":"10.14778\/3317315.3317319"},{"key":"922_CR26","doi-asserted-by":"crossref","unstructured":"Guha S, Li Y, Zhang Q (2017) Distributed partial clustering. In: Proceedings of the 29th ACM symposium on parallelism in algorithms and architectures (SPAA\u201917). Washington DC, USA, pp 143\u2013152","DOI":"10.1145\/3087556.3087568"},{"key":"922_CR27","unstructured":"Li S, Guo X (2018) Distributed k-clustering for data with heavy noise. In: Proceedings of the 32nd international conference on neural information processing systems (NIPS\u201918). Montr\u00e9al, Canada, pp 7849\u20137857"},{"key":"922_CR28","unstructured":"Malkomes G, Kusner MJ, Chen W, Weinberger KQ, Moseley B (2015) Fast distributed k-center clustering with outliers on massive data. In: Proceedings of the 28th international conference on neural information processing systems (NIPS\u201915). pp 1063\u20131071"},{"key":"922_CR29","unstructured":"Koufakou A, Ortiz EG, Georgiopoulos M, Anagnostopoulos GC, Reynolds KM (2017) A Scalable and Efficient Outlier Strategy for Categorical Data. In: Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp 210\u2013217"},{"key":"922_CR30","unstructured":"Meltzer M (2015) Outlier detection in datasets with mixed-attributes. Vrije University (Master thesis)"},{"key":"922_CR31","volume-title":"Learning to rank for information retrieval and natural language processing","author":"Hang Li","year":"2015","unstructured":"Li Hang (2015) Learning to rank for information retrieval and natural language processing, 2nd edn. Morgan & Claypool, San Rafael","edition":"2"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00922-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-021-00922-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00922-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T04:06:53Z","timestamp":1632283613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-021-00922-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,20]]},"references-count":31,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["922"],"URL":"https:\/\/doi.org\/10.1007\/s00607-021-00922-0","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,20]]},"assertion":[{"value":"12 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}