{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:03Z","timestamp":1740122403565,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T00:00:00Z","timestamp":1681603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T00:00:00Z","timestamp":1681603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Regional Council of Pohjois-Savo","award":["A74608"],"award-info":[{"award-number":["A74608"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Differential privacy provides a strong form of privacy and allows preserving most of the original characteristics of the dataset. Utilizing these benefits requires one to design specific differentially private data analysis algorithms. In this work, we present three tree-based algorithms for mining redescriptions while preserving differential privacy. Redescription mining is an exploratory data analysis method for finding connections between two views over the same entities, such as phenotypes and genotypes of medical patients, for example. It has applications in many fields, including some, like health care informatics, where privacy-preserving access to data is desired. Our algorithms are the first tree-based differentially private redescription mining algorithms, and we show via experiments that, despite the inherent noise in differential privacy, it can return trustworthy results even in smaller datasets where noise typically has a stronger effect.<\/jats:p>","DOI":"10.1007\/s10618-023-00934-8","type":"journal-article","created":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T13:01:51Z","timestamp":1681650111000},"page":"1548-1590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Differentially private tree-based redescription mining"],"prefix":"10.1007","volume":"37","author":[{"given":"Matej","family":"Mihel\u010di\u0107","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2271-316X","authenticated-orcid":false,"given":"Pauli","family":"Miettinen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,16]]},"reference":[{"key":"934_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal D, Aggarwal CC (2001) On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (PODS), pp 247\u2013255. https:\/\/doi.org\/10.1145\/375551.375602","DOI":"10.1145\/375551.375602"},{"issue":"082","key":"934_CR2","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s11432-016-0442-1","volume":"60","author":"X Bai","year":"2017","unstructured":"Bai X, Yao J, Yuan M et al (2017) Embedding differential privacy in decision tree algorithm with different depths. Sci China Inf Sci 60(082):104. https:\/\/doi.org\/10.1007\/s11432-016-0442-1","journal-title":"Sci China Inf Sci"},{"key":"934_CR3","doi-asserted-by":"publisher","unstructured":"Balu R, Furon T (2016) Differentially private matrix factorization using sketching techniques. In: Proceedings of the ACM workshop on information hiding and multimedia security (IH &MMSec), pp 57\u201362. https:\/\/doi.org\/10.1145\/2909827.2930793","DOI":"10.1145\/2909827.2930793"},{"key":"934_CR4","doi-asserted-by":"publisher","unstructured":"Berlioz A, Friedman A, Kaafar MA et\u00a0al (2015) Applying differential privacy to matrix factorization. In: Proceedings of the ACM conference on recommender systems (RecSys), pp 107\u2013114. https:\/\/doi.org\/10.1145\/2792838.2800173","DOI":"10.1145\/2792838.2800173"},{"key":"934_CR5","doi-asserted-by":"publisher","unstructured":"Blum A, Dwork C, McSherry F et al (2005) Practical privacy: the SuLQ framework. In: Proceedings of the ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (PODS), pp 128\u2013138. https:\/\/doi.org\/10.1145\/1065167.1065184","DOI":"10.1145\/1065167.1065184"},{"key":"934_CR6","unstructured":"Ding B, Kulkarni J, Yekhanin S (2017) Collecting telemetry data privately. In: Proceedings of the advances in neural information processing systems (NIPS), pp 3571\u20133580. https:\/\/proceedings.neurips.cc\/paper\/2017\/file\/253614bbac999b38b5b60cae531c4969-Paper.pdf"},{"issue":"3\u20134","key":"934_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork C, Roth A (2014) The algorithmic foundations of differential privacy. Found Trends Theor Comput Sci 9(3\u20134):211\u2013407. https:\/\/doi.org\/10.1561\/0400000042","journal-title":"Found Trends Theor Comput Sci"},{"key":"934_CR8","doi-asserted-by":"publisher","unstructured":"Dwork C, McSherry F, Nissim K et al (2006) Calibrating noise to sensitivity in private data analysis. In: Theory of cryptography (TCC), pp 265\u2013284. https:\/\/doi.org\/10.1007\/11681878_14","DOI":"10.1007\/11681878_14"},{"key":"934_CR9","unstructured":"Dwork C, Rothblum GN (2016) Concentrated differential privacy. arXiv:1603.01887"},{"key":"934_CR10","doi-asserted-by":"publisher","unstructured":"Dwork C, Rothblum GN, Vadhan S (2010) Boosting and differential privacy. In: Proceedings of the IEEE annual symposium on foundations of computer science (FOCS), pp 51\u201360. https:\/\/doi.org\/10.1109\/FOCS.2010.12","DOI":"10.1109\/FOCS.2010.12"},{"key":"934_CR11","unstructured":"Fan L (2020) A survey of differentially private generative adversarial networks. In: Proceedings of the AAAI workshop on privacy-preserving artificial intelligence"},{"issue":"4","key":"934_CR12","doi-asserted-by":"publisher","first-page":"83:1","DOI":"10.1145\/3337064","volume":"52","author":"S Fletcher","year":"2019","unstructured":"Fletcher S, Islam MZ (2019) Decision tree classification with differential privacy: a survey. ACM Comput Surv 52(4):83:1-83:33. https:\/\/doi.org\/10.1145\/3337064","journal-title":"ACM Comput Surv"},{"key":"934_CR13","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01025868","volume":"57","author":"D Freedman","year":"1981","unstructured":"Freedman D, Diaconis P (1981) On the histogram as a density estimator: $$l_2$$ theory. Z Wahrscheinlichkeitstheorie verw Gebiete 57:453\u2013476. https:\/\/doi.org\/10.1007\/BF01025868","journal-title":"Z Wahrscheinlichkeitstheorie verw Gebiete"},{"key":"934_CR14","doi-asserted-by":"publisher","unstructured":"Friedman A, Schuster A (2010) Data mining with differential privacy. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 493\u2013502. https:\/\/doi.org\/10.1145\/1835804.1835868","DOI":"10.1145\/1835804.1835868"},{"key":"934_CR15","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1186\/s12916-018-1122-7","volume":"16","author":"H Fr\u00f6hlich","year":"2018","unstructured":"Fr\u00f6hlich H, Balling R, Beerenwinkel N et al (2018) From hype to reality: data science enabling personalized medicine. BMC Med 16:150. https:\/\/doi.org\/10.1186\/s12916-018-1122-7","journal-title":"BMC Med"},{"issue":"4","key":"934_CR16","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1002\/sam.11145","volume":"5","author":"E Galbrun","year":"2012","unstructured":"Galbrun E, Miettinen P (2012) From black and white to full color: extending redescription mining outside the Boolean world. Stat Anal Data Min 5(4):284\u2013303. https:\/\/doi.org\/10.1002\/sam.11145","journal-title":"Stat Anal Data Min"},{"issue":"1","key":"934_CR17","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/3007212","volume":"12","author":"E Galbrun","year":"2018","unstructured":"Galbrun E, Miettinen P (2018) Mining Redescriptions with Siren. ACM Trans Knowl Discov Data 12(1):6. https:\/\/doi.org\/10.1145\/3007212","journal-title":"ACM Trans Knowl Discov Data"},{"key":"934_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72889-6","volume-title":"Redescription mining","author":"E Galbrun","year":"2018","unstructured":"Galbrun E, Miettinen P (2018) Redescription mining. Springer, New York. https:\/\/doi.org\/10.1007\/978-3-319-72889-6"},{"key":"934_CR19","doi-asserted-by":"publisher","unstructured":"Galbrun E, Miettinen P (2012b) Siren: an interactive tool for mining and visualizing geospatial redescriptions [demo]. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 1544\u20131547. https:\/\/doi.org\/10.1145\/2339530.2339776","DOI":"10.1145\/2339530.2339776"},{"key":"934_CR20","doi-asserted-by":"publisher","unstructured":"Galbrun E, Miettinen P (2016) Analysing political opinions using redescription mining. In: Proceedings of the IEEE international conference on data mining workshop (ICDMW), pp 422\u2013427. https:\/\/doi.org\/10.1109\/ICDMW.2016.0066","DOI":"10.1109\/ICDMW.2016.0066"},{"key":"934_CR21","doi-asserted-by":"publisher","unstructured":"Galbrun E, Tang H, Fortelius M et al (2018) Computational biomes: the ecometrics of large mammal teeth. Palaeontol Electron 21.1.3A. https:\/\/doi.org\/10.26879\/786","DOI":"10.26879\/786"},{"key":"934_CR22","doi-asserted-by":"publisher","unstructured":"Gallo A, Miettinen P, Mannila H (2008) Finding subgroups having several descriptions: algorithms for redescription mining. In: Proceedings of the SIAM international conference on data mining (SDM), pp 334\u2013345. https:\/\/doi.org\/10.1137\/1.9781611972788.30","DOI":"10.1137\/1.9781611972788.30"},{"issue":"2","key":"934_CR23","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/MCI.2020.2976185","volume":"15","author":"M Gong","year":"2020","unstructured":"Gong M, Xie Y, Pan K et al (2020) A survey on differentially private machine learning [review article]. IEEE Comput Intell Mag 15(2):49\u201364. https:\/\/doi.org\/10.1109\/MCI.2020.2976185","journal-title":"IEEE Comput Intell Mag"},{"issue":"5","key":"934_CR24","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1007\/s10618-017-0532-z","volume":"31","author":"ME Gursoy","year":"2017","unstructured":"Gursoy ME, Inan A, Nergiz ME et al (2017) Differentially private nearest neighbor classification. Data Min Knowl Discov 31(5):1544\u20131575. https:\/\/doi.org\/10.1007\/s10618-017-0532-z","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"934_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"WK Hastings","year":"1970","unstructured":"Hastings WK (1970) Monte Carlo sampling methods using Markov chains and their applications. Biomet 57(1):97\u2013109. https:\/\/doi.org\/10.1093\/biomet\/57.1.97","journal-title":"Biomet"},{"key":"934_CR26","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1002\/joc.1276","volume":"25","author":"RJ Hijmans","year":"2005","unstructured":"Hijmans RJ, Cameron SE, Parra LJ et al (2005) Very high resolution interpolated climate surfaces for global land areas. Int J Climatol 25:1965\u20131978","journal-title":"Int J Climatol"},{"key":"934_CR27","doi-asserted-by":"publisher","unstructured":"Imtia H, Sarwate AD (2018) Improved algorithms for differentially private orthogonal tensor decomposition. In: Proceedings of the IEEE international conference on acoustics, speech and signal processing (ICASSP), pp 2201\u20132205. https:\/\/doi.org\/10.1109\/ICASSP.2018.8461303","DOI":"10.1109\/ICASSP.2018.8461303"},{"issue":"1","key":"934_CR28","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1109\/ICDMW.2009.93","volume":"5","author":"G Jagannathan","year":"2012","unstructured":"Jagannathan G, Pillaipakkamnatt K, Wright RN (2012) A practical differentially private random decision tree classifier. Trans Data Privacy 5(1):273\u2013295. https:\/\/doi.org\/10.1109\/ICDMW.2009.93","journal-title":"Trans Data Privacy"},{"key":"934_CR29","doi-asserted-by":"publisher","unstructured":"Jagannathan G, Monteleoni C, Pillaipakkamnatt K (2013) A semi-supervised learning approach to differential privacy. In: Proceedings of the IEEE international conference on data mining workshop (ICDMW), pp 841\u2013848. https:\/\/doi.org\/10.1109\/ICDMW.2013.131","DOI":"10.1109\/ICDMW.2013.131"},{"key":"934_CR30","doi-asserted-by":"publisher","unstructured":"Jahan T, Narasimha G, Rao CVG (2014) A comparative study of data perturbation using fuzzy logic to preserve privacy. In: Proceedings of the international conference on networks and communications (NetCom2013), pp 161\u2013170. https:\/\/doi.org\/10.1007\/978-3-319-03692-2_13","DOI":"10.1007\/978-3-319-03692-2_13"},{"key":"934_CR31","doi-asserted-by":"publisher","unstructured":"Kalofolias J, Galbrun E, Miettinen P (2016) From sets of good redescriptions to good sets of redescriptions. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 211\u2013220. https:\/\/doi.org\/10.1109\/ICDM.2016.0032","DOI":"10.1109\/ICDM.2016.0032"},{"key":"934_CR32","unstructured":"Karjalainen M, Galbrun E, Miettinen P (2023) Serenade: an approach for differentially private greedy redescription mining. In: Proceedings of the 20th anniversary workshop on knowledge discovery in inductive databases (KDID \u201922), pp 31\u201346"},{"issue":"1","key":"934_CR33","doi-asserted-by":"publisher","first-page":"39","DOI":"10.29012\/jpc.v5i1.625","volume":"5","author":"K Kenthapadi","year":"2013","unstructured":"Kenthapadi K, Korolova A, Mironov I et al (2013) Privacy via the Johnson\u2013Lindenstrauss transform. J Priv Confid 5(1):39\u201371. https:\/\/doi.org\/10.29012\/jpc.v5i1.625","journal-title":"J Priv Confid"},{"key":"934_CR34","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/827371","volume":"2014","author":"H Li","year":"2014","unstructured":"Li H, Xiong L, Ohno-Machado L et al (2014) Privacy preserving RBF kernel support vector machine. BioMed Res Int 2014:827371. https:\/\/doi.org\/10.1155\/2014\/827371","journal-title":"BioMed Res Int"},{"issue":"1","key":"934_CR35","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1109\/TKDE.2006.14","journal-title":"IEEE Tran Knowl Data Eng"},{"issue":"1","key":"934_CR36","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"Mann HB, Whitney DR (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18(1):50\u201360. https:\/\/doi.org\/10.1214\/aoms\/1177730491","journal-title":"Ann Math Stat"},{"key":"934_CR37","doi-asserted-by":"publisher","unstructured":"McSherry F (2009) Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In: Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD), pp 19\u201330. https:\/\/doi.org\/10.1145\/1559845.1559850","DOI":"10.1145\/1559845.1559850"},{"key":"934_CR38","doi-asserted-by":"publisher","unstructured":"McSherry F, Mironov I (2009) Differentially private recommender systems: building privacy into the Netflix prize contenders. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 627\u2013636. https:\/\/doi.org\/10.1145\/1557019.1557090","DOI":"10.1145\/1557019.1557090"},{"key":"934_CR39","doi-asserted-by":"publisher","unstructured":"McSherry F, Talwar K (2007) Mechanism design via differential privacy. In: Proceedings of the IEEE symposium on foundations of computer science (FOCS), pp 94\u2013103. https:\/\/doi.org\/10.1109\/FOCS.2007.66","DOI":"10.1109\/FOCS.2007.66"},{"issue":"6","key":"934_CR40","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN et al (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087\u20131092. https:\/\/doi.org\/10.1063\/1.1699114","journal-title":"J Chem Phys"},{"key":"934_CR41","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.eswa.2016.10.012","volume":"68","author":"M Mihel\u010di\u0107","year":"2017","unstructured":"Mihel\u010di\u0107 M, D\u017eeroski S, Lavra\u010d N et al (2017) A framework for redescription set construction. Expert Syst Appl 68:196\u2013215. https:\/\/doi.org\/10.1016\/j.eswa.2016.10.012","journal-title":"Expert Syst Appl"},{"issue":"10","key":"934_CR42","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0187364","volume":"12","author":"M Mihel\u010di\u0107","year":"2017","unstructured":"Mihel\u010di\u0107 M, \u0160imi\u0107 G, Babi\u0107-Leko M et al (2017) Using redescription mining to relate clinical and biological characteristics of cognitively impaired and Alzheimer\u2019s disease patients. PLoS ONE 12(10):e0187364. https:\/\/doi.org\/10.1371\/journal.pone.0187364","journal-title":"PLoS ONE"},{"key":"934_CR43","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10844-017-0448-5","volume":"50","author":"M Mihel\u010di\u0107","year":"2018","unstructured":"Mihel\u010di\u0107 M, D\u017eeroski S, Lavra\u010d N et al (2018) Redescription mining augmented with random forest of multi-target predictive clustering trees. J Intell Inf Syst 50:63\u201396. https:\/\/doi.org\/10.1007\/s10844-017-0448-5","journal-title":"J Intell Inf Syst"},{"key":"934_CR44","doi-asserted-by":"crossref","unstructured":"Mihel\u010di\u0107 M, Miettinen P (2022) Differentially private tree-based redescription mining arXiv:2212.06630","DOI":"10.1007\/s10618-023-00934-8"},{"key":"934_CR45","volume-title":"The Atlas of European Mammals","author":"AJ Mitchell-Jones","year":"1999","unstructured":"Mitchell-Jones AJ, Amori G, Bogdanowicz W et al (1999) The Atlas of European Mammals. Academic Press, Cambridge"},{"key":"934_CR46","doi-asserted-by":"publisher","DOI":"10.1186\/1758-2946-5-30","author":"F Napolitano","year":"2013","unstructured":"Napolitano F, Zhao Y, Moreira VM et al (2013) Drug repositioning: a machine-learning approach through data integration. J Cheminform. https:\/\/doi.org\/10.1186\/1758-2946-5-30","journal-title":"J Cheminform"},{"key":"934_CR47","doi-asserted-by":"publisher","unstructured":"Nissim K, Raskhodnikova S, Smith A (2007) Smooth sensitivity and sampling in private data analysis. In: Proceedings of the ACM symposium on theory of computing (STOC), pp 75\u201384. https:\/\/doi.org\/10.1145\/1250790.1250803","DOI":"10.1145\/1250790.1250803"},{"key":"934_CR48","doi-asserted-by":"publisher","DOI":"10.1201\/9781420086850.ch22","volume-title":"Biological data mining","author":"N Ramakrishnan","year":"2009","unstructured":"Ramakrishnan N, Zaki MJ (2009) Redescription mining and applications in bioinformatics. In: Chen J, Lonardi S (eds) Biological data mining. Chapman and Hall\/CRC, Boca Raton. https:\/\/doi.org\/10.1201\/9781420086850.ch22"},{"key":"934_CR49","doi-asserted-by":"publisher","unstructured":"Ramakrishnan N, Kumar D, Mishra B et al (2004) Turning CARTwheels: an alternating algorithm for mining redescriptions. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 266\u2013275. https:\/\/doi.org\/10.1145\/1014052.1014083","DOI":"10.1145\/1014052.1014083"},{"key":"934_CR50","doi-asserted-by":"publisher","unstructured":"Rana S, Gupta SK, Venkatesh S (2015) Differentially private random forest with high utility. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 955\u2013960. https:\/\/doi.org\/10.1109\/ICDM.2015.76","DOI":"10.1109\/ICDM.2015.76"},{"issue":"1","key":"934_CR51","doi-asserted-by":"publisher","first-page":"25","DOI":"10.29012\/jpc.v4i1.612","volume":"4","author":"BIP Rubinstein","year":"2012","unstructured":"Rubinstein BIP, Bartlett PL, Huang L et al (2012) Learning in a large function space: privacy-preserving mechanisms for svm learning. J Priv Confid 4(1):25. https:\/\/doi.org\/10.29012\/jpc.v4i1.612","journal-title":"J Priv Confid"},{"key":"934_CR52","doi-asserted-by":"publisher","first-page":"142,131","DOI":"10.1109\/ACCESS.2020.3013157","volume":"8","author":"YT Tsou","year":"2020","unstructured":"Tsou YT, Zhen H, Jiang X et al (2020) DPARM: Differentially private association rules mining. IEEE Access 8:142,131-142,147. https:\/\/doi.org\/10.1109\/ACCESS.2020.3013157","journal-title":"IEEE Access"},{"key":"934_CR53","doi-asserted-by":"publisher","unstructured":"Vaidya J, Shafiq B, Basu A et al (2013) Differentially private Naive bayes classification. In: Proceedings of the IEEE\/WIC\/ACM international joint conferences on web intelligence and intelligent agent technologies (WI-IAT), pp 571\u2013576. https:\/\/doi.org\/10.1109\/WI-IAT.2013.80","DOI":"10.1109\/WI-IAT.2013.80"},{"key":"934_CR54","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/42.974918","volume":"20","author":"B Van Ginneken","year":"2001","unstructured":"Van Ginneken B, Ter Haar Romeny BM, Viergever MA (2001) Computer-aided diagnosis in chest radiography: a survey. IEEE Trans Med Imaging 20:1228\u20131241. https:\/\/doi.org\/10.1109\/42.974918","journal-title":"IEEE Trans Med Imaging"},{"key":"934_CR55","unstructured":"Wang Y, Anandkumar A (2016) Online and differentially-private tensor decomposition. In: Proceedings of the advances in neural information processing systems (NIPS), pp 3531\u20133539. https:\/\/proceedings.neurips.cc\/paper\/2016\/file\/7eb7eabbe9bd03c2fc99881d04da9cbd-Paper.pdf"},{"key":"934_CR56","doi-asserted-by":"publisher","unstructured":"Xu S, Su S, Xiong L, et\u00a0al (2016) Differentially private frequent subgraph mining. In: Proceedings of the IEEE international conference on data engineering (ICDE), pp 229\u2013240. https:\/\/doi.org\/10.1109\/ICDE.2016.7498243","DOI":"10.1109\/ICDE.2016.7498243"},{"issue":"1","key":"934_CR57","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/2428536.2428539","volume":"6","author":"C Zeng","year":"2012","unstructured":"Zeng C, Naughton JF, Cai JY (2012) On differentially private frequent itemset mining. Proc VLDB Endow 6(1):25\u201336. https:\/\/doi.org\/10.14778\/2428536.2428539","journal-title":"Proc VLDB Endow"},{"key":"934_CR58","doi-asserted-by":"publisher","unstructured":"Zinchenko T, Galbrun E, Miettinen P (2015) Mining predictive redescriptions with trees. In: Proceedings of the IEEE international conference on data mining workshops (ICDMW), pp 1672\u20131675. https:\/\/doi.org\/10.1109\/ICDMW.2015.123","DOI":"10.1109\/ICDMW.2015.123"},{"key":"934_CR59","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103813","volume":"94","author":"E Zorarpac\u0131","year":"2020","unstructured":"Zorarpac\u0131 E, \u00d6zel SA (2020) Differentially private 1R classification algorithm using artificial bee colony and differential evolution. Eng Appl Artif Intell 94:103813. https:\/\/doi.org\/10.1016\/j.engappai.2020.103813","journal-title":"Eng Appl Artif Intell"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00934-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-023-00934-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00934-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T17:15:41Z","timestamp":1688663741000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-023-00934-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,16]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["934"],"URL":"https:\/\/doi.org\/10.1007\/s10618-023-00934-8","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2023,4,16]]},"assertion":[{"value":"3 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}