{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T04:11:17Z","timestamp":1685419877834},"reference-count":0,"publisher":"National Library of Serbia","issue":"4","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2015]]},"abstract":"<jats:p>In privacy preserving data publishing, to reduce the correlation loss between\n   sensitive attribute (SA) and non-sensitive attributes(NSAs) caused by\n   anonymization methods (such as generalization, anatomy, slicing and\n   randomization, etc.), the records with same NSAs values should be divided\n   into same blocks to meet the anonymizing demands of ?-diversity. However,\n   there are often many blocks (of the initial partition), in which there are\n   more than ? records with different SA values, and the frequencies of\n   different SA values are uneven. Therefore, anonymization on the initial\n   partition causes more correlation loss. To reduce the correlation loss as far\n   as possible, in this paper, an optimizing model is first proposed. Then\n   according to the optimizing model, the refining partition of the initial\n   partition is generated, and anonymization is applied on the refining\n   partition. Although anonymization on refining partition can be used on top of\n   any existing partitioning method to reduce the correlation loss, we\n   demonstrate that a new partitioning method tailored for refining partition\n   could further improve data utility. An experimental evaluation shows that our\n   approach could efficiently reduce correlation loss.<\/jats:p>","DOI":"10.2298\/csis141212052z","type":"journal-article","created":{"date-parts":[[2015,11,2]],"date-time":"2015-11-02T16:39:25Z","timestamp":1446482365000},"page":"1193-1216","source":"Crossref","is-referenced-by-count":1,"title":["Anonymization on refining partition: Same privacy, more utility"],"prefix":"10.2298","volume":"12","author":[{"given":"Hong","family":"Zhu","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology Wuhan, School of Computer Science and Technology, Hubei, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengli","family":"Tian","sequence":"additional","affiliation":[{"name":"Xuchang University Xuchang, School of Information Engineering, Henan, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Genyuan","family":"Du","sequence":"additional","affiliation":[{"name":"Xuchang University Xuchang, School of Information Engineering, Henan, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meiyi","family":"Xie","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology Wuhan, School of Computer Science and Technology, Hubei, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:32:38Z","timestamp":1685349158000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141500052Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.2298\/csis141212052z","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}