{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T10:07:12Z","timestamp":1658743632412},"reference-count":42,"publisher":"IGI Global","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,10,1]]},"abstract":"
This paper proposes a novel exact approach that relies on integer programming for association rule hiding. A large panorama of solutions exists for the complex problem of itemset hiding: from practical heuristic approaches to more accurate exact approaches. Exact approaches provide better solutions while suffering from the lack of performance and existing exact approaches still augment their methods with heuristics to make the problem solvable. In this case, the solution may not be optimum. This work presents a full-exact method, without any need for heuristics. Extensive tests are conducted on 10 real datasets to analyze distance and information loss performances of the algorithm in comparison to a former similar algorithm. Since the approach provides the optimum solution to the problem, it should be considered as a reference method.<\/p>","DOI":"10.4018\/ijdwm.2015100103","type":"journal-article","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T19:56:53Z","timestamp":1434398213000},"page":"49-63","source":"Crossref","is-referenced-by-count":3,"title":["Full-Exact Approach for Frequent Itemset Hiding"],"prefix":"10.4018","volume":"11","author":[{"given":"Tolga","family":"Ayav","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Izmir Institute of Technology, Izmir, Turkey"}]},{"given":"Belgin","family":"Ergenc","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Izmir Institute of Technology, Izmir, Turkey & Department of Computer Engineering, Dokuz Eylul University, Izmir, Turkey"}]}],"member":"2432","reference":[{"key":"ijdwm.2015100103-0","article-title":"Hiding co-occuring frequent itemsets.","author":"O.Abul","year":"2009","journal-title":"2nd International Workshop on Privacy and Anonymity in the Information Society (PAIS)"},{"key":"ijdwm.2015100103-1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imilinski, T., and Swami, A. (1993). Mining association rules between sets of items in large databases.","DOI":"10.1145\/170035.170072"},{"key":"ijdwm.2015100103-2","author":"R.Agrawal","year":"1994","journal-title":"Fast algorithms for mining association rules in large databases"},{"key":"ijdwm.2015100103-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2006.08.007"},{"key":"ijdwm.2015100103-4","first-page":"45","article-title":"Disclosure limitation of sensitive rules.","author":"M.Atallah","year":"1999","journal-title":"Workshop on Knowledge and Data Engineering Exchange"},{"key":"ijdwm.2015100103-5","unstructured":"Ayav, T. (2013). PPDM: Privacy Preserving Data Mining Toolkit."},{"key":"ijdwm.2015100103-6","author":"F.Bonchi","year":"2011","journal-title":"Privacy-aware knowledge discovery novel applications and new techniques"},{"issue":"3","key":"ijdwm.2015100103-7","first-page":"216","article-title":"An improved approach to high level privacy preserving itemset mining.","volume":"6","author":"R. K.Boora","year":"2009","journal-title":"International Journal of Computer Science and Information Security"},{"key":"ijdwm.2015100103-8","unstructured":"Borgelt, C. (2003). Apriori - Association Rule Induction \/ Frequent Item Set Mining Toolkit."},{"key":"ijdwm.2015100103-9","author":"F.Coenen","year":"2003"},{"key":"ijdwm.2015100103-10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45496-9_27"},{"key":"ijdwm.2015100103-11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09699-5_23"},{"key":"ijdwm.2015100103-12","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183721"},{"key":"ijdwm.2015100103-13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.199"},{"key":"ijdwm.2015100103-14","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-008-0178-7"},{"key":"ijdwm.2015100103-15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6569-1"},{"key":"ijdwm.2015100103-16","unstructured":"GLPK. (2000). GNU Linear Programming Kit. http:\/\/www.gnu.org\/software\/glpk"},{"key":"ijdwm.2015100103-17","unstructured":"Guo, Y. (2007). Reconstruction-based association rule hiding. In SIGMOD Ph.D. Workshop on Innovative Database Research. http:\/\/www.borgelt.net\/apriori.html"},{"key":"ijdwm.2015100103-18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0"},{"key":"ijdwm.2015100103-19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"issue":"3","key":"ijdwm.2015100103-20","article-title":"Hiding sensitive association rule using clusters of sensitive association rule.","volume":"1","author":"S.Keer","year":"2012","journal-title":"International Journal of Computer Science and Network"},{"key":"ijdwm.2015100103-21","unstructured":"Kuo, Y., Lin, P.Y., and Dai, B.R. (2008). Hiding frequent patterns under multiple sensitive thresholds."},{"key":"ijdwm.2015100103-22","unstructured":"Leloglu, E., Ayav, T., & Ergenc, B. (2014). Coefficient-based exact approach for frequent itemset hiding. In eKNOW 2014:The Sixth International Conference on Information, Process, and Knowledge Management, pages 124\u2013139."},{"key":"ijdwm.2015100103-23","doi-asserted-by":"publisher","DOI":"10.1145\/1244002.1244092"},{"key":"ijdwm.2015100103-24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009796218281"},{"key":"ijdwm.2015100103-25","doi-asserted-by":"publisher","DOI":"10.1287\/isre.1050.0056"},{"key":"ijdwm.2015100103-26","first-page":"18","article-title":"On inverse frequent set mining.","author":"T.Mielikainen","year":"2003","journal-title":"IEEE ICDM Workshop on Privacy Preserving Data Mining"},{"key":"ijdwm.2015100103-27","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E93.D.315"},{"key":"ijdwm.2015100103-28","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.06.012"},{"key":"ijdwm.2015100103-29","first-page":"43","article-title":"Privacy preserving frequent itemset mining.","author":"S. R. M.Oliveira","year":"2002","journal-title":"International Conference on Data Mining, ICDM"},{"key":"ijdwm.2015100103-30","doi-asserted-by":"publisher","DOI":"10.1109\/IDEAS.2003.1214911"},{"key":"ijdwm.2015100103-31","first-page":"211","article-title":"Protecting sensitive knowledge by data sanitization.","author":"S. R. M.Oliveira","year":"2003","journal-title":"3rd IEEE International Conference on Data Mining (ICDM)"},{"key":"ijdwm.2015100103-32","doi-asserted-by":"publisher","DOI":"10.1145\/604264.604271"},{"key":"ijdwm.2015100103-33","doi-asserted-by":"publisher","DOI":"10.5626\/JCSE.2007.1.1.074"},{"key":"ijdwm.2015100103-34","first-page":"426","article-title":"A border-based approach for hiding sensitive frequent itemsets.","author":"X.Sun","year":"2005","journal-title":"5th IEEE International Conference on Data Mining (ICDM)"},{"key":"ijdwm.2015100103-35","first-page":"639","article-title":"Privacy preserving association rule mining in vertically partitioned data.","author":"J.Vaidya","year":"2001","journal-title":"The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"ijdwm.2015100103-36","unstructured":"https:\/\/code.google.com\/p\/privacy-preserving-data-mining\/. Version 1.0."},{"key":"ijdwm.2015100103-37","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269668"},{"key":"ijdwm.2015100103-38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.07.039"},{"key":"ijdwm.2015100103-39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.250583"},{"key":"ijdwm.2015100103-40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.12.038"},{"key":"ijdwm.2015100103-41","doi-asserted-by":"crossref","unstructured":"Yildiz, B. and Ergenc, B. (2012). Integrated approach for privacy preserving itemset mining.","DOI":"10.1007\/978-1-4614-1695-1_19"}],"container-title":["International Journal of Data Warehousing and Mining"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=130666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T04:44:22Z","timestamp":1654145062000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijdwm.2015100103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2015,10,1]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,10]]}},"URL":"http:\/\/dx.doi.org\/10.4018\/ijdwm.2015100103","relation":{},"ISSN":["1548-3924","1548-3932"],"issn-type":[{"value":"1548-3924","type":"print"},{"value":"1548-3932","type":"electronic"}],"subject":["Hardware and Architecture","Software"],"published":{"date-parts":[[2015,10,1]]}}}