{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:38:20Z","timestamp":1726061900903},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030375447"},{"type":"electronic","value":"9783030375454"}],"license":[{"start":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T00:00:00Z","timestamp":1575936000000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-37545-4_4","type":"book-chapter","created":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T15:04:51Z","timestamp":1575990291000},"page":"49-64","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Constraint-Based Model for the Frequent Itemset Hiding Problem"],"prefix":"10.1007","author":[{"given":"Vassilios S.","family":"Verykios","sequence":"first","affiliation":[]},{"given":"Elias C.","family":"Stavropoulos","sequence":"additional","affiliation":[]},{"given":"Vasilis","family":"Zorkadis","sequence":"additional","affiliation":[]},{"given":"Ahmed K.","family":"Elmagarmid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,10]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.datak.2011.10.002","volume":"72","author":"O Abul","year":"2012","unstructured":"Abul, O., G\u00f6k\u00e7e, H.: Knowledge hiding from tree and graph databases. Data Knowl. Eng. 72, 148\u2013171 (2012)","journal-title":"Data Knowl. Eng."},{"key":"4_CR2","series-title":"Advances in Database Systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-70992-5","volume-title":"Privacy-Preserving Data Mining: Models and Algorithms","author":"C Aggarwal","year":"2008","unstructured":"Aggarwal, C., Yu, P.: Privacy-Preserving Data Mining: Models and Algorithms. Advances in Database Systems. Springer, Boston (2008). \nhttps:\/\/doi.org\/10.1007\/978-0-387-70992-5"},{"key":"4_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487\u2013499 (1994)"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/335191.335438","volume":"29","author":"Rakesh Agrawal","year":"2000","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: SIGMOD Conference, pp. 439\u2013450 (2000)","journal-title":"ACM SIGMOD Record"},{"key":"4_CR5","unstructured":"Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure limitation of sensitive rules. In: KDEX Workshop, pp. 45\u201352. IEEE (1999)"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00778-006-0034-x","volume":"17","author":"M Atzori","year":"2008","unstructured":"Atzori, M., Bonchi, F., Giannotti, F., Pedreschi, D.: Anonymity preserving pattern discovery. VLDB J. 17(4), 703\u2013727 (2008)","journal-title":"VLDB J."},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/276305.276313","volume":"27","author":"Roberto J. Bayardo","year":"1998","unstructured":"Bayardo, R.: Efficiently mining long patterns from databases. In: Proceedings of SIGMOD 1998, pp. 85\u201393 (1998)","journal-title":"ACM SIGMOD Record"},{"key":"4_CR8","unstructured":"Bodon, F.: A fast APRIORI implementation. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, FIMI 2003, vol. 90, pp. 56\u201365 (2003)"},{"key":"4_CR9","series-title":"Chapman & Hall\/CRC Data Mining and Knowledge Discovery Series","volume-title":"Privacy-Aware Knowledge Discovery: Novel Applications and New Techniques","author":"F Bonchi","year":"2011","unstructured":"Bonchi, F., Ferrari, E.: Privacy-Aware Knowledge Discovery: Novel Applications and New Techniques. Chapman & Hall\/CRC Data Mining and Knowledge Discovery Series. CRC Press Inc., Boca Raton (2011)"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/s10115-005-0201-1","volume":"9","author":"F Bonchi","year":"2006","unstructured":"Bonchi, F., Lucchese, C.: On condensed representations of constrained frequent patterns. Knowl. Inf. Syst. 9(2), 180\u2013201 (2006)","journal-title":"Knowl. Inf. Syst."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-75177-9_12","volume-title":"Mobility, Data Mining and Privacy","author":"F Bonchi","year":"2008","unstructured":"Bonchi, F., et al.: Privacy in spatiotemporal data mining. In: Giannotti, F., Pedreschi, D. (eds.) Mobility, Data Mining and Privacy, pp. 297\u2013333. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-75177-9_12"},{"issue":"6","key":"4_CR12","first-page":"437","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":"4_CR13","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/0-387-25465-X_18","volume-title":"The Data Mining and Knowledge Discovery Handbook","author":"J-F Boulicaut","year":"2005","unstructured":"Boulicaut, J.-F., Jeudy, B.: Constraint-based data mining. In: Maimon, O., Rokach, L. (eds.) The Data Mining and Knowledge Discovery Handbook, pp. 399\u2013416. Springer, Boston (2005). \nhttps:\/\/doi.org\/10.1007\/0-387-25465-X_18"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Bu, S., Lakshmanan, L.V.S., Ng, R.T., Ramesh, G.: Preservation of patterns and input-output privacy. In: ICDE, pp. 696\u2013705 (2007)","DOI":"10.1109\/ICDE.2007.367915"},{"key":"4_CR15","series-title":"IFIP \u2014 The International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-0-387-35508-5_13","volume-title":"Research Advances in Database and Information Systems Security","author":"C Clifton","year":"2000","unstructured":"Clifton, C.: Protecting against data mining through samples. In: Atluri, V., Hale, J. (eds.) Research Advances in Database and Information Systems Security. ITIFIP, vol. 43, pp. 193\u2013207. Springer, Boston, MA (2000). \nhttps:\/\/doi.org\/10.1007\/978-0-387-35508-5_13"},{"key":"4_CR16","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). \nhttps:\/\/doi.org\/10.1007\/3-540-45496-9_27"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Delis, A., Verykios, V.S., Tsitsonis, A.A.: A data perturbation approach to sensitive classification rule hiding. In: SAC, pp. 605\u2013609 (2010)","DOI":"10.1145\/1774088.1774216"},{"issue":"4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.is.2003.09.001","volume":"29","author":"AV Evfimievski","year":"2004","unstructured":"Evfimievski, A.V., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. Inf. Syst. 29(4), 343\u2013364 (2004)","journal-title":"Inf. Syst."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21, 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"key":"4_CR20","unstructured":"Frequent Itemset Mining Dataset Repository. \nhttp:\/\/fimi.ua.ac.be\/data\/"},{"key":"4_CR21","series-title":"Advances in Database Systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6569-1","volume-title":"Association Rule Hiding for Data Mining","author":"A Gkoulalas-Divanis","year":"2010","unstructured":"Gkoulalas-Divanis, A., Verykios, V.: Association Rule Hiding for Data Mining. Advances in Database Systems. Springer, Boston (2010). \nhttps:\/\/doi.org\/10.1007\/978-1-4419-6569-1"},{"key":"4_CR22","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":"5","key":"4_CR23","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."},{"issue":"3","key":"4_CR24","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."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0166-218X(99)00099-2","volume":"96\u201397","author":"V Gurvich","year":"1999","unstructured":"Gurvich, V., Khachiyan, L.: Hiding sensitive knowledge without side effects. Discrete Appl. Math. 96\u201397, 363\u2013373 (1999)","journal-title":"Discrete Appl. Math."},{"key":"4_CR26","unstructured":"IBM Basket Data Generator. \nhttp:\/\/sourceforge.net\/projects\/ibmquestdatagen\/"},{"issue":"9","key":"4_CR27","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M Kantarcioglu","year":"2004","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng. 16(9), 1026\u20131037 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Kantarcioglu, M., Jin, J., Clifton, C.: When do data mining results violate privacy? In: KDD, pp. 599\u2013604 (2004)","DOI":"10.1145\/1014052.1014126"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Kohavi, R., Brodley, C., Frasca, B., Mason, L., Zheng, Z.: KDD-Cup 2000 organizers\u2019 report: peeling the onion. SIGKDD Explor. 2(2), 86\u201398 (2000). \nhttp:\/\/www.ecn.purdue.edu\/KDDCUP","DOI":"10.1145\/380995.381033"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"Yehuda Lindell","year":"2000","unstructured":"Lindell,Y., Pinkas, B.: Privacy preserving data mining. In: CRYPTO, pp. 36\u201354 (2000)"},{"issue":"1","key":"4_CR31","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/mnsc.1060.0603","volume":"53","author":"S Menon","year":"2007","unstructured":"Menon, S., Sarkar, S.: Minimizing information loss and preserving privacy. Manag. Sci. 53(1), 101\u2013116 (2007)","journal-title":"Manag. Sci."},{"issue":"3","key":"4_CR32","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1287\/isre.1050.0056","volume":"16","author":"S Menon","year":"2005","unstructured":"Menon, S., Sarkar, S., Mukherjee, S.: Maximizing accuracy of shared databases when concealing sensitive patterns. Inf. Syst. Res. 16(3), 256\u2013270 (2005)","journal-title":"Inf. Syst. Res."},{"issue":"1","key":"4_CR33","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":"4_CR34","unstructured":"Oliveira, S.R.M., Za\u00efane,O.R.: Algorithms for balancing privacy and knowledge discovery in association rule mining. In: IDEAS, pp. 54\u201365 (2003)"},{"key":"4_CR35","unstructured":"Oliveira, S.R.M., Za\u00efane,O.R.: Protecting sensitive knowledge by data sanitization. In: ICDM, pp. 613\u2013616 (2003)"},{"key":"4_CR36","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1016\/B978-155860869-6\/50066-4","volume-title":"VLDB '02: Proceedings of the 28th International Conference on Very Large Databases","author":"Shariq J. Rizvi","year":"2002","unstructured":"Rizvi, S., Haritsa, J.R.: Maintaining data privacy in association rule mining. In: VLDB, pp. 682\u2013693 (2002)"},{"issue":"4","key":"4_CR37","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":"4_CR38","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: KDD, pp. 67\u201373 (1997)"},{"issue":"3","key":"4_CR39","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s10115-015-0862-3","volume":"47","author":"EC Stavropoulos","year":"2016","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)","journal-title":"Knowl. Inf. Syst."},{"key":"4_CR40","unstructured":"Sun, X., Yu, P.S.: A border-based approach for hiding sensitive frequent itemsets. In: ICDM, pp. 426\u2013433 (2005)"},{"issue":"1","key":"4_CR41","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":"4_CR42","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1109\/TKDE.2004.1269668","volume":"16","author":"VS Verykios","year":"2004","unstructured":"Verykios, V.S., Elmagarmid, 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":"4_CR43","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":["Communications in Computer and Information Science","E-Democracy \u2013 Safeguarding Democracy and Human Rights in the Digital Age"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37545-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T15:05:45Z","timestamp":1575990345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37545-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,10]]},"ISBN":["9783030375447","9783030375454"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37545-4_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019,12,10]]},"assertion":[{"value":"10 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"e-Democracy","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on e-Democracy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"edemocracy2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/edemocracy2019.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}