{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:09:03Z","timestamp":1730207343824,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/cis.2010.93","type":"proceedings-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T20:42:33Z","timestamp":1295642553000},"page":"401-405","source":"Crossref","is-referenced-by-count":3,"title":["A Neural Network Clustering Based Algorithm for Privacy Preserving Data Mining"],"prefix":"10.1109","author":[{"given":"Stergios G.","family":"Tsiafoulis","sequence":"first","affiliation":[]},{"given":"Vasilis C.","family":"Zorkadis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Achieving k-anonymity privacy protection using generalization and suppression","year":"2002","author":"sweeney","key":"ref10"},{"key":"ref11","first-page":"116","article-title":"The Genitor Algorithm and Selective Pressure: Why rank-based allocation of reproductive trials is best","author":"whitley","year":"1989","journal-title":"Proceedings of Third International Conference on Genetic Algorithms"},{"key":"ref12","first-page":"139","article-title":"Anatomy: Simple and effective privacy preservation","author":"xiao","year":"2006","journal-title":"VLDB"},{"journal-title":"T-closeness Privacy beyond K-anonymity and L-diversity","year":"0","author":"li","key":"ref13"},{"journal-title":"UCI Machine Learning Repository","year":"0","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217302"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.42"},{"article-title":"utility-Based Anonymization Using Local Recoding","year":"2006","author":"jian xu","key":"ref5"},{"journal-title":"Search Through Systematic Set Enumeration","year":"1992","author":"rymon","key":"ref8"},{"journal-title":"Opus An Efficient Admissible Algorithm for Unordered Search","year":"1995","author":"webb","key":"ref7"},{"key":"ref2","first-page":"19","article-title":"BSGI An Effective Algorithm towards Stronger l-Diversity","author":"yu liu","year":"0","journal-title":"Applications table of contents Turin Italy 2008 (Data Privacy table of contents)"},{"key":"ref1","volume":"15","author":"verykios","year":"2009","journal-title":"An Overview of Privacy Preserving Data Mining"},{"journal-title":"Transforming Data to Satisfy Privacy Constrains","year":"2002","author":"iyengar","key":"ref9"}],"event":{"name":"2010 International Conference on Computational Intelligence and Security (CIS)","start":{"date-parts":[[2010,12,11]]},"location":"Nanning, Guangxi, TBD, China","end":{"date-parts":[[2010,12,14]]}},"container-title":["2010 International Conference on Computational Intelligence and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5692951\/5696218\/05696308.pdf?arnumber=5696308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T09:56:23Z","timestamp":1490090183000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5696308\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/cis.2010.93","relation":{},"subject":[],"published":{"date-parts":[[2010,12]]}}}