{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:49:39Z","timestamp":1778665779334,"version":"3.51.4"},"reference-count":31,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2018,12,12]]},"DOI":"10.3233\/ida-173589","type":"journal-article","created":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T12:41:09Z","timestamp":1545136869000},"page":"1415-1437","source":"Crossref","is-referenced-by-count":3,"title":["Probabilistic optimal projection partition KD-Tree k-anonymity for data publishing privacy protection"],"prefix":"10.1177","volume":"22","author":[{"given":"Xiaohan","family":"Wang","sequence":"first","affiliation":[{"name":"School of Geography and Tourism, Anhui Normal University, Wuhu, Anhui 241003, China"},{"name":"Anhui Provincial Key Laboratory of Network and Information Security, Anhui Normal University, Wuhu, Anhui 241003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonglong","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Geography and Tourism, Anhui Normal University, Wuhu, Anhui 241003, China"},{"name":"Anhui Provincial Key Laboratory of Network and Information Security, Anhui Normal University, Wuhu, Anhui 241003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yefeng","family":"Jiang","sequence":"additional","affiliation":[{"name":"Anhui Provincial Key Laboratory of Network and Information Security, Anhui Normal University, Wuhu, Anhui 241003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenli","family":"Wu","sequence":"additional","affiliation":[{"name":"Anhui Provincial Key Laboratory of Network and Information Security, Anhui Normal University, Wuhu, Anhui 241003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingying","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Geography and Tourism, Anhui Normal University, Wuhu, Anhui 241003, China"},{"name":"Anhui Provincial Key Laboratory of Network and Information Security, Anhui Normal University, Wuhu, Anhui 241003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-173589_ref1","doi-asserted-by":"crossref","first-page":"543","DOI":"10.3233\/IDA-160819","article-title":"Privacy preserving anonymization of social networks using eigenvector centrality approach","volume":"20","author":"Chakraborty","year":"2016","journal-title":"Intell. Data Anal"},{"key":"10.3233\/IDA-173589_ref2","doi-asserted-by":"crossref","first-page":"933","DOI":"10.3233\/IDA-2012-00560","article-title":"Effective sanitization approaches to hide sensitive utility and frequent itemsets","volume":"16","author":"Rajalaxmi","year":"2012","journal-title":"Intell. Data Anal"},{"key":"10.3233\/IDA-173589_ref3","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1186\/s40064-016-3095-3","article-title":"An efficient reversible privacy-preserving data mining technology over data streams","volume":"5","author":"Lin","year":"2016","journal-title":"Springer Plus"},{"key":"10.3233\/IDA-173589_ref4","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/TKDE.2010.236","article-title":"Slicing: A new approach for privacy preserving data publishing","volume":"24","author":"Li","year":"2012","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-173589_ref5","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.datak.2008.12.001","article-title":"Privacy-preserving data publishing for cluster analysis","volume":"68","author":"Fung","year":"2009","journal-title":"Data & Knowledge Engineering"},{"key":"10.3233\/IDA-173589_ref6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/1749603.1749605","article-title":"Privacy-preserving data publishing: a survey of recent developments","volume":"42","author":"Fung","year":"2010","journal-title":"ACM Computing Surveys"},{"key":"10.3233\/IDA-173589_ref7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.future.2016.10.022","article-title":"Privacy and utility preserving data clustering for data anonymization and distribution on Hadoop","volume":"74","author":"Nayahi","year":"2017","journal-title":"Future Generation Computer Systems-the International Journal of Escience"},{"key":"10.3233\/IDA-173589_ref8","first-page":"1749","article-title":"A framework for utility enhanced incomplete microdata anonymization","volume":"20","author":"Gong","year":"2017","journal-title":"Cluster Computing-the Journal of Networks Software Tools and Applications"},{"key":"10.3233\/IDA-173589_ref9","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.ins.2016.05.009","article-title":"A hybrid approach to prevent composition attacks for independent data releases","volume":"367","author":"Li","year":"2016","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-173589_ref10","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1142\/S021848850200165X","article-title":"Achieving k-anonymity privacy protection using generalization and suppression","volume":"10","author":"Sweeney","year":"2002","journal-title":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems"},{"key":"10.3233\/IDA-173589_ref11","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":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems"},{"key":"10.3233\/IDA-173589_ref12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1109\/TKDE.2005.32","article-title":"Preserving privacy by de-identifying face images","volume":"17","author":"Newton","year":"2005","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-173589_ref13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10115-010-0311-2","article-title":"The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks","volume":"28","author":"Zhou","year":"2011","journal-title":"Knowledge and Information Systems"},{"key":"10.3233\/IDA-173589_ref14","doi-asserted-by":"crossref","first-page":"1623","DOI":"10.1109\/TKDE.2009.190","article-title":"From t-closeness-like privacy to postrandomization via information theory","volume":"22","author":"Rebollo-Monedero","year":"2010","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-173589_ref15","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1109\/TKDE.2009.139","article-title":"Closeness: A new privacy measure for data publishing","volume":"22","author":"Li","year":"2010","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-173589_ref16","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.12785\/amis\/080321","article-title":"A survey of privacy preserving data publishing using generalization and suppression","volume":"8","author":"Xu","year":"2014","journal-title":"Applied Mathematics & Information Sciences"},{"key":"10.3233\/IDA-173589_ref17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.knosys.2016.10.012","article-title":"Anonymizing 1:M microdata with high utility","volume":"115","author":"Gong","year":"2017","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/IDA-173589_ref18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.knosys.2016.03.016","article-title":"Location privacy-preserving k nearest neighbor query under user\u2019s preference","volume":"103","author":"Ni","year":"2016","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/IDA-173589_ref19","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.2298\/CSIS141212052Z","article-title":"Anonymization on Refining Partition: Same Privacy, More Utility","volume":"12","author":"Zhu","year":"2015","journal-title":"Computer Science and Information Systems"},{"key":"10.3233\/IDA-173589_ref20","doi-asserted-by":"crossref","first-page":"2696","DOI":"10.1016\/j.ins.2010.03.011","article-title":"Privacy-preserving data mining: A feature set partitioning approach","volume":"180","author":"Matatov","year":"2010","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-173589_ref21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-015-0875-y","article-title":"Multi-view ensemble learning: an optimal feature set partitioning for high-dimensional data classification","volume":"49","author":"Kumar","year":"2016","journal-title":"Knowledge and Information Systems"},{"key":"10.3233\/IDA-173589_ref22","first-page":"2069","article-title":"Achieving high data utility k-anonymization using similarity-based clustering model","volume":"E99D","author":"Sonehara","year":"2016","journal-title":"IEICE Transactions on Information and Systems"},{"key":"10.3233\/IDA-173589_ref23","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.jbi.2014.06.002","article-title":"Publishing data from electronic health records while preserving privacy: A survey of algorithms","volume":"50","author":"Gkoulalas-Divanis","year":"2014","journal-title":"Journal of Biomedical Informatics"},{"key":"10.3233\/IDA-173589_ref24","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1016\/j.is.2010.06.002","article-title":"Approximate algorithms with generalizing attribute values for k-anonymity","volume":"35","author":"Park","year":"2010","journal-title":"Information Systems"},{"key":"10.3233\/IDA-173589_ref25","doi-asserted-by":"crossref","unstructured":"K. Lefevre, D.J. Dewitt, and R. Ramakrishnan, Mondrian Multidimensional K-Anonymity, in International Conference on Data Engineering, 2006, 25\u201325.","DOI":"10.1109\/ICDE.2006.101"},{"key":"10.3233\/IDA-173589_ref26","doi-asserted-by":"crossref","first-page":"2138","DOI":"10.3724\/SP.J.1001.2012.04157","article-title":"Algorithm for k-anonymity based on rounded partition function","volume":"23","author":"Wu","year":"2012","journal-title":"Journal of Software"},{"key":"10.3233\/IDA-173589_ref27","first-page":"125","article-title":"Algorithm for k-anonymity based on projection area density partition","volume":"36","author":"Wang","year":"2015","journal-title":"Journal on Communications"},{"key":"10.3233\/IDA-173589_ref28","first-page":"1050","article-title":"An optimal projection partition k-anonymity algorithm of KD-tree","volume":"52","author":"Wang","year":"2016","journal-title":"Journal of Nanjing University"},{"key":"10.3233\/IDA-173589_ref29","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.inffus.2011.03.001","article-title":"Kd-trees and the real disclosure risks of large statistical databases","volume":"13","author":"Herranz","year":"2012","journal-title":"Inf. Fusion"},{"key":"10.3233\/IDA-173589_ref30","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1111\/j.1467-8659.2007.01064.x","article-title":"Stackless KD-Tree traversal for high performance GPU ray tracing","volume":"26","author":"Popov","year":"2007","journal-title":"Comput. Graph. Forum"},{"key":"10.3233\/IDA-173589_ref31","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1016\/j.patrec.2007.01.001","article-title":"A method for initialising the K-means clustering algorithm using kd-trees","volume":"28","author":"Redmond","year":"2007","journal-title":"Pattern Recognit. Lett."}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-173589","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:18:13Z","timestamp":1777454293000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-173589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,12]]},"references-count":31,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/ida-173589","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,12]]}}}