{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:54:48Z","timestamp":1764996888480,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642122132"},{"type":"electronic","value":"9783642122149"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12214-9_96","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T19:11:44Z","timestamp":1270062704000},"page":"538-544","source":"Crossref","is-referenced-by-count":4,"title":["A Survey on Preserving Privacy for Sensitive Association Rules in Databases"],"prefix":"10.1007","author":[{"given":"Chirag","family":"Modi","sequence":"first","affiliation":[]},{"given":"U. P.","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Dhiren R.","family":"Patel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"96_CR1","doi-asserted-by":"crossref","unstructured":"Atallah, M., Bertino, E., Elmagarmid, A.K., Ibrahim, M., Verykios, V.S.: Disclosure limitation of sensitive rules. In: Proc. of the 1999 IEEE Knowledge and Data Engineering Exchange Workshop (KDEX 1999), pp. 45\u201352 (1999)","DOI":"10.1109\/KDEX.1999.836532"},{"key":"96_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-540-24775-3_10","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S.R.M. Oliveira","year":"2004","unstructured":"Oliveira, S.R.M., Za\u00efane, O.R., Sayg\u0131n, Y.: Secure Association Rule Sharing. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 74\u201385. Springer, Heidelberg (2004)"},{"key":"96_CR3","doi-asserted-by":"crossref","unstructured":"Gkoulalas-Divanis, A., Verykios, V.S.: An Integer Programming Approach for Frequent Itemset Hiding. In: Proc. ACM Conf. Information and Knowledge Management (CIKM 2006), pp. 748\u2013757 (2006)","DOI":"10.1145\/1183614.1183721"},{"issue":"4","key":"96_CR4","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. ACM SIGMOD\u00a030(4), 45\u201354 (2001)","journal-title":"ACM SIGMOD"},{"key":"96_CR5","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: Proc. Int\u2019l. Conf. Knowledge Discovery and Data Mining, pp. 639\u2013644 (2002)","DOI":"10.1145\/775047.775142"},{"key":"96_CR6","first-page":"18","volume-title":"Proc. 3rd IEEE ICDM Workshop on Privacy Preserving Data Mining","author":"T. Mielikainen","year":"2003","unstructured":"Mielikainen, T.: On inverse frequent set mining. In: Proc. 3rd IEEE ICDM Workshop on Privacy Preserving Data Mining, pp. 18\u201323. IEEE Computer Society, Los Alamitos (2003)"},{"key":"96_CR7","unstructured":"Sun, X., Yu, P.S.: A Border-Based Approach for Hiding Sensitive Frequent Itemsets. In: Proc. Fifth IEEE Int\u2019l. Conf. Data Mining (ICDM 2005), pp. 426\u2013433 (2005)"},{"issue":"4","key":"96_CR8","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1109\/TKDE.2004.1269668","volume":"16","author":"V.S. Verykios","year":"2004","unstructured":"Verykios, V.S., Elmagarmid, A.K., Bertino, E., Saygin, Y., Dasseni, E.: Association rule hiding. IEEE Transactions on Knowledge and Data Engineering\u00a016(4), 434\u2013447 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"5","key":"96_CR9","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 Transactions on Knowledge and Data Engineering\u00a021(5), 699\u2013713 (2009)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"96_CR10","doi-asserted-by":"crossref","unstructured":"Moustakides, G.V., Verykios, V.S.: A Max-Min Approach for Hiding Frequent Itemsets. In: Proc. Sixth IEEE Int\u2019l. Conf. Data Mining (ICDM 2006), pp. 502\u2013506 (2006)","DOI":"10.1109\/ICDMW.2006.8"},{"issue":"1","key":"96_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TKDE.2007.250583","volume":"19","author":"Y.H. Wu","year":"2007","unstructured":"Wu, Y.H., Chiang, C.M., Chen, A.L.P.: Hiding Sensitive Association Rules with Limited Side Effects. IEEE Transactions on Knowledge and Data Engineering\u00a019(1), 29\u201342 (2007)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"96_CR12","doi-asserted-by":"crossref","unstructured":"Saygin, Y., Verykios, V.S., Elmagarmid, A.K.: Privacy preserving association rule mining. In: Proc. Int\u2019l. Workshop on Research Issues in Data Engineering (RIDE 2002), pp. 151\u2013163 (2002)","DOI":"10.1109\/RIDE.2002.995109"},{"key":"96_CR13","unstructured":"Guo, Y.: Reconstruction-Based Association Rule Hiding. In: Proc. of SIGMOD 2007 Ph.D. Workshop on Innovative Database Research (2007)"},{"key":"96_CR14","doi-asserted-by":"crossref","unstructured":"Wang, S.L., Jafari, A.: Using unknowns for hiding sensitive predictive association rules. In: Proc. IEEE Int\u2019l. Conf. Information Reuse and Integration (IRI 2005), pp. 223\u2013228 (2005)","DOI":"10.1109\/IRI-05.2005.1506477"},{"key":"96_CR15","doi-asserted-by":"crossref","unstructured":"Duraiswamy, K., Manjula, D.: Advanced approach in sensitive rule hiding. Modern Applied Science\u00a03(2) (2009)","DOI":"10.5539\/mas.v3n2p98"},{"issue":"9","key":"96_CR16","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 Transactions on Knowledge and Data Engineering\u00a016(9), 1026\u20131037 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"96_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-0-387-70992-5","volume-title":"Privacy-Preserving Data Mining: Models and Algorithms","author":"C.C. Aggarwal","year":"2008","unstructured":"Aggarwal, C.C., Yu, P.S.: Privacy-Preserving Data Mining: Models and Algorithms, pp. 267\u2013286. Springer, Heidelberg (2008)"},{"key":"96_CR18","first-page":"227","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2001","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques, pp. 227\u2013245. Morgan Kaufmann Publishers, San Francisco (2001)"}],"container-title":["Communications in Computer and Information Science","Information Processing and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12214-9_96.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T20:11:22Z","timestamp":1739995882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12214-9_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122132","9783642122149"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12214-9_96","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}