{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:10:18Z","timestamp":1772824218572,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030197582","type":"print"},{"value":"9783030197599","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19759-9_11","type":"book-chapter","created":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T03:47:10Z","timestamp":1556336830000},"page":"169-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Frequent Itemset Hiding Toolbox"],"prefix":"10.1007","author":[{"given":"Aris","family":"Gkoulalas-Divanis","sequence":"first","affiliation":[]},{"given":"Vasileios","family":"Kagklis","sequence":"additional","affiliation":[]},{"given":"Elias C.","family":"Stavropoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"11_CR1","unstructured":"https:\/\/github.com\/kagklis\/Frequent-Itemset-Hiding-Toolbox-x86"},{"key":"11_CR2","unstructured":"IBM ILOG CPLEX User\u2019s Manual v12.6"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: SIGMOD Conference, pp. 439\u2013450 (2000)","DOI":"10.1145\/335191.335438"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Askari, M., Safavi-Naini, R., Barker, K.: An information theoretic privacy and utility measure for data sanitization mechanisms. In: Proceedings of the 2nd ACM Conference on Data and Application Security and Privacy (CODASPY 12), pp. 283\u2013294 (2012)","DOI":"10.1145\/2133601.2133637"},{"key":"11_CR5","unstructured":"Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure limitation of sensitive rules. In: Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX 99), pp. 45\u201352 (1999)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bayardo Jr., R.J.: Efficiently mining long patterns from databases. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD 98), pp. 85\u201393 (1998)","DOI":"10.1145\/276304.276313"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/MCSE.2010.118","volume":"13","author":"S Behnel","year":"2011","unstructured":"Behnel, S., Bradshaw, R., Citro, C., Dalcin, L., Seljebotn, D.S., Smith, K.: Cython: the best of both worlds. Comput. Sci. Eng. 13(2), 31\u201339 (2011)","journal-title":"Comput. Sci. Eng."},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10618-005-0006-6","volume":"11","author":"E Bertino","year":"2005","unstructured":"Bertino, E., Fovino, I.N., Provenza, L.P.: A framework for evaluating privacy preserving data mining algorithms. Data Min. Knowl. Discov. 11(2), 121\u2013154 (2005)","journal-title":"Data Min. Knowl. Discov."},{"key":"11_CR9","unstructured":"Bodon, F.: A fast APRIORI implementation. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 03), vol. 90, pp. 56\u201365 (2003)"},{"issue":"6","key":"11_CR10","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1002\/widm.1074","volume":"2","author":"C Borgelt","year":"2012","unstructured":"Borgelt, C.: Frequent item set mining. Wiley Interdisc. Rev. Data Min. Knowl. Discov. 2(6), 437\u2013456 (2012)","journal-title":"Wiley Interdisc. Rev. Data Min. Knowl. Discov."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: 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 99), pp. 254\u2013260 (1999)","DOI":"10.1145\/312129.312241"},{"key":"11_CR12","unstructured":"Clifton, C., Marks, D.: Security and privacy implications of data mining. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 15\u201319 (1996)"},{"key":"11_CR13","unstructured":"Clifton, C., Kantarciog\u0308lu, M., Vaidya, J.: Defining privacy for data mining. In: National Science Foundation Workshop on Next Generation Data Mining (WNGDM), pp. 126\u2013133 (2002)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45496-9_27","volume-title":"Information Hiding","author":"E Dasseni","year":"2001","unstructured":"Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E.: Hiding association rules by using confidence and support. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol. 2137, pp. 369\u2013383. Springer, Heidelberg (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-45496-9_27"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.is.2003.09.001","volume":"29","author":"A Evfimievski","year":"2004","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. Inf. Syst. 29, 343\u2013364 (2004)","journal-title":"Inf. Syst."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Gkoulalas-Divanis, A., Verykios, V.S.: An integer programming approach for frequent itemset hiding. In: CIKM, pp. 748\u2013757 (2006)","DOI":"10.1145\/1183614.1183721"},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10115-008-0178-7","volume":"20","author":"A Gkoulalas-Divanis","year":"2009","unstructured":"Gkoulalas-Divanis, A., Verykios, V.S.: Hiding sensitive knowledge without side effects. Knowl. Inf. Syst. 20(3), 263\u2013299 (2009)","journal-title":"Knowl. Inf. Syst."},{"issue":"5","key":"11_CR18","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TKDE.2008.199","volume":"21","author":"A Gkoulalas-Divanis","year":"2009","unstructured":"Gkoulalas-Divanis, A., Verykios, V.S.: Exact knowledge hiding through database extension. IEEE Trans. Knowl. Data Eng. 21(5), 699\u2013713 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"11_CR19","unstructured":"Johnsten, T., Raghavan, V.V.: A methodology for hiding Knowledge in databases. In: Proceedings of the IEEE International Conference on Privacy, Security and Data Mining (CRPIT 14), pp. 9\u201317 (2002)"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Kagklis, V., Verykios, V.S., Tzimas, G., Tsakalidis, A.K.: An integer linear programming scheme to sanitize sensitive frequent itemsets. In: International Conference on Tools with Artificial Intelligence (ICTAI 14), pp. 771\u2013775 (2014)","DOI":"10.1109\/ICTAI.2014.119"},{"key":"11_CR21","unstructured":"Leloglu, E., Ayav, T., Ergenc, B.: Coefficient-based exact approach for frequent itemset hiding. In: eKNOW2014: The 6th International Conference on Information, Process, and Knowledge Management, pp. 124\u2013130 (2014)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 00), pp. 36\u201354 (2000)","DOI":"10.1007\/3-540-44598-6_3"},{"issue":"3","key":"11_CR23","first-page":"256","volume":"16","author":"S Menon","year":"2005","unstructured":"Menon, S., Sarkar, S., Mukherjee, S.: Maximizing accuracy of shared databases when concealing sensitive patterns. INFORMS 16(3), 256\u2013270 (2005)","journal-title":"INFORMS"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.datak.2007.06.012","volume":"65","author":"GV Moustakides","year":"2008","unstructured":"Moustakides, G.V., Verykios, V.S.: A MaxMin approach for hiding frequent itemsets. Data Knowl. Eng. 65(1), 75\u201389 (2008)","journal-title":"Data Knowl. Eng."},{"key":"11_CR25","unstructured":"Oliveira, S.R., Za\u00efane, O.R.: Protecting sensitive knowledge by data sanitization. In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), pp. 99\u2013106 (2003)"},{"key":"11_CR26","unstructured":"Oliveira, S.R., Za\u00efane, O.R.: Algorithms for balancing privacy and knowledge discovery in association rule mining. In: IDEAS, pp. 54\u201365 (2003)"},{"key":"11_CR27","unstructured":"Oliveira, S.R., Za\u00efane, O.R.: Protecting sensitive knowledge by data sanitization. In: ICDM, pp. 613\u2013616 (2003)"},{"key":"11_CR28","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/1-4020-8128-6_22","volume-title":"Research Directions in Data and Applications Security XVIII","author":"ED Pontikakis","year":"2004","unstructured":"Pontikakis, E.D., Tsitsonis, A.A., Verykios, V.S.: An experimental study of distortion-based techniques for association rule hiding. In: Farkas, C., Samarati, P. (eds.) DBSec 2004. IIFIP, vol. 144, pp. 325\u2013339. Springer, Boston (2004). \n                    https:\/\/doi.org\/10.1007\/1-4020-8128-6_22"},{"key":"11_CR29","unstructured":"Pontikakis, E.D., Verykios, V.S., Theodoridis, Y.: On the comparison of association rule hiding heuristics. In: Hellenic Database Management Symposium (2004)"},{"issue":"4","key":"11_CR30","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/604264.604271","volume":"30","author":"Y Saygin","year":"2001","unstructured":"Saygin, Y., Verykios, V.S., Clifton, C.: Using unknowns to prevent discovery of association rules. SIGMOD Rec. 30(4), 45\u201354 (2001)","journal-title":"SIGMOD Rec."},{"key":"11_CR31","unstructured":"Stavropoulos, E.C., Verykios, V.S., kagklis, V.: A transversal hypergraph approach for the frequent itemset hiding problem. Knowl. Inf. Syst. 47(3), 625\u2013645 (2016)"},{"issue":"1","key":"11_CR32","doi-asserted-by":"publisher","first-page":"74","DOI":"10.5626\/JCSE.2007.1.1.074","volume":"1","author":"X Sun","year":"2007","unstructured":"Sun, X., Yu, P.S.: Hiding sensitive frequent itemsets by a border-based approach. JCSE 1(1), 74\u201394 (2007)","journal-title":"JCSE"},{"issue":"4","key":"11_CR33","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1109\/TKDE.2004.1269668","volume":"16","author":"VS Verykios","year":"2004","unstructured":"Verykios, V.S., Elmagarmi, A.K., Bertino, E., Saygin, Y., Dasseni, E.: Association rule hiding. IEEE Trans. Knowl. Data Eng. 16(4), 434\u2013447 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"11_CR34","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10619-007-7013-0","volume":"22","author":"VS Verykios","year":"2007","unstructured":"Verykios, V.S., Pontikakis, E.D., Theodoridis, Y., Chang, L.: Efficient algorithms for distortion and blocking techniques in association rule hiding. Distrib. Parallel Databases 22(1), 85\u2013104 (2007)","journal-title":"Distrib. Parallel Databases"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19759-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:51:02Z","timestamp":1558349462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19759-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030197582","9783030197599"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19759-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOCLOUD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Aspects of Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algocloud2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/algocloud\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}