{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:30:42Z","timestamp":1742394642789,"version":"3.32.0"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,11,4]],"date-time":"2006-11-04T00:00:00Z","timestamp":1162598400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00778-006-0034-x","type":"journal-article","created":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T10:32:27Z","timestamp":1162549947000},"page":"703-727","source":"Crossref","is-referenced-by-count":65,"title":["Anonymity preserving pattern discovery"],"prefix":"10.1007","volume":"17","author":[{"given":"Maurizio","family":"Atzori","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[]},{"given":"Fosca","family":"Giannotti","sequence":"additional","affiliation":[]},{"given":"Dino","family":"Pedreschi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,4]]},"reference":[{"key":"34_CR1","unstructured":"Aggarwal, C.C.: On k-anonymity and the curse of dimensionality. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 901\u2013909 (2005)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the 20th ACM PODS (2001)","DOI":"10.1145\/375551.375602"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD (1993)","DOI":"10.1145\/170035.170072"},{"key":"34_CR4","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th VLDB 1994"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD on Management of Data (2000)","DOI":"10.1145\/342009.335438"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Haritsa, J.R.: A framework for high-accuracy privacy-preserving mining. In: Proceedings of the 22nd IEEE International Conference on Data Engineering (ICDE), pp. 193\u2013204 (2005)","DOI":"10.1109\/ICDE.2005.8"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Atallah, M., Elmagarmid, A., Ibrahim, M., Bertino, E., , V.: Disclosure limitation of sensitive rules. In: Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange, p. 45. IEEE Computer Society (1999)","DOI":"10.1109\/KDEX.1999.836532"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Atzori, M.: Weak k-anonymity: a low-distortion model for protecting privacy. In: Information Security, International 8th Conference (ISC06), Proceedings, PP. 60\u201371 (2006)","DOI":"10.1007\/11836810_5"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Atzori, M., Bonchi, F., Giannotti, F., Pedreschi, D.: Blocking anonymity threats raised by frequent itemset mining. In: Proceedings of 5th IEEE International Conference on Data Mining (ICDM\u201905), pp. 561\u2013564 (2005)","DOI":"10.1109\/ICDM.2005.37"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Atzori, M., Bonchi, F., Giannotti, F., Pedreschi, D.: k-anonymous patterns. In: Proceedings of 9th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD\u201905) (2005)","DOI":"10.1007\/11564126_7"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Calders, T.: Computational complexity of itemset frequency satisfiability. In: Proceedings of PODS International Conference Principles of Database Systems (2004)","DOI":"10.1145\/1055558.1055580"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Proceedings of the 6th PKDD (2002)","DOI":"10.1007\/3-540-45681-3_7"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Chang, L., Moskowitz, I.S.: An integrated framework for database inference and privacy protection. In: Data and Applications Security (2000)","DOI":"10.21236\/ADA465125"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Cheung, D., Han, J., Ng, V., Fu, A., Fu, Y.: A fast distributed algorithm for mining association rules. In: l4th International Conference on Parallel and Distributed Information Systems (PDIS\u201996) (1996)","DOI":"10.1109\/PDIS.1996.568665"},{"key":"34_CR15","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J.: Defining privacy for data mining. In: Natural Science Foundation Workshop on Next Generation Data Mining (2002)"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving distributed data mining. SIGKDD Explor. Newsl. 4(2), (2002)","DOI":"10.1145\/772862.772867"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E.: Hiding association rules by using confidence and support. In: Proceedings of the 4th International Workshop on Information Hiding (2001)","DOI":"10.1007\/3-540-45496-9_27"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Du, W., Atallah, M.J. : Secure multi-party computation problems and their applications: a review and open problems. In: Proceedings of the 2001 Workshop on New Security Paradigms (2001)","DOI":"10.1145\/508171.508174"},{"key":"34_CR19","unstructured":"Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Proceedings of the IEEE International Conference on Privacy, Security and Data Mining (2002)"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Du, W., Zhan, Z.: Using randomized response techniques for privacy-preserving data mining. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)","DOI":"10.1145\/956750.956810"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Estivill-Castro, V., Brankovic, L.: Data swapping: Balancing privacy against precision in mining for logic rules. In: Proceedings of the 1st International Conference on Data Warehousing and Knowledge Discovery (1999)","DOI":"10.1007\/3-540-48298-9_41"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Evfimievski, A.: Randomization in privacy preserving data mining. SIGKDD Explor. Newsl. 4(2), (2002)","DOI":"10.1145\/772862.772869"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Gehrke, J., Srikant, R.: Limiting privacy breaches in privacy preserving data mining. In: Proceedings of the Twenty-Second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (2003)","DOI":"10.1145\/773153.773174"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002)","DOI":"10.1145\/775047.775080"},{"key":"34_CR25","unstructured":"FIMI repository. http:\/\/fimi.cs.helsinki.fi\/data\/"},{"key":"34_CR26","unstructured":"Fule, P., Roddick, J.F.: Detecting privacy and ethical sensitivity in data mining results. In: Proceedings of the 27th conference on Australasian computer science (2004)"},{"key":"34_CR27","volume-title":"Principles of Data Mining","author":"D. Hand","year":"2001","unstructured":"Hand D., Mannila H., Smyh P. (2001) Principles of Data Mining. MIT Press, Cambridge"},{"key":"34_CR28","doi-asserted-by":"crossref","unstructured":"Hintoglu, A.A., Inan, A., Saygin, Y., Keskin\u00f6z, M.: Suppressing data sets to prevent discovery of association rules. In: Proceedings of 5th IEEE International Conference on Data Mining (ICDM\u201905), pp. 645\u2013648 (2005)","DOI":"10.1109\/ICDM.2005.140"},{"key":"34_CR29","doi-asserted-by":"crossref","unstructured":"Huang, Z., Du, W., Chen, B.: Deriving private information from randomized data. In: SIGMOD\u201905: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 37\u201348 (2005)","DOI":"10.1145\/1066157.1066163"},{"key":"34_CR30","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A., Atallah, M.: A secure protocol for computing dot-products in clustered and distributed environments. In: Proceedings of the International Conference on Parallel Processing (ICPP\u201902) (2002)","DOI":"10.1109\/ICPP.2002.1040894"},{"key":"34_CR31","unstructured":"Islam, M.Z., Brankovic, L.: A framework for privacy preserving classification in data mining. In: Proceedings of the 2nd Workshop on Australasian Information Security, Data Mining and Web Intelligence, and Software Internationalisation, pp. 163\u2013168 (2004)"},{"volume-title":"Medical Data Mining and Knowledge Discovery","year":"2001","key":"34_CR32","unstructured":"Kacprzyk J., Cios K. (eds) (2001) Medical Data Mining and Knowledge Discovery. Physica-Verlag, Heidelberg"},{"key":"34_CR33","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. In: The ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD\u201902) (2002)"},{"key":"34_CR34","doi-asserted-by":"crossref","unstructured":"Kantarcioglu, M., Jin, J., Clifton, C.: When do data mining results violate privacy? In: Proceedings of the 10th ACM SIGKDD (2004)","DOI":"10.1145\/1014052.1014126"},{"key":"34_CR35","doi-asserted-by":"crossref","unstructured":"Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: Proceedings of the 3rd IEEE International Conference on Data Mining (2003)","DOI":"10.1109\/ICDM.2003.1250908"},{"key":"34_CR36","doi-asserted-by":"crossref","unstructured":"Kifer, D., Gehrke, J.: Injecting utility into anonymized datasets. In: SIGMOD \u201906: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, pp. 217\u2013228 (2006)","DOI":"10.1145\/1142473.1142499"},{"key":"34_CR37","volume-title":"Fundamental Algorithms","author":"D. Knuth","year":"1997","unstructured":"Knuth D. (1997) Fundamental Algorithms. Addison-Wesley, Reading"},{"key":"34_CR38","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: efficient full-domain k-anonymity. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 49\u201360 (2005)","DOI":"10.1145\/1066157.1066164"},{"key":"34_CR39","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-Diversity: privacy beyond k-anonymity. In:Proceedings of the 22nd IEEE International Conference on Data Engineering (ICDE), Atlanta, GA, USA (2006)","DOI":"10.1109\/ICDE.2006.1"},{"key":"34_CR40","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations: extended abstract. In: Proceedings of the 2nd ACM KDD, p. 189 (1996)"},{"key":"34_CR41","doi-asserted-by":"crossref","unstructured":"Muralidhar, K., Sarathy, R.: Security of random data perturbation methods. ACM Trans. Database Syst. 24(4), (1999)","DOI":"10.1145\/331983.331986"},{"issue":"3","key":"34_CR42","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0933-3657(98)00056-6","volume":"15","author":"A. \u00d8hrn","year":"1999","unstructured":"\u00d8hrn A., Ohno-Machado L. (1999) Using boolean reasoning to anonymize databases. Artifi. Intell. Med. 15(3): 235\u2013254","journal-title":"Artifi. Intell. Med."},{"key":"34_CR43","unstructured":"Oliveira, S.R.M., Zaiane, O.R. : Privacy preserving frequent itemset mining. In: Proceedings of the IEEE International Conference on Privacy Security and Data mining (2002)"},{"key":"34_CR44","doi-asserted-by":"crossref","unstructured":"Oliveira, S.R.M., Zaiane, O.R.: Protecting sensitive knowledge by data sanitization. In: Third IEEE International Conference on Data Mining (ICDM\u201903) (2003)","DOI":"10.1109\/ICDM.2003.1250990"},{"key":"34_CR45","doi-asserted-by":"crossref","unstructured":"Oliveira, S.R.M., Zaiane, O.R., Saygin, Y.: Secure association rule sharing. In: Proceedings of the 8th PAKDD (2004)","DOI":"10.1007\/978-3-540-24775-3_10"},{"key":"34_CR46","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proceedings of ICDT \u201999 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"34_CR47","unstructured":"Pei, J., Han, J., Wang, J.: Closet+: searching for the best strategies for mining frequent closed itemsets. In: SIGKDD \u201903 (2003)"},{"key":"34_CR48","doi-asserted-by":"crossref","unstructured":"Pinkas, B.: Cryptographic techniques for privacy-preserving data mining. SIGKDD Explor. Newsl. 4(2), (2002)","DOI":"10.1145\/772862.772865"},{"key":"34_CR49","doi-asserted-by":"crossref","unstructured":"Rizvi, S., Haritsa, J.R.: Maintaining data privacy in association rule mining. In: Proceedings of the 28th VLDB Conference (2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"issue":"6","key":"34_CR50","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati P. (2001) Protecting respondents\u2019 identities in microdata release. IEEE Trans. Knowl. Data Eng. (TKDE) 13(6): 1010\u20131027","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"key":"34_CR51","doi-asserted-by":"crossref","unstructured":"Samarati, P., Sweeney, L.: Generalizing data to provide when disclosing information (abstract). In: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (1998)","DOI":"10.1145\/275487.275508"},{"key":"34_CR52","doi-asserted-by":"crossref","unstructured":"Saygin, Y., Verykios, V.S., Clifton, C.: Using unknowns to prevent discovery of association rules. SIGMOD Rec. 30(4), (2001)","DOI":"10.1145\/604264.604271"},{"key":"34_CR53","unstructured":"Sun, X., Yu, P.S.: A border-based approach for hiding sensitive frequent itemsets. In: Proceedings of 5th IEEE International Conference on Data Mining (ICDM\u201905), pp. 426\u2013433 (2005)"},{"key":"34_CR54","doi-asserted-by":"crossref","unstructured":"Sweeney, L.: k-Anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzzi. Knowl. Based Syst. 10(5), (2002)","DOI":"10.1142\/S0218488502001648"},{"key":"34_CR55","doi-asserted-by":"crossref","unstructured":"Sweeney, L.: k-Anonymity privacy protection using generalization and suppression. Int. J. Uncertain. Fuzzi. Knowl. Based Syst. 10(5), (2002)","DOI":"10.1142\/S021848850200165X"},{"key":"34_CR56","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002)","DOI":"10.1145\/775047.775142"},{"issue":"1","key":"34_CR57","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/974121.974131","volume":"33","author":"V.S. Verykios","year":"2004","unstructured":"Verykios V.S., Bertino E., Fovino I.N., Provenza L.P., Saygin Y., Theodoridis Y. (2004) State-of-the-art in privacy preserving data mining. SIGMOD Rec. 33(1): 50\u201357","journal-title":"SIGMOD Rec."},{"key":"34_CR58","doi-asserted-by":"crossref","unstructured":"Wang, K., Fung, B.C.M., Yu, P.S.: Template-based privacy preservation in classification problems. In: Proceedings of Fifth IEEE International Conference on Data Mining (ICDM\u201905), pp. 466\u2013473 (2005)","DOI":"10.1109\/ICDM.2005.142"},{"key":"34_CR59","doi-asserted-by":"crossref","unstructured":"Wu, X., Wu, Y., Wang, Y., Li, Y.: Privacy aware market basket data set generation: a feasible approach for inverse frequent set mining. In: Proceedings of 2005 SIAM International Conference on Data Mining (2005)","DOI":"10.1137\/1.9781611972757.10"},{"key":"34_CR60","unstructured":"Xiao, X., Tao, Y.: Anatomy: Simple and effective privacy preservation. In: 32nd Very Large Data Bases (VLDB) (2006)"},{"key":"34_CR61","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: Charm: an efficient algorithm for closed itemsets mining. In: 2nd SIAM International Conference on Data Mining (2002)","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-006-0034-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-006-0034-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-006-0034-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T20:37:41Z","timestamp":1736627861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-006-0034-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,4]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["34"],"URL":"https:\/\/doi.org\/10.1007\/s00778-006-0034-x","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2006,11,4]]}}}