{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:05:05Z","timestamp":1772823905201,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T00:00:00Z","timestamp":1437091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10115-015-0862-3","type":"journal-article","created":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T07:16:55Z","timestamp":1437031015000},"page":"625-645","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["A transversal hypergraph approach for the frequent itemset hiding problem"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0706-781X","authenticated-orcid":false,"given":"Elias C.","family":"Stavropoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilios S.","family":"Verykios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasileios","family":"Kagklis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,17]]},"reference":[{"key":"862_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Yu PS (eds) (2008) Privacy-preserving data mining: models and algorithms. Advances in database systems. Springer, New York","DOI":"10.1007\/978-0-387-70992-5"},{"key":"862_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases (VLDB\u201994), pp 487\u2013499"},{"key":"862_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 2000), pp 439\u2013450","DOI":"10.1145\/342009.335438"},{"key":"862_CR4","unstructured":"Atallah M, Bertino E, Elmagarmid A, Ibrahim M, Verykios V (1999) Disclosure limitation of sensitive rules. In: Proceedings of the knowledge and data engineering exchange (KDEX\u201999), pp 45\u201352"},{"key":"862_CR5","doi-asserted-by":"crossref","unstructured":"Bailey J, Manoukian T, Ramamohanarao K (2003) A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In: Proceedings of the 3rd IEEE international conference on data mining (ICDM 2003), pp 485\u2013488. IEEE computer Society, Dec 2003","DOI":"10.1109\/ICDM.2003.1250958"},{"key":"862_CR6","doi-asserted-by":"crossref","unstructured":"Bayardo R (1998) Efficiently mining long patterns from databases. In: Proceedings of the 1998 ACM-SIGMOD international conference on management of data (SIGMOD\u201998), pp 85\u201393","DOI":"10.1145\/276304.276313"},{"key":"862_CR7","volume-title":"Hypergraphs: combinatorics of finite sets, volume\u00a045 of North Holland mathematical library","author":"C Berge","year":"1989","unstructured":"Berge C (1989) Hypergraphs: combinatorics of finite sets, volume\u00a045 of North Holland mathematical library. Elsevier Science Publishers B.V., Amsterdam"},{"key":"862_CR8","unstructured":"Bodon F (2003) A fast APRIORI implementation. In: Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations (FIMI\u201903), vol 90, pp 56\u201365"},{"key":"862_CR9","doi-asserted-by":"crossref","unstructured":"Bonchi F, Ferrari E (2011) Privacy-aware knowledge discovery: novel applications and new techniques. Chapman & Hall\/CRC data mining and knowledge discovery series. CRC Press INC","DOI":"10.1201\/b10373"},{"issue":"6","key":"862_CR10","first-page":"437","volume":"2","author":"C Borgelt","year":"2012","unstructured":"Borgelt C (2012) Frequent item set mining. Wiley Interdiscip Rev: Data Min Knowl Discov 2(6):437\u2013456","journal-title":"Wiley Interdiscip Rev: Data Min Knowl Discov"},{"key":"862_CR11","doi-asserted-by":"crossref","unstructured":"Boros E, Elbassioni K, Gurvich V, Khachiyan L (2003) An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals. In: Proceedings of the 11th annual European symposium on algorithms (ESA 2003), vol 2432 of LNCS, 556\u2013567","DOI":"10.1007\/978-3-540-39658-1_51"},{"key":"862_CR12","doi-asserted-by":"crossref","unstructured":"Boros E, Elbassioni K, Makino K (2008) On Berge multiplication for monotone boolean dualization. In: Proceedings of the 35th international colloquium on automata, languages and programming (ICALP 2008), volume 5125 of LNCS, 48\u201359","DOI":"10.1007\/978-3-540-70575-8_5"},{"issue":"3","key":"862_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1024605820527","volume":"39","author":"E Boros","year":"2003","unstructured":"Boros E, Gurvich V, Khachiyan L, Makino K (2003) On maximal frequent and minimal infrequent sets in binary matrices. Ann Math Artif Intell 39(3):211\u2013221","journal-title":"Ann Math Artif Intell"},{"key":"862_CR14","doi-asserted-by":"crossref","unstructured":"Brijs T, Swinnen G, Vanhoof K, Wets G (1999) Using association rules for product assortment decisions: a case study. In: proceedings of the 5th ACM-SIGKDD international conference on knowledge discovery and data mining (KDD\u201999), pp 254\u2013260","DOI":"10.1145\/312129.312241"},{"key":"862_CR15","doi-asserted-by":"crossref","unstructured":"Bu S, Lakshmanan LVS, Ng RT, Ramesh G (2007) Preservation of patterns and input\u2013output privacy. In: Proceedings of the IEEE 23rd international conference on data engineering (ICDE 2007), pp 696\u2013705","DOI":"10.1109\/ICDE.2007.367915"},{"key":"862_CR16","doi-asserted-by":"crossref","unstructured":"Calders T (2004) Computational complexity on itemset frequency satisfiability. In: Proceedings of symposium on principles of database systems 2004 (PODS\u201904), pp 143\u2013154","DOI":"10.1145\/1055558.1055580"},{"issue":"1\u20132","key":"862_CR17","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.tcs.2007.11.003","volume":"394","author":"T Calders","year":"2008","unstructured":"Calders T (2008) Itemset frequency satisfiability: complexity and axiomatization. Theor Comput Sci 394(1\u20132):84\u2013111","journal-title":"Theor Comput Sci"},{"key":"862_CR18","unstructured":"Clifton C (1999) Protecting against data mining through samples. In: Proceedings of the 13th international conference on database security (DBSec\u201999), pp 193\u2013207"},{"issue":"2","key":"862_CR19","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10115-004-0178-1","volume":"8","author":"G Dong","year":"2005","unstructured":"Dong G, Li J (2005) Mining border descriptions of emerging patterns from dataset pairs. Knowl Info Syst 8(2):178\u2013202","journal-title":"Knowl Info Syst"},{"issue":"6","key":"862_CR20","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T Eiter","year":"1995","unstructured":"Eiter T, Gottlob G (1995) Identifying the minimal transversals of a hypergraph and related problems. SIAM J Comput 24(6):1278\u20131304","journal-title":"SIAM J Comput"},{"key":"862_CR21","doi-asserted-by":"crossref","unstructured":"Eiter T, Gottlob G (2002) Hypergraph transversal computation and related problems in Logic and AI. In: Proceedings of European conference on logic in AI (JELIA 2002), vol 2424 of LNCS\/LNAI, pp 549\u2013564","DOI":"10.1007\/3-540-45757-7_53"},{"issue":"2","key":"862_CR22","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/S009753970240639X","volume":"32","author":"T Eiter","year":"2003","unstructured":"Eiter T, Gottlob G, Makino K (2003) New results on monotone dualization and generating hypergraph transversals. SIAM J Comput 32(2):514\u2013537","journal-title":"SIAM J Comput"},{"issue":"4","key":"862_CR23","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.is.2003.09.001","volume":"29","author":"AV Evfimievski","year":"2004","unstructured":"Evfimievski AV, Srikant R, Agrawal R, Gehrke J (2004) Privacy preserving mining of association rules. Info Syst 29(4):343\u2013364","journal-title":"Info Syst"},{"issue":"1","key":"862_CR24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10618-006-0057-3","volume":"15","author":"C Faloutsos","year":"2007","unstructured":"Faloutsos C, Megalooikonomou V (2007) On data mining, compression, and Kolmogorov complexity. Data Min Knowl Discov 15(1):3\u201320","journal-title":"Data Min Knowl Discov"},{"key":"862_CR25","unstructured":"Frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/data\/"},{"key":"862_CR26","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman ML, Khachiyan L (1996) On the complexity of dualization of monotone disjunctive normal forms. J Algorithm 21:618\u2013628","journal-title":"J Algorithm"},{"issue":"4","key":"862_CR27","first-page":"571","volume":"42","author":"BCM Fung","year":"2010","unstructured":"Fung BCM, Wang K, Chen R, Yu PS (2010) Privacy-preserving data publishing: a survey of recent developments. ACM Comput Surv 42(4):571\u2013588","journal-title":"ACM Comput Surv"},{"key":"862_CR28","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco"},{"key":"862_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0885-064X(88)90006-4","volume":"4","author":"G Georgakopoulos","year":"1988","unstructured":"Georgakopoulos G, Kavvadias D, Papadimitriou CH (1988) Probabilistic satisfiability. J Complex 4:1\u201311","journal-title":"J Complex"},{"issue":"3","key":"862_CR30","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10115-008-0178-7","volume":"20","author":"A Gkoulalas-Divanis","year":"2009","unstructured":"Gkoulalas-Divanis A, Verykios VS (2009) Hiding sensitive knowledge without side effects. Knowl Info Syst 20(3):263\u2013299","journal-title":"Knowl Info Syst"},{"issue":"2","key":"862_CR31","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/235767.235769","volume":"27","author":"J Goldsmith","year":"1996","unstructured":"Goldsmith J, Levy MA, Mundhenk M (1996) Limited nondeterminism. ACM SIGACT News 27(2):20\u201329","journal-title":"ACM SIGACT News"},{"key":"862_CR32","doi-asserted-by":"crossref","unstructured":"Gottlob G (2013) Deciding monotone duality and identifying frequent itemsets in quadratic logspace. Technical report arxiv:1212.1881v3 [cs.DC]","DOI":"10.1145\/2463664.2463673"},{"issue":"2","key":"862_CR33","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D Gunopulos","year":"2003","unstructured":"Gunopulos D, Khardon R, Mannila H, Saluja S, Sharma HTR (2003) Discovering all most specific sentences. ACM Trans Database Syst 28(2):140\u2013174","journal-title":"ACM Trans Database Syst"},{"key":"862_CR34","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0166-218X(99)00099-2","volume":"96\u201397","author":"V Gurvich","year":"1999","unstructured":"Gurvich V, Khachiyan L (1999) On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discret Appl Math 96\u201397:363\u2013373","journal-title":"Discret Appl Math"},{"key":"862_CR35","doi-asserted-by":"crossref","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), Article 18, 1\u201339","DOI":"10.1145\/2541268.2541271"},{"key":"862_CR36","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 9th IEEE international conference on data mining (ICDM\u201909), pp 806\u2013811","DOI":"10.1109\/ICDM.2009.123"},{"key":"862_CR37","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.1016\/j.dam.2008.10.004","volume":"157","author":"M Hagen","year":"2009","unstructured":"Hagen M (2009) Lower bounds for three algorithms for transversal hypergraph generation. Discret Appl Math 157:1460\u20131469","journal-title":"Discret Appl Math"},{"key":"862_CR38","unstructured":"IBM ILOG CPLEX user\u2019s manual v12.6"},{"key":"862_CR39","unstructured":"IBM Basket Data Generator. http:\/\/sourceforge.net\/projects\/ibmquestdatagen\/"},{"key":"862_CR40","doi-asserted-by":"crossref","unstructured":"Kagklis V, Verykios VS, Tzimas G, Tsakalidis AK (2014) An integer linear programming scheme to sanitize sensitive frequent itemsets. In: Proceedings of 2014 IEEE international conference on tools with AI (ICTAI 2014), 2014. To appear","DOI":"10.1109\/ICTAI.2014.119"},{"key":"862_CR41","doi-asserted-by":"crossref","unstructured":"Kantarcioglu M, Jin J, Clifton C (2004) When do data mining results violate privacy? In: Proceedings of the 10th ACM-SIGKDD international conference on knowledge discovery and data mining (KDD\u201904), pp 599\u2013604","DOI":"10.1145\/1014052.1014126"},{"issue":"1","key":"862_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0190(02)00346-0","volume":"85","author":"DJ Kavvadias","year":"2003","unstructured":"Kavvadias DJ, Stavropoulos EC (2003) Monotone Boolean dualization is in co-NP[ $$\\log ^2n$$ log 2 n ]. Info Process Lett 85(1):1\u20136","journal-title":"Info Process Lett"},{"issue":"2","key":"862_CR43","doi-asserted-by":"crossref","first-page":"239","DOI":"10.7155\/jgaa.00107","volume":"9","author":"DJ Kavvadias","year":"2005","unstructured":"Kavvadias DJ, Stavropoulos EC (2005) An efficient algorithm for the transversal hypergraph generation. J Graph Algorithms Appl 9(2):239\u2013264","journal-title":"J Graph Algorithms Appl"},{"key":"862_CR44","doi-asserted-by":"crossref","unstructured":"Kohavi R, Brodley C, Frasca B, Mason L, Zheng Z (2000) KDD-Cup 2000 organizers\u2019 report: peeling the onion. SIGKDD explorations, 2(2):86\u201398. http:\/\/www.ecn.purdue.edu\/KDDCUP","DOI":"10.1145\/380995.381033"},{"key":"862_CR45","unstructured":"Leloglu E, Ayav T, Ergenc B (2014) Coefficient-based exact approach for frequent itemset hiding. In: eKNOW2014: The 6th international conference on information, process, and knowledge management, pp 124\u2013130"},{"key":"862_CR46","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H (1997) Levelwise search and borders of theories in knowledge discovery. Data Min Knowl Discov 1:241\u2013258","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"862_CR47","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/isre.1050.0056","volume":"16","author":"S Menon","year":"2005","unstructured":"Menon S, Sarkar S, Mukherjee S (2005) Maximizing accuracy of shared databases when concealing sensitive patterns. Info Syst Res 16(3):256\u2013270","journal-title":"Info Syst Res"},{"key":"862_CR48","unstructured":"Mielik\u00e4inen T (2003) On inverse frequent set mining problems. In: Proceedings of the 2nd workshop on privacy preserving data mining (PPDM\u201903), pp 18\u201333"},{"issue":"1","key":"862_CR49","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.datak.2007.06.012","volume":"65","author":"GV Moustakides","year":"2008","unstructured":"Moustakides GV, Verykios VS (2008) A maxmin approach for hiding frequent itemsets. Data Knowl Eng 65(1):75\u201389","journal-title":"Data Knowl Eng"},{"key":"862_CR50","unstructured":"Murakami K, Uno T (2011) Efficient algorithms for dualizing large-scale hypergraphs. Technical report arxiv:1102.3813v2 [cs.DC]"},{"key":"862_CR51","doi-asserted-by":"crossref","unstructured":"Rizvi S, Haritsa JR (2002) Maintaining data privacy in association rule mining. In: Proceedings of the 28th international conference on very large data bases (VLDB\u201902), pp 682\u2013693","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"862_CR52","unstructured":"Sun X, Yu P (2005) A border\u2013based approach for hiding sensitive frequent itemsets. In: Proceedings of 5th IEEE internationa conference on data mining (ICDM 2005), pp 426\u2013433"},{"issue":"1","key":"862_CR53","doi-asserted-by":"crossref","first-page":"74","DOI":"10.5626\/JCSE.2007.1.1.074","volume":"1","author":"X Sun","year":"2007","unstructured":"Sun X, Yu PS (2007) Hiding sensitive frequent itemsets by a border-based approach. J Comput Sci Eng 1(1):74\u201394","journal-title":"J Comput Sci Eng"},{"issue":"5","key":"862_CR54","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) Achieving k-anonymity privacy protection using generalization and suppression. Int J Uncertain Fuzziness Knowl Based Syst 10(5):571\u2013588","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"issue":"5","key":"862_CR55","doi-asserted-by":"crossref","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"},{"issue":"4","key":"862_CR56","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1137\/060653032","volume":"21","author":"K Takata","year":"2007","unstructured":"Takata K (2007) A worst-case analysis of the sequential method to list the minimal hitting sets of a hypergraph. SIAM J Discret Math 21(4):936\u2013946","journal-title":"SIAM J Discret Math"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0862-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0862-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0862-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T04:55:38Z","timestamp":1566968138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0862-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,17]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["862"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0862-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,17]]}}}