{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T20:40:08Z","timestamp":1743972008217,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315510"},{"type":"electronic","value":"9783642315527"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-31552-7_59","type":"book-chapter","created":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T08:11:07Z","timestamp":1344672667000},"page":"581-594","source":"Crossref","is-referenced-by-count":1,"title":["Improved Algorithms for Anonymization of Set-Valued Data"],"prefix":"10.1007","author":[{"given":"B. K.","family":"Tripathy","sequence":"first","affiliation":[]},{"given":"A.","family":"Jayaram Reddy","sequence":"additional","affiliation":[]},{"given":"G. V.","family":"Manusha","sequence":"additional","affiliation":[]},{"given":"G. S.","family":"Mohisin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Feder, G., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., Zhu, A.: Achieving Anonymity via Clustering. In: Proc. of ACM PODS, pp. 153\u2013162 (2006)","DOI":"10.1145\/1142351.1142374"},{"key":"59_CR2","unstructured":"Aggarwal, G., Feder, G., Kenthapadi, R., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Approximation Algorithms for k-Anonymity. Journal of Privacy Technology (2005)"},{"key":"59_CR3","unstructured":"Atzori, M., Bonchi, F., Giannotti, F., Pedreschi, D.: Anonymity Preserving Pattern Discovery. VLDB Journal (2008) (accepted for publication)"},{"key":"59_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R.: Data Privacy through Optimal k-Anonymization. Proc. of ICDE, pp. 217\u2013228 (2005)","DOI":"10.1109\/ICDE.2005.42"},{"key":"59_CR5","unstructured":"Ghinita, G., Karras, F.P., Kalnis, P., Mamoulis, N.: Fast Data Anonymization with Low Information Loss. In: VLDB, pp. 758\u2013769 (2007)"},{"key":"59_CR6","doi-asserted-by":"crossref","unstructured":"Ghinita, G., Tao, Y., Kalnis, P.: On the Anonymization of Sparse High-Dimensional Data. In: Proceedings of ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497480"},{"key":"59_CR7","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of ACM SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"59_CR8","doi-asserted-by":"crossref","unstructured":"Iyengar, V.S.: Transforming Data to Satisfy Privacy Constraints. In: Proceedings of SIGKDD, pp. 279\u2013288 (2002)","DOI":"10.1145\/775047.775089"},{"key":"59_CR9","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: Efficient Full-domain k-anonymity. In: Proceedings of ACM SIGMOD, pp. 49\u201360 (2005)","DOI":"10.1145\/1066157.1066164"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., Venktasubramanian, S.: t-closeness Privacy Beyond k-anonymity and l-diversity. In: Proceedings of ICDE, pp. 106\u2013115 (2007)","DOI":"10.1109\/ICDE.2007.367856"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, S.: l-diversity: Privacy Beyond k-Anonymity. In: Proceedings of ICDE (2006)","DOI":"10.1109\/ICDE.2006.1"},{"key":"59_CR12","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the Complexity of Optimal k-Anonymity. In: Proceedings of ACM PODS, pp. 223\u2013228 (2004)","DOI":"10.1145\/1055558.1055591"},{"key":"59_CR13","doi-asserted-by":"crossref","unstructured":"Park, H., Shim, K.: Approximate algorithms for k-Anonymity. In: Proceedings of the ACM SIGMOD, pp. 67\u201378 (2007)","DOI":"10.1145\/1247480.1247490"},{"issue":"6","key":"59_CR14","first-page":"1010","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati, P.: Protecting Respondents Identities in Microdata Release. IEEE TKDE\u00a013(6), 1010\u20131027 (2001)","journal-title":"IEEE TKDE"},{"issue":"5","key":"59_CR15","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: K-Anonymity: A Model for Protecting Privacy. International Journal of Uncertainty. Fuzziness and Knowledge-Based Systems\u00a010(5), 557\u2013570 (2002)","journal-title":"International Journal of Uncertainty. Fuzziness and Knowledge-Based Systems"},{"key":"59_CR16","doi-asserted-by":"crossref","unstructured":"Terrovitis, M., Mamoulis, N., Kalnis, P.: Privacy Preserving Anonymization of Set-Valued Data. In: PVLDB 2008, Auckland, New Zeland, pp. 115\u2013125 (2008)","DOI":"10.14778\/1453856.1453874"},{"key":"59_CR17","unstructured":"Tripathy, B.K., Devineni, H., Jayasri, K.J., Bhargava, M.: An Efficient Clustering Algorithm for l-diversity. In: Proceedings of the International Conference on Advances and Emerging Trends in Computing Technologies, ICAET 2010, June 21-24, pp. 76\u201381. SRM university (2010)"},{"key":"59_CR18","unstructured":"Tripathy, B.K., Panda, G.K., Kumaran, K.: A Rough Set Approach to develop an efficient l-diversity Algorithm based on Clustering. In: Proc. of the 2nd IIMA International Conference on Advanced Data Analysis, Business Analytics and Intelligence, January 8-9, p. 34 (2011)"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"Tripathy, B.K., Panda, G.K., Kumaran, K.: A Fast l - Diversity Anonymisation Algorithm. In: Proc. of the Third International Conference on Computer Modelling and Simulation, ICCMS 2011, Mumbai, January 7-9, pp. V2-648\u2013652(2011)","DOI":"10.1109\/RAICS.2011.6069408"},{"key":"59_CR20","doi-asserted-by":"crossref","unstructured":"Tripathy, B.K., Maity, A., Ranajit, B., Chowdhuri, D.: A fast p-sensitive l-diversity Anonymisation algorithm. In: Proceedings of the RAICS IEEE Conference, Kerala, September 21-23, pp. 741\u2013744 (2011)","DOI":"10.1109\/RAICS.2011.6069408"},{"key":"59_CR21","doi-asserted-by":"crossref","unstructured":"Xiao, X., Tao, Y.: Anatomy: Simple and Effective Privacy Preservation. In: Proceedings of VLDB, pp. 139\u2013150 (2006)","DOI":"10.1145\/1142473.1142500"},{"key":"59_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Koudas, N., Srivastava, D., Yu, T.: Aggregate Query Answering on Anonymised Tables. In: Proceedings of ICDE, pp. 116\u2013125 (2007)","DOI":"10.1109\/ICDE.2007.367857"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Computing and Information Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31552-7_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T20:11:14Z","timestamp":1743970274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31552-7_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642315510","9783642315527"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31552-7_59","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2013]]}}}