{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:58:40Z","timestamp":1774540720327,"version":"3.50.1"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T00:00:00Z","timestamp":1442188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"TUBITAK","award":["113E262"],"award-info":[{"award-number":["113E262"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10462-015-9439-5","type":"journal-article","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T14:19:39Z","timestamp":1442240379000},"page":"547-569","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["A survey: deriving private information from perturbed data"],"prefix":"10.1007","volume":"44","author":[{"given":"Burcu D.","family":"Okkalioglu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murat","family":"Okkalioglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet","family":"Koc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huseyin","family":"Polat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,14]]},"reference":[{"key":"9439_CR1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-0-387-70992-5_6","volume-title":"Privacy-preserving data mining: models and algorithms","author":"CC Aggarwal","year":"2008","unstructured":"Aggarwal CC, Yu PS (2008) A survey of randomization methods for privacy preserving data mining. In: Aggarwal CC, Yu PS (eds) Privacy-preserving data mining: models and algorithms. Springer, New York, pp 137\u2013156"},{"key":"9439_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal D, Aggarwal CC (2001) On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems. Santa Barbara, pp 247\u2013255","DOI":"10.1145\/375551.375602"},{"key":"9439_CR3","unstructured":"Agrawal R, Ghosh SP, Imielinski T, Iyer BR, Swami A (1992) An interval classifier for database mining applications. In: Proceedings of the 18th international conference on very large databases. Vancouver, British Columbia, pp 560\u2013573"},{"key":"9439_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data. Dallas, pp 439\u2013450","DOI":"10.1145\/342009.335438"},{"key":"9439_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal S, Haritsa JR (2005) A framework for high-accuracy privacy-preserving mining. In: Proceedings of 21st international conference on data engineering. Los Alamitos, pp 193\u2013204","DOI":"10.1109\/ICDE.2005.8"},{"key":"9439_CR6","doi-asserted-by":"crossref","unstructured":"Alaggan M, Gambs S, Kermarrec A-M (2012) BLIP: non-interactive differentially-private similarity computation on bloom filters. Lecture notes in computer science, vol 7596. pp 202\u2013216. doi: 10.1007\/978-3-642-33536-5_20","DOI":"10.1007\/978-3-642-33536-5_20"},{"issue":"1","key":"9439_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.dss.2006.08.007","volume":"43","author":"A Amiri","year":"2007","unstructured":"Amiri A (2007) Dare to share: protecting sensitive knowledge with data sanitization. Decis Support Syst 43(1):181\u2013191. doi: 10.1016\/j.dss.2006.08.007","journal-title":"Decis Support Syst"},{"key":"9439_CR8","unstructured":"Atallah M, Elmagarmid A, Ibrahim M, Bertino E, Verykios V (1999) Disclosure limitation of sensitive rules. In: Proceedings of the 1999 workshop on knowledge and data engineering exchange. Chicago, pp 45\u201352"},{"key":"9439_CR9","unstructured":"Bache K, Lichman M (2013) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml . Accessed 22 Sept 2013"},{"key":"9439_CR10","doi-asserted-by":"crossref","unstructured":"Balu R, Furon T, Gambs S (2014) Challenging differential privacy: The case of non-interactive mechanisms. Lecture notes in computer science, vol 8713. pp 146\u2013164. doi: 10.1007\/978-3-319-11212-1_9","DOI":"10.1007\/978-3-319-11212-1_9"},{"key":"9439_CR11","doi-asserted-by":"crossref","unstructured":"Calandrino JA, Kilzer A, Narayanan A, Felten EW, Shmatikov V (2011) You might also like: privacy risks of collaborative filtering. In: Proceedings of the 2011 IEEE symposium on security and privacy. Berkeley, pp 231\u2013246","DOI":"10.1109\/SP.2011.40"},{"key":"9439_CR12","doi-asserted-by":"crossref","unstructured":"Canny J (2002) Collaborative filtering with privacy via factor analysis. In: Proceedings of the 25th annual international ACM SIGIR conference on research and development in information retrieval. Tampere, pp 238\u2013245","DOI":"10.1145\/564376.564419"},{"key":"9439_CR13","unstructured":"Chen K, Liu L (2005) Privacy preserving data classification with rotation perturbation. In: Proceedings of the 5th IEEE international conference on data mining. Houston, pp 589\u2013592"},{"key":"9439_CR14","doi-asserted-by":"crossref","unstructured":"Chen K, Sun G, Liu L (2007) Towards attack-resilient geometric data perturbation. In: Proceedings of the 2007 SIAM international conference on data mining. Minneapolis, pp 78\u201389","DOI":"10.1137\/1.9781611972771.8"},{"key":"9439_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-0-387-70992-5_7","volume-title":"Privacy-preserving data mining: models and algorithms","author":"K Chen","year":"2008","unstructured":"Chen K, Liu L (2008) A survey of multiplicative perturbation for privacy preserving data mining. In: Aggarwal CC, Yu PS (eds) Privacy-preserving data mining: models and algorithms. Springer, New York, pp 157\u2013181"},{"key":"9439_CR16","doi-asserted-by":"crossref","unstructured":"Domingo-Ferrer J, Seb\u00e9 F, Castell\u00e0-Roca J (2004) On the security of noise addition for privacy in statistical databases. Lecture notes in computer science, vol 3050. pp 149\u2013161. doi: 10.1007\/978-3-540-25955-8_12","DOI":"10.1007\/978-3-540-25955-8_12"},{"key":"9439_CR17","doi-asserted-by":"crossref","unstructured":"Du W, Zhan Z (2003) Using randomized response techniques for privacy-preserving data mining. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining. Washington, pp 505\u2013510","DOI":"10.1145\/956750.956810"},{"key":"9439_CR18","doi-asserted-by":"crossref","unstructured":"Evfimievski A, Srikant R, Agrawal R, Gehrke J (2002) Privacy preserving mining of association rules. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining. Edmonton, pp 217\u2013228","DOI":"10.1145\/775047.775080"},{"key":"9439_CR19","doi-asserted-by":"crossref","unstructured":"Evfimievski A, Gehrke J, Srikant R (2003) Limiting privacy breaches in privacy preserving data mining. In: Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems. San Diego, pp 211\u2013222","DOI":"10.1145\/773153.773174"},{"key":"9439_CR20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.datak.2012.10.004","volume":"83","author":"CR Giannella","year":"2013","unstructured":"Giannella CR, Liu K, Kargupta H (2013) Breaching Euclidean distance-preserving data perturbation using few known inputs. Data Knowl Eng 83:93\u2013110. doi: 10.1016\/j.datak.2012.10.004","journal-title":"Data Knowl Eng"},{"key":"9439_CR21","first-page":"185","volume":"2","author":"L Guo","year":"2009","unstructured":"Guo L, Wu X (2009) Privacy preserving categorical data analysis with unknown distortion parameters. Trans Data Priv 2:185\u2013205","journal-title":"Trans Data Priv"},{"key":"9439_CR22","doi-asserted-by":"crossref","unstructured":"Guo S, Wu X (2006a) On the use of spectral filtering for privacy preserving data mining. In: Proceedings of the 21st annual ACM symposium on applied computing. Dijon, pp 622\u2013626","DOI":"10.1145\/1141277.1141418"},{"key":"9439_CR23","unstructured":"Guo S, Wu X (2006b) Deriving private information from general linear transformation perturbed data. Technical report, The University of North Carolina at Charlotte, Charlotte"},{"key":"9439_CR24","doi-asserted-by":"crossref","unstructured":"Guo S, Wu X, Li Y (2006a) Deriving private information from perturbed data using IQR based approach. In: Proceedings of the 22nd international conference on data engineering workshops. Atlanta, pp 92\u2013101","DOI":"10.1109\/ICDEW.2006.47"},{"key":"9439_CR25","doi-asserted-by":"crossref","unstructured":"Guo S, Wu X, Li Y (2006b) On the lower bound of reconstruction error for spectral filtering based privacy preserving data mining. Lecture notes in computer science, vol 4213. pp 520\u2013527. doi: 10.1007\/11871637_51","DOI":"10.1007\/11871637_51"},{"key":"9439_CR26","unstructured":"Guo S (2007) Analysis of and techniques for privacy preserving data mining. Dissertation, University of North Carolina at Charlotte"},{"key":"9439_CR27","doi-asserted-by":"crossref","unstructured":"Guo S, Wu X (2007) Deriving private information from arbitrarily projected data. Lecture notes in computer science, vol 4426. pp 84\u201395. doi: 10.1007\/978-3-540-71701-0_11","DOI":"10.1007\/978-3-540-71701-0_11"},{"issue":"2","key":"9439_CR28","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10115-008-0123-9","volume":"17","author":"S Guo","year":"2008","unstructured":"Guo S, Wu X, Li Y (2008) Determining error bounds for spectral filtering based reconstruction methods in privacy preserving data mining. Knowl Inf Syst 17(2):217\u2013240. doi: 10.1007\/s10115-008-0123-9","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"9439_CR29","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/963770.963772","volume":"22","author":"JL Herlocker","year":"2004","unstructured":"Herlocker JL, Konstan JA, Terveen LG, Riedl JT (2004) Evaluating collaborative filtering recommender systems. ACM Trans Inform Syst 22(1):5\u201353. doi: 10.1145\/963770.963772","journal-title":"ACM Trans Inform Syst"},{"key":"9439_CR30","doi-asserted-by":"crossref","unstructured":"Huang Z, Du W, Chen B (2005) Deriving private information from randomized data. In: Proceedings of the 2005 ACM SIGMOD international conference on management of data. Baltimore, pp 37\u201348","DOI":"10.1145\/1066157.1066163"},{"key":"9439_CR31","doi-asserted-by":"crossref","unstructured":"Huang Z, Du W (2008) OptRR: optimizing randomized response schemes for privacy-preserving data mining. In: Proceedings of the 2008 IEEE 24th international conference on data engineering. Cancun, pp 705\u2013714","DOI":"10.1109\/ICDE.2008.4497479"},{"key":"9439_CR32","doi-asserted-by":"crossref","DOI":"10.1002\/0471221317","volume-title":"Independent component analysis","author":"A Hyv\u00e4rinen","year":"2001","unstructured":"Hyv\u00e4rinen A, Karhunen J, Oja E (2001) Independent component analysis. Wiley, New York"},{"key":"9439_CR33","doi-asserted-by":"crossref","unstructured":"Iyengar VS (2002) Transforming data to satisfy privacy constraints. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining. Edmonton, pp 279\u2013288","DOI":"10.1145\/775047.775089"},{"key":"9439_CR34","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"WB Johnson","year":"1984","unstructured":"Johnson WB, Lindenstrauss J (1984) Extension of Lipshitz mappings into Hilbert space. Contemp Math 26:189\u2013206. doi: 10.1090\/conm\/026\/737400","journal-title":"Contemp Math"},{"issue":"7","key":"9439_CR35","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.datak.2010.02.008","volume":"69","author":"E Kaplan","year":"2010","unstructured":"Kaplan E, Pedersen TB, Savas E, Saygin Y (2010) Discovering private trajectories using background information. Data Knowl Eng 69(7):723\u2013736. doi: 10.1016\/j.datak.2010.02.008","journal-title":"Data Knowl Eng"},{"key":"9439_CR36","doi-asserted-by":"crossref","unstructured":"Kargupta H, Datta S, Wang Q, Sivakumar K (2003a) On the privacy preserving properties of random data perturbation techniques. In: Proceedings of the 3rd IEEE international conference on data mining. Melbourne, pp 99\u2013106","DOI":"10.1109\/ICDM.2003.1250908"},{"key":"9439_CR37","unstructured":"Kargupta H, Dutta H, Datta S, Sivakumar K (2003) Analysis of privacy preserving random perturbation techniques: further explorations. In: Proceedings of the 2003 ACM workshop on privacy in the electronic society. Washington, pp 31\u201338"},{"issue":"4","key":"9439_CR38","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10115-004-0173-6","volume":"7","author":"H Kargupta","year":"2005","unstructured":"Kargupta H, Datta S, Wang Q, Sivakumar K (2005) Random-data perturbation techniques and privacy-preserving data mining. Knowl Inf Syst 7(4):387\u2013414. doi: 10.1007\/s10115-004-0173-6","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"9439_CR39","first-page":"39","volume":"5","author":"K Kenthapadi","year":"2013","unstructured":"Kenthapadi K, Korolova A, Mironov I, Mishra N (2013) Privacy via the Johnson\u2013Lindenstrauss transform. J Priv Confid 5(1):39\u201371","journal-title":"J Priv Confid"},{"issue":"1","key":"9439_CR40","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback S, Leibler RA (1951) On information and sufficiency. Ann Math Stat 22(1):79\u201386. doi: 10.1214\/aoms\/1177729694","journal-title":"Ann Math Stat"},{"issue":"1","key":"9439_CR41","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TKDE.2006.14","volume":"18","author":"K Liu","year":"2006","unstructured":"Liu K, Kargupta H, Ryan J (2006) Random projection-based multiplicative data perturbation for privacy preserving distributed data mining. IEEE Tran Knowl Data Eng 18(1):92\u2013106. doi: 10.1109\/TKDE.2006.14","journal-title":"IEEE Tran Knowl Data Eng"},{"key":"9439_CR42","doi-asserted-by":"crossref","unstructured":"Liu K, Giannella C, Kargupta H (2006b) An attacker\u2019s view of distance preserving maps for privacy preserving data mining. Lecture notes in computer science, vol 4213. pp 297\u2013308. doi: 10.1007\/11871637_30","DOI":"10.1007\/11871637_30"},{"key":"9439_CR43","unstructured":"Liu K (2007) Multiplicative data perturbation for privacy preserving data mining. Dissertation, University of Maryland, Baltimore County"},{"key":"9439_CR44","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-0-387-70992-5_15","volume-title":"Privacy-preserving data mining: models and algorithms","author":"K Liu","year":"2008","unstructured":"Liu K, Giannella C, Kargupta H (2008a) A survey of attack techniques on privacy-preserving data perturbation methods. In: Aggarwal CC, Yu PS (eds) Privacy-preserving data mining: models and algorithms. Springer, New York, pp 359\u2013381"},{"key":"9439_CR45","unstructured":"Liu L, Wang J, Zhang J (2008b) Privacy vulnerabilities with background information in data perturbation. Technical report. Department of Computer Science, University of Kentucky"},{"issue":"2","key":"9439_CR46","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.datak.2008.03.004","volume":"66","author":"S Mukherjee","year":"2008","unstructured":"Mukherjee S, Banerjee S, Chen Z, Gangopadhyay A (2008) A privacy preserving technique for distance-based classification with worst case privacy guarantees. Data Knowl Eng 66(2):264\u2013268. doi: 10.1016\/j.datak.2008.03.004","journal-title":"Data Knowl Eng"},{"issue":"10","key":"9439_CR47","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1287\/mnsc.45.10.1399","volume":"45","author":"K Muralidhar","year":"1999","unstructured":"Muralidhar K, Parsa R, Sarathy R (1999) A general additive data perturbation method for database security. Manage Sci 45(10):1399\u20131415. doi: 10.1287\/mnsc.45.10.1399","journal-title":"Manage Sci"},{"key":"9439_CR48","unstructured":"Oliveira SRM, Za\u00efane OR (2002) Privacy preserving frequent itemset mining. In: Proceedings of the IEEE international conference on privacy. Security and data mining. Maebashi City, pp 43\u201354"},{"key":"9439_CR49","doi-asserted-by":"crossref","unstructured":"Oliveira SRM, Za\u00efane OR (2003a) Protecting sensitive knowledge by data sanitization. In: Proceedings of the 3rd IEEE international conference on data mining. Melbourne, pp 613\u2013616","DOI":"10.1109\/ICDM.2003.1250990"},{"key":"9439_CR50","unstructured":"Oliveira SRM, Za\u00efane OR (2003b) Privacy preserving clustering by data transformation. In: Proceedings of the 18th Brazilian symposium on databases. Manaus, pp 304\u2013318"},{"key":"9439_CR51","doi-asserted-by":"crossref","unstructured":"Polat H, Du W (2003) Privacy-preserving collaborative filtering using randomized perturbation techniques. In: Proceedings of the 3rd IEEE international conference on data mining. Melbourne, pp 625\u2013628","DOI":"10.1109\/ICDM.2003.1250993"},{"key":"9439_CR52","doi-asserted-by":"crossref","unstructured":"Polat H, Du W (2005) SVD-based collaborative filtering with privacy. In: Proceedings of the 21st annual ACM symposium on applied computing. Dijon, pp 791\u2013795","DOI":"10.1145\/1066677.1066860"},{"key":"9439_CR53","doi-asserted-by":"crossref","unstructured":"Polat H, Du W (2006) Achieving private recommendations using randomized response techniques. Lecture notes in computer science, vol 3918. pp 637\u2013646. doi: 10.1007\/11731139_73","DOI":"10.1007\/11731139_73"},{"key":"9439_CR54","doi-asserted-by":"crossref","unstructured":"Rizvi SJ, Haritsa JR (2002) Maintaining data privacy in association rule mining. Proceedings of the 28th international conference on very large data bases. Hong Kong, pp 682\u2013693","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"9439_CR55","doi-asserted-by":"crossref","unstructured":"Sang Y, Shen H, Tian H (2009) Reconstructing data perturbed by random projections when the mixing matrix is known. Lecture notes in computer science, vol 5782. pp 334\u2013349. doi: 10.1007\/978-3-642-04174-7_22","DOI":"10.1007\/978-3-642-04174-7_22"},{"issue":"1","key":"9439_CR56","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.2011.83","volume":"61","author":"Y Sang","year":"2012","unstructured":"Sang Y, Shen H, Tian H (2012) Effective reconstruction of data perturbed by random projections. IEEE Trans Comput 61(1):101\u2013117. doi: 10.1109\/TC.2011.83","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"9439_CR57","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/604264.604271","volume":"30","author":"Y Saygin","year":"2001","unstructured":"Saygin Y, Verykios VS, Clifton C (2001) Using unknowns to prevent discovery of association rules. SIGMOD Rec 30(4):45\u201354. doi: 10.1145\/604264.604271","journal-title":"SIGMOD Rec"},{"key":"9439_CR58","doi-asserted-by":"crossref","unstructured":"Sramka M, Safavi-Naini R, Denzinger J (2009) An attack on the privacy of sanitized data that fuses the outputs of multiple data miners. In: Proceedings of the 9th IEEE international conference on data mining workshops. Miami, pp 130\u2013137","DOI":"10.1109\/ICDMW.2009.28"},{"key":"9439_CR59","doi-asserted-by":"crossref","unstructured":"Sramka M (2010) A privacy attack that removes the majority of the noise from perturbed data. In: Proceedings of the 2010 international joint conference on neural networks. Barcelona, pp 1\u20138","DOI":"10.1109\/IJCNN.2010.5596527"},{"key":"9439_CR60","doi-asserted-by":"crossref","unstructured":"Sramka M, Safavi-Naini R, Denzinger J, Askari M (2010) A practice-oriented framework for measuring privacy and utility in data sanitization systems. In: Proceedings of the 12th international conference on extending database technology workshops. Lausanne","DOI":"10.1145\/1754239.1754270"},{"key":"9439_CR61","doi-asserted-by":"crossref","unstructured":"Sramka M (2012) Breaching privacy using data mining: removing noise from perturbed data. Stud Comput Intell 394:135\u2013157. doi: 10.1007\/978-3-642-25237-2_9","DOI":"10.1007\/978-3-642-25237-2_9"},{"key":"9439_CR62","volume-title":"Matrix perturbation theory","author":"GW Stewart","year":"1990","unstructured":"Stewart GW, Sun J (1990) Matrix perturbation theory. Academic Press, Waltham"},{"key":"9439_CR63","first-page":"1","volume":"5","author":"GJ Sz\u00e9kely","year":"2004","unstructured":"Sz\u00e9kely GJ, Rizzo ML (2004) Testing for equal distributions in high dimension. InterStat 5:1\u20136","journal-title":"InterStat"},{"key":"9439_CR64","doi-asserted-by":"crossref","unstructured":"Turgay EO, Pedersen TB, Saygin Y, Savas E, Levi A (2008) Disclosure risks of distance preserving data transformations. Lecture notes in computer science, vol 5069. pp 79\u201394. doi: 10.1007\/978-3-540-69497-7_8","DOI":"10.1007\/978-3-540-69497-7_8"},{"issue":"309","key":"9439_CR65","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","volume":"60","author":"SL Warner","year":"1965","unstructured":"Warner SL (1965) Randomized response: a survey technique for eliminating evasive answer bias. J Am Stat Assoc 60(309):63\u201369. doi: 10.1080\/01621459.1965.10480775","journal-title":"J Am Stat Assoc"},{"key":"9439_CR66","doi-asserted-by":"crossref","unstructured":"Zhang S, Ford J, Makedon F (2006) Deriving private information from randomly perturbed ratings. In: Proceedings of the 6th SIAM international conference on data mining. Bethesda, pp 59\u201369","DOI":"10.1137\/1.9781611972764.6"},{"issue":"8","key":"9439_CR67","first-page":"3465","volume":"10","author":"J Zhao","year":"2014","unstructured":"Zhao J, Yang J, Zhang J (2014) Privacy properties of random projection perturbation when random matrix is leaking. J Comput Inf Syst 10(8):3465\u20133472","journal-title":"J Comput Inf Syst"},{"key":"9439_CR68","doi-asserted-by":"crossref","unstructured":"Zhu Z, Wang G, Du W (2009) Deriving private information from association rule mining results. In: Proceedings of the 25th international conference on data engineering. Shanghai, pp 18\u201329","DOI":"10.1109\/ICDE.2009.97"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-015-9439-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-015-9439-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-015-9439-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T16:37:02Z","timestamp":1748623022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-015-9439-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,14]]},"references-count":68,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9439"],"URL":"https:\/\/doi.org\/10.1007\/s10462-015-9439-5","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,14]]}}}