{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:05Z","timestamp":1740122345026,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T00:00:00Z","timestamp":1563580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T00:00:00Z","timestamp":1563580800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"MISE, Italian Ministry for Industry","award":["PON ID Service and Protect ID"],"award-info":[{"award-number":["PON ID Service and Protect ID"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10618-019-00643-1","type":"journal-article","created":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T10:02:40Z","timestamp":1563616960000},"page":"1736-1774","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Extending inverse frequent itemsets mining to generate realistic datasets: complexity, accuracy and emerging applications"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3584-5372","authenticated-orcid":false,"given":"Domenico","family":"Sacc\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edoardo","family":"Serra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonino","family":"Rullo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,20]]},"reference":[{"key":"643_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-0-387-70992-5_2","volume-title":"Privacy-preserving data mining\u2014models and algorithms, volume 34 of advances in database systems","author":"CC Aggarwal","year":"2008","unstructured":"Aggarwal CC, Yu PS (2008) A general survey of privacy-preserving data mining models and algorithms. In: Aggarwal CC, Yu PS (eds) Privacy-preserving data mining\u2014models and algorithms, volume 34 of advances in database systems. Springer, Berlin, pp 11\u201352"},{"key":"643_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on management of data, SIGMOD \u201993, New York, NY, USA. ACM, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"643_CR3","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, SIGMOD \u201900, New York, NY, USA. ACM, pp 439\u2013450","DOI":"10.1145\/342009.335438"},{"key":"643_CR4","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.ins.2014.11.037","volume":"316","author":"AK Beheshti","year":"2015","unstructured":"Beheshti AK, Hejazi SR (2015) A novel hybrid column generation-metaheuristic approach for the vehicle routing problem with general soft time window. Inf Sci 316:598\u2013615","journal-title":"Inf Sci"},{"issue":"1","key":"643_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000006","volume":"2","author":"Y Bengio","year":"2009","unstructured":"Bengio Y (2009) Learning deep architectures for AI. Found Trends Mach Learn 2(1):1\u2013127","journal-title":"Found Trends Mach Learn"},{"key":"643_CR6","volume-title":"Introduction to linear optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas D, Tsitsiklis JN (1997) Introduction to linear optimization. Athena Scientific, Belmont"},{"key":"643_CR7","doi-asserted-by":"crossref","unstructured":"Bykowski A, Rigotti C (2001) A condensed representation to find frequent patterns. In: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, PODS \u201901, New York, NY, USA. ACM, pp 267\u2013273","DOI":"10.1145\/375551.375604"},{"key":"643_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ins.2013.05.008","volume":"244","author":"L Cagliero","year":"2013","unstructured":"Cagliero L, Garza P (2013) Itemset generalization with cardinality-based constraints. Inf Sci 244:161\u2013174","journal-title":"Inf Sci"},{"key":"643_CR9","doi-asserted-by":"crossref","unstructured":"Calders T (2004) Computational complexity of itemset frequency satisfiability. In: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, PODS \u201904, New York, NY, USA. ACM, pp 143\u2013154","DOI":"10.1145\/1055558.1055580"},{"issue":"7\u20138","key":"643_CR10","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s00236-007-0060-1","volume":"44","author":"T Calders","year":"2007","unstructured":"Calders T (2007) The complexity of satisfying constraints on databases of transactions. Acta Inf 44(7\u20138):591\u2013624","journal-title":"Acta Inf"},{"key":"643_CR11","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ins.2014.01.015","volume":"275","author":"CP Chen","year":"2014","unstructured":"Chen CP, Zhang C-Y (2014) Data-intensive applications, challenges, techniques and technologies: a survey on big data. Inf Sci 275:314\u2013347","journal-title":"Inf Sci"},{"key":"643_CR12","doi-asserted-by":"crossref","unstructured":"Evfimievski A, Gehrke J, Srikant R (2003) Limiting privacy breaches in privacy preserving data mining. In: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS \u201903, New York, NY, USA. ACM, pp 211\u2013222","DOI":"10.1145\/773153.773174"},{"issue":"6","key":"643_CR13","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper Res 9(6):849\u2013859","journal-title":"Oper Res"},{"key":"643_CR14","unstructured":"Gunopulos D, Khardon R, Mannila H, Toivonen H (1997) Data mining, hypergraph transversals, and machine learning. In: Mendelzon AO, \u00d6zsoyoglu ZM (eds) Proceedings of the 16-th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, PODS \u201997, ACM Press, pp 209\u2013216"},{"issue":"12","key":"643_CR15","doi-asserted-by":"publisher","first-page":"1951","DOI":"10.1016\/j.artint.2011.05.002","volume":"175","author":"T Guns","year":"2011","unstructured":"Guns T, Nijssen S, Raedt LD (2011) Itemset mining: a constraint programming perspective. Artif Intell 175(12):1951\u20131983","journal-title":"Artif Intell"},{"issue":"4","key":"643_CR16","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2541268.2541271","volume":"7","author":"A Guzzo","year":"2013","unstructured":"Guzzo A, Moccia L, Sacc\u00e0 D, Serra E (2013) Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs. ACM Trans Knowl Discov Data 7(4):18:1\u201318:39","journal-title":"ACM Trans Knowl Discov Data"},{"key":"643_CR17","doi-asserted-by":"crossref","unstructured":"Guzzo A, Sacc\u00e0 D, Serra E (2009) An effective approach to inverse frequent set mining. In: Proceedings of the 2009 ninth IEEE international conference on data mining, ICDM \u201909, Washington, DC, USA. IEEE Computer Society, pp 806\u2013811","DOI":"10.1109\/ICDM.2009.123"},{"issue":"1","key":"643_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"key":"643_CR19","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2005","unstructured":"Han J, Kamber M (2005) Data mining: concepts and techniques. Kaufmann, San Francisco"},{"issue":"5786","key":"643_CR20","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1126\/science.1127647","volume":"313","author":"GE Hinton","year":"2006","unstructured":"Hinton GE, Salakhutdinov RR (2006) Reducing the dimensionality of data with neural networks. Science 313(5786):504\u2013507","journal-title":"Science"},{"issue":"1","key":"643_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.ins.2007.08.006","volume":"178","author":"T Hu","year":"2008","unstructured":"Hu T, Sung SY, Xiong H, Fu Q (2008) Discovery of maximum length frequent itemsets. Inf Sci 178(1):69\u201387","journal-title":"Inf Sci"},{"issue":"3","key":"643_CR22","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1504\/IJDMMM.2016.079071","volume":"8","author":"R Jindal","year":"2016","unstructured":"Jindal R, Malaya DB (2016) A novel approach for mining frequent patterns from incremental data. IJDMMM 8(3):244\u2013264","journal-title":"IJDMMM"},{"key":"643_CR23","unstructured":"KDDCUP2000 (2000). \n                  https:\/\/www.kdd.org\/kdd-cup\/view\/kdd-cup-2000\n                  \n                . Accessed 4 May 2018"},{"issue":"1","key":"643_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.datak.2007.06.011","volume":"65","author":"L Liu","year":"2008","unstructured":"Liu L, Kantarcioglu M, Thuraisingham B (2008) The applicability of the perturbation based privacy preserving data mining for real-world data. Data Knowl Eng 65(1):5\u201321","journal-title":"Data Knowl Eng"},{"key":"643_CR25","volume-title":"Linear and nonlinear programming","author":"DG Luenberger","year":"2003","unstructured":"Luenberger DG (2003) Linear and nonlinear programming, 2nd edn. Springer, Berlin","edition":"2"},{"key":"643_CR26","doi-asserted-by":"publisher","first-page":"10562","DOI":"10.1109\/ACCESS.2017.2706947","volume":"5","author":"R Mendes","year":"2017","unstructured":"Mendes R, Vilela JP (2017) Privacy-preserving data mining: methods, metrics, and applications. IEEE Access 5:10562\u201310582","journal-title":"IEEE Access"},{"issue":"6","key":"643_CR27","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MC.2013.196","volume":"46","author":"K Michael","year":"2013","unstructured":"Michael K, Miller KW (2013) Big data: new opportunities and new challenges [guest editors\u2019 introduction]. Computer 46(6):22\u201324","journal-title":"Computer"},{"key":"643_CR28","unstructured":"Mielikainen T (2003) On inverse frequent set mining. In: Proceedings of 2nd workshop on privacy preserving data mining, PPDM \u201903, Washington, DC, USA. IEEE Computer Society, pp 18\u201323"},{"key":"643_CR29","unstructured":"ms-IFM code (2018). Datasets and codes used by paper\u2019s experiments for ms-IFM ans stored in GitHub repository. \n                  https:\/\/github.com\/ninorullo\/NoSQL-IFM\n                  \n                . Accessed 18 Dec 2018"},{"key":"643_CR30","unstructured":"ms-IFM dataset (2017). Yelp challenge. \n                  https:\/\/www.yelp.com\/dataset\n                  \n                . Accessed 18 Dec 2018"},{"key":"643_CR31","doi-asserted-by":"crossref","unstructured":"Narayanan A, Shmatikov V(2009) De-anonymizing social networks. In: Proceedings\u2014-IEEE symposium on security and privacy 2009 30th IEEE symposium on security and privacy, pp 173\u2013187","DOI":"10.1109\/SP.2009.22"},{"key":"643_CR32","doi-asserted-by":"crossref","unstructured":"Oliveira S RM, Za\u00efane OR (2003) Protecting sensitive knowledge by data sanitization. In: Proceedings of the third IEEE international conference on data mining, ICDM \u201903, Washington, DC, USA. IEEE Computer Society, pp 613\u2013616","DOI":"10.1109\/ICDM.2003.1250990"},{"key":"643_CR33","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Boston"},{"key":"643_CR34","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of the 7th international conference on database theory, ICDT \u201999, London, UK. Springer-Verlag, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"643_CR35","doi-asserted-by":"crossref","unstructured":"Patki N, Wedge R, Veeramachaneni K (2016) The synthetic data vault. In: 2016 IEEE international conference on data science and advanced analytics, DSAA 2016, Montreal, QC, Canada, October 17\u201319, 2016, IEEE, pp 399\u2013410","DOI":"10.1109\/DSAA.2016.49"},{"key":"643_CR36","doi-asserted-by":"crossref","unstructured":"Ramesh G, Maniatty W, Zaki MJ (2003) Feasible itemset distributions in data mining: theory and application. In Neven F, Beeri C, Milo T (eds) PODS, ACM, pp 284\u2013295","DOI":"10.1145\/773153.773181"},{"key":"643_CR37","doi-asserted-by":"crossref","unstructured":"Ramesh G, Zaki MJ, Maniatty W (2005) Distribution-based synthetic database generation techniques for itemset mining. In: IDEAS, IEEE Computer Society, pp 307\u2013316","DOI":"10.1109\/IDEAS.2005.22"},{"key":"643_CR38","unstructured":"Sacc\u00e0 D, Serra E (2013) Number of minimal hypergraph transversals and complexity of IFM with infrequency: high in theory, but often not so much in practice!. Online Preliminary Paper from \n                  http:\/\/sacca.deis.unical.it\/#view=object&format=object&id=1490\/gid=160\n                  \n                . Accessed 4 May 2018"},{"key":"643_CR39","doi-asserted-by":"crossref","unstructured":"Shah A, Gulati R (2016) Article: Privacy preserving data mining: techniques, classification and implications\u2014a survey. International Journal of Computer Applications, 137(12):40\u201346. Published by Foundation of Computer Science (FCS), NY, USA","DOI":"10.5120\/ijca2016909006"},{"issue":"3","key":"643_CR40","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s10115-015-0862-3","volume":"47","author":"EC Stavropoulos","year":"2016","unstructured":"Stavropoulos EC, Verykios VS, Kagklis V (2016) A transversal hypergraph approach for the frequent itemset hiding problem. Knowl Inf Syst 47(3):625\u2013645","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"643_CR41","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) K-anonymity: a model for protecting privacy. Int J Uncertain Fuzziness Knowl-Based Syst 10(5):557\u2013570","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"},{"key":"643_CR42","unstructured":"Weikum G (2013) Where\u2019s the data in the big data wave? ACM Sigmod Blog \n                  http:\/\/wp.sigmod.org\/?p=786\n                  \n                . Accessed 4 May 2018"},{"issue":"4","key":"643_CR43","doi-asserted-by":"publisher","first-page":"45:1","DOI":"10.1145\/3182383","volume":"12","author":"H Wu","year":"2018","unstructured":"Wu H, Ning Y, Chakraborty P, Vreeken J, Tatti N, Ramakrishnan N (2018) Generating realistic synthetic population datasets. ACM Trans Knowl Discov Data 12(4):45:1\u201345:22","journal-title":"ACM Trans Knowl Discov Data"},{"key":"643_CR44","doi-asserted-by":"crossref","unstructured":"Wu X, Wu Y, Wang Y, Li Y (2005) Privacy aware market basket data set generation: A feasible approach for inverse frequent set mining. In: Proceedings of SIAM international conference on data mining, SDM\u2019 05, Philadelphia, PA, USA. SIAM, pp 103\u2013114","DOI":"10.1137\/1.9781611972757.10"},{"key":"643_CR45","doi-asserted-by":"crossref","unstructured":"Zheng Z, Kohavi R, Mason L (2001) Real world performance of association rule algorithms. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, KDD \u201901, New York, NY, USA. ACM, pp 401\u2013406","DOI":"10.1145\/502512.502572"},{"issue":"2","key":"643_CR46","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.ins.2006.08.010","volume":"177","author":"S Zhong","year":"2007","unstructured":"Zhong S (2007) Privacy-preserving algorithms for distributed mining of frequent itemsets. Inf Sci 177(2):490\u2013503","journal-title":"Inf Sci"},{"issue":"2","key":"643_CR47","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1540276.1540279","volume":"10","author":"B Zhou","year":"2008","unstructured":"Zhou B, Pei J, Luk W (2008) A brief survey on anonymization techniques for privacy preserving publishing of social network data. SIGKDD Explor Newsl 10(2):12\u201322","journal-title":"SIGKDD Explor Newsl"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00643-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-019-00643-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00643-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T23:24:31Z","timestamp":1595892271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-019-00643-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,20]]},"references-count":47,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["643"],"URL":"https:\/\/doi.org\/10.1007\/s10618-019-00643-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2019,7,20]]},"assertion":[{"value":"3 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}