{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:33:06Z","timestamp":1760707986889},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,11,14]],"date-time":"2008-11-14T00:00:00Z","timestamp":1226620800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10115-008-0178-7","type":"journal-article","created":{"date-parts":[[2008,11,13]],"date-time":"2008-11-13T10:14:21Z","timestamp":1226571261000},"page":"263-299","source":"Crossref","is-referenced-by-count":48,"title":["Hiding sensitive knowledge without side effects"],"prefix":"10.1007","volume":"20","author":[{"given":"Aris","family":"Gkoulalas-Divanis","sequence":"first","affiliation":[]},{"given":"Vassilios S.","family":"Verykios","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,14]]},"reference":[{"issue":"1","key":"178_CR1","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal R, Shafer JC (1996) Parallel mining of association rules. IEEE Trans Knowl Data Eng (TKDE) 8(1): 962\u2013969","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"178_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 Databases (VLDB), pp 487\u2013499"},{"key":"178_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, pp 439\u2013450","DOI":"10.1145\/342009.335438"},{"key":"178_CR4","unstructured":"Atallah M, Bertino E, Elmagarmid A, Ibrahim M, Verykios VS (1999) Disclosure limitation of sensitive rules. In: Proceedings of the 1999 IEEE Knowledge and Data Engineering Exchange Workshop (KDEX), pp 45\u201352"},{"key":"178_CR5","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","DOI":"10.1145\/276304.276313"},{"issue":"2","key":"178_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10618-005-0006-6","volume":"11","author":"E Bertino","year":"2005","unstructured":"Bertino E, Fovino IN, Povenza LP (2005) A framework for evaluating privacy preserving data mining algorithms. Data Mining Knowl Discov (DMKD) 11(2): 121\u2013154","journal-title":"Data Mining Knowl Discov (DMKD)"},{"key":"178_CR7","doi-asserted-by":"crossref","unstructured":"Cheung D, Xiao Y (1998) Effect of data skewness in parallel mining of association rules. In: Proceedings of the 2nd Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining (PAKDD), pp 48\u201360","DOI":"10.1007\/3-540-64383-4_5"},{"key":"178_CR8","unstructured":"Clifton C, Kantarciog\u0308lu M, Vaidya J (2002) Defining privacy for data mining. National Science Foundation Workshop on Next Generation Data Mining (WNGDM), pp 126\u2013133"},{"key":"178_CR9","unstructured":"Clifton C, Marks D (1996) Security and privacy implications of data mining. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp 15\u201319"},{"key":"178_CR10","doi-asserted-by":"crossref","unstructured":"Dasseni E, Verykios VS, Elmagarmid AK, Bertino E (2001) Hiding association rules by using confidence and support. In: Proceedings of the 4th International Workshop on Information Hiding, pp 369\u2013383","DOI":"10.1007\/3-540-45496-9_27"},{"key":"178_CR11","doi-asserted-by":"crossref","unstructured":"Evfimievski A, Srikant R, Agrawal R, Gehrke J (2002) Privacy preserving mining of association rules. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 343\u2013364","DOI":"10.1145\/775047.775080"},{"issue":"2","key":"178_CR12","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/772862.772864","volume":"4","author":"C Farkas","year":"2002","unstructured":"Farkas C, Jajodia S (2002) The inference problem: a survey. ACM SIGKDD Exploration Newsl 4(2): 6\u201311","journal-title":"ACM SIGKDD Exploration Newsl"},{"issue":"2","key":"178_CR13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10618-005-0010-x","volume":"11","author":"S Fienberg","year":"2005","unstructured":"Fienberg S, Slavkovic A (2005) Preserving the confidentiality of categorical statistical data bases when releasing information for association rules. Data Mining Knowl Discov (DMKD) 11(2): 155\u2013180","journal-title":"Data Mining Knowl Discov (DMKD)"},{"key":"178_CR14","doi-asserted-by":"crossref","unstructured":"Gkoulalas-Divanis A, Verykios VS (2006) An integer programming approach for frequent itemset hiding. In: Proceedings of the 2006 ACM Conference on Information and Knowledge Management (CIKM)","DOI":"10.1145\/1183614.1183721"},{"key":"178_CR15","doi-asserted-by":"crossref","unstructured":"Gkoulalas-Divanis A, Verykios VS (2007) A hybrid approach to frequent itemset hiding. In: Proceedings of the 2007 IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp 297\u2013304","DOI":"10.1109\/ICTAI.2007.68"},{"key":"178_CR16","unstructured":"Han E-H, Karypis G, Kumar V (2007) Scalable parallel data mining for association rules. In: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, pp 277\u2013288"},{"key":"178_CR17","unstructured":"ILOG CPLEX 9.0 User\u2019s Manual (2003) ILOG Inc, Gentilly, France"},{"issue":"9","key":"178_CR18","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M Kantarciog\u0308lu","year":"2004","unstructured":"Kantarciog\u0308lu M, Clifton C (2004) Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans Knowl Data Eng (TKDE) 16(9): 1026\u20131037","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"issue":"4","key":"178_CR19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10115-004-0173-6","volume":"7","author":"H Kargupta","year":"2005","unstructured":"Kargupta H, Datta S, Wang Q, Sivakumar K (2005) Random-data perturbation techniques and privacy-preserving data mining. Knowl Inform Syst (KAIS) 7(4): 387\u2013414","journal-title":"Knowl Inform Syst (KAIS)"},{"issue":"1","key":"178_CR20","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1): 359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"178_CR21","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"},{"issue":"3","key":"178_CR22","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/PL00011672","volume":"3","author":"G Lee","year":"2001","unstructured":"Lee G, Lee K, Chen A (2001) Efficient graph-based algorithms for discovering and maintaining association rules in large databases. Knowl Inform Syst (KAIS) 3(3): 338\u2013355","journal-title":"Knowl Inform Syst (KAIS)"},{"issue":"3","key":"178_CR23","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. Inform Syst Res 16(3): 256\u2013270","journal-title":"Inform Syst Res"},{"key":"178_CR24","doi-asserted-by":"crossref","unstructured":"Morgenstern M (1988) Controlling logical inference in multilevel database and knowledge-base systems. In: Proceedings of the 1988 IEEE Symposium on Security and Privacy, pp 245\u2013255","DOI":"10.1109\/SECPRI.1988.8116"},{"key":"178_CR25","doi-asserted-by":"crossref","unstructured":"Moustakides G, Verykios VS (2006) A max-min approach for hiding frequent itemsets. In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM), pp 502\u2013506","DOI":"10.1109\/ICDMW.2006.8"},{"key":"178_CR26","unstructured":"Oliveira SRM, Za\u00efane OR (2002) Privacy preserving frequent itemset mining. In: Proceedings of the 2002 IEEE International Conference on Privacy, Security and Data Mining (CRPITS), pp 43\u201354"},{"key":"178_CR27","doi-asserted-by":"crossref","unstructured":"Oliveira SRM, Za\u00efane OR (2003) Protecting sensitive knowledge by data sanitization. In: Proceedings of the Third IEEE International Conference on Data Mining (ICDM), pp 211\u2013218","DOI":"10.1109\/ICDM.2003.1250990"},{"issue":"1","key":"178_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00011656","volume":"3","author":"S Parthasarathy","year":"2001","unstructured":"Parthasarathy S, Zaki M, Ogihara M, Li W (2001) Parallel data mining for association rules on shared-memory systems. Knowl Inform Syst (KAIS) 3(1): 1\u201329","journal-title":"Knowl Inform Syst (KAIS)"},{"key":"178_CR29","doi-asserted-by":"crossref","unstructured":"Pontikakis E, Theodoridis Y, Tsitsonis A, Chang L, Verykios VS (2004) A quantitative and qualitative analysis of blocking in association rule hiding. In: Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society (WPES), pp 29\u201330","DOI":"10.1145\/1029179.1029187"},{"key":"178_CR30","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 Databases (VLDB)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"issue":"4","key":"178_CR31","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/604264.604271","volume":"30","author":"Y Saygin","year":"2001","unstructured":"Saygin Y, Verykios VS, Clifton C (2001) Using unknowns to prevent discovery of association rules. ACM SIGMOD Record 30(4): 45\u201354","journal-title":"ACM SIGMOD Record"},{"key":"178_CR32","unstructured":"Sun X, Yu PS (2005) A border-based approach for hiding sensitive frequent itemsets. In: Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM), pp 426\u2013433"},{"key":"178_CR33","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C (2002) Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 639\u2013644","DOI":"10.1145\/775047.775142"},{"issue":"1","key":"178_CR34","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/974121.974131","volume":"33","author":"VS Verykios","year":"2004","unstructured":"Verykios VS, Bertino E, Fovino IN, Provenza LP, Saygin Y, Theodoridis Y (2004a) State-of-the-art in privacy preserving data mining. ACM SIGMOD Record 33(1): 50\u201357","journal-title":"ACM SIGMOD Record"},{"issue":"4","key":"178_CR35","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/TKDE.2004.1269668","volume":"16","author":"VS Verykios","year":"2004","unstructured":"Verykios VS, Emagarmid AK, Bertino E, Saygin Y, Dasseni E (2004b) Association rule hiding. IEEE Trans Knowl Data Eng (TKDE) 16(4): 434\u2013447","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"issue":"3","key":"178_CR36","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10115-006-0001-2","volume":"10","author":"S Xu","year":"2006","unstructured":"Xu S, Zhang J, Han D, Wang J (2006) Singular value decomposition based data distortion strategy for privacy protection. Knowl Inform Syst (KAIS) 10(3): 383\u2013397","journal-title":"Knowl Inform Syst (KAIS)"},{"issue":"5","key":"178_CR37","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/69.729707","volume":"10","author":"M Yokoo","year":"1998","unstructured":"Yokoo M, Durfee E, Ishida T, Kuwabara K (1998) The distributed constraint satisfaction problem: formalization and algorithms. IEEE Trans Knowl Data Eng (TKDE) 10(5): 673\u2013685","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"178_CR38","doi-asserted-by":"crossref","unstructured":"Za\u00efane OR, El-Hajj M, Lu P (2001) Fast parallel association rule mining without candidacy generation. In: Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM), pp 665\u2013668","DOI":"10.1109\/ICDM.2001.989600"},{"issue":"4","key":"178_CR39","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1007\/s101150200016","volume":"4","author":"Q Zou","year":"2002","unstructured":"Zou Q, Chu W, Johnson D, Chiu H (2002) A pattern decomposition algorithm for data mining of frequent patterns. Knowl Inform Syst (KAIS) 4(4): 466\u2013482","journal-title":"Knowl Inform Syst (KAIS)"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-008-0178-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-008-0178-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-008-0178-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:18Z","timestamp":1559110218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-008-0178-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,14]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["178"],"URL":"https:\/\/doi.org\/10.1007\/s10115-008-0178-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,14]]}}}