{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:21:37Z","timestamp":1730208097003,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/cit.2008.4594650","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T18:40:13Z","timestamp":1218652813000},"page":"59-64","source":"Crossref","is-referenced-by-count":1,"title":["(p<sup>+<\/sup>, α)-sensitive k-anonymity: A new enhanced privacy protection model"],"prefix":"10.1109","author":[{"family":"Xiaoxun Sun","sequence":"first","affiliation":[]},{"family":"Hua Wang","sequence":"additional","affiliation":[]},{"family":"Jiuyong Li","sequence":"additional","affiliation":[]},{"given":"Traian Marius","family":"Truta","sequence":"additional","affiliation":[]},{"family":"Ping Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"0","key":"19"},{"key":"17","first-page":"249","article-title":"bottom-up generalization: a data mining solution to privacy protection","author":"wang","year":"0","journal-title":"Fourth IEEE International Conference on Data Mining (ICDM'04)"},{"key":"18","first-page":"467","article-title":"advanced methods for record linkage","author":"winkler","year":"0","journal-title":"Proceedings of the Section on Survey Research Methods"},{"key":"15","article-title":"privacy protection: p-sensitive k-anonymity property","author":"traian","year":"2006","journal-title":"International Workshop of Privacy Data Management (PDM2006) In Conjunction with 22th International Conference of Data Engineering (ICDE)"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75248-6_9"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1142\/S021848850200165X"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"11","first-page":"101","article-title":"an efficient hashbased algorithm for minimal k-anonymity problem","author":"sun","year":"0","journal-title":"31st Australasian Computer Science Conference (ACSC 2008)"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78849-2_30"},{"year":"0","key":"3"},{"year":"0","key":"2"},{"year":"0","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/69.971193"},{"year":"0","key":"7"},{"year":"0","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066164"},{"key":"4","first-page":"313","article-title":"measure of disclosure risk and harm","volume":"9","author":"lambert","year":"1993","journal-title":"Journal of Official Statistics"},{"journal-title":"UCI repository of machine learning databases","year":"1998","author":"newman","key":"9"},{"year":"0","key":"8"}],"event":{"name":"2008 8th IEEE International Conference on Computer and Information Technology (CIT)","start":{"date-parts":[[2008,7,8]]},"location":"Sydney, Australia","end":{"date-parts":[[2008,7,11]]}},"container-title":["2008 8th IEEE International Conference on Computer and Information Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4586225\/4594630\/04594650.pdf?arnumber=4594650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T11:20:42Z","timestamp":1489663242000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4594650\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/cit.2008.4594650","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}