{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T13:40:06Z","timestamp":1746366006023,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10975-6_16","type":"book-chapter","created":{"date-parts":[[2014,9,3]],"date-time":"2014-09-03T12:26:14Z","timestamp":1409747174000},"page":"211-225","source":"Crossref","is-referenced-by-count":0,"title":["PrivacyFrost2: A Efficient Data Anonymization Tool Based on Scoring Functions"],"prefix":"10.1007","author":[{"given":"Shinsaku","family":"Kiyomoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yutaka","family":"Miyake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: On variable constraints in privacy preserving data mining. In: Proc. of the 5th SIAM International Conference on Data Mining, pp. 115\u2013125 (2005)","DOI":"10.1137\/1.9781611972757.11"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-30570-5_17","volume-title":"Database Theory - ICDT 2005","author":"G. Aggarwal","year":"2005","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Anonymizing tables. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 246\u2013258. Springer, Heidelberg (2005)"},{"key":"16_CR3","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Approximation algorithms for k-anonymity. Journal of Privacy Technology (2005)"},{"key":"16_CR4","unstructured":"Al-Fedaghi, S.S.: Balanced k-anonymity. In: Proc. of WASET, vol.\u00a06, pp. 179\u2013182 (2005)"},{"key":"16_CR5","unstructured":"Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R.: Data privacy through optimal k-anonymity. In: Proc. of ICDE 2005, pp. 217\u2013228 (2005)","DOI":"10.1109\/ICDE.2005.42"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Byun, J.-W., Kamra, A., Bertino, E., Li, N.: Efficient k-anonymity using clustering technique. In: Proc. of the International Conference on Database Systems for Advanced Applications, pp. 188\u2013200 (2007)","DOI":"10.1007\/978-3-540-71703-4_18"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Ciriani, V., De Capitani di Vimercati, S., Foresti, S., Samarati, P.: k-anonymous data mining: A survey. In: Privacy-Preserving Data Mining: Models and Algorithms. Springer (2008)","DOI":"10.1007\/978-0-387-70992-5_5"},{"issue":"3","key":"16_CR9","first-page":"329","volume":"2","author":"T. Dalenius","year":"1986","unstructured":"Dalenius, T.: Finding a needle in a haystack \u2014or identifying anonymous census record. Journal of Official Statistics\u00a02(3), 329\u2013336 (1986)","journal-title":"Journal of Official Statistics"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Iyengar, V.S.: Transforming data to satisfy privacy constraints. In: Proc. of ACM SIGKDD 2002, pp. 279\u2013288. ACM (2002)","DOI":"10.1145\/775088.775089"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Kiyomoto, S., Miyake, Y., Tanaka, T.: Privacy Frost: A user-oriented data anonymization tool. In: 2011 Sixth International Conference on Availability, Reliability and Security (ARES), pp. 442\u2013447 (2011)","DOI":"10.1109\/ARES.2011.68"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-19348-4_3","volume-title":"Data Privacy Management and Autonomous Spontaneous Security","author":"S. Kiyomoto","year":"2011","unstructured":"Kiyomoto, S., Tanaka, T.: A user-oriented anonymization mechanism for public data. In: Garcia-Alfaro, J., Navarro-Arribas, G., Cavalli, A., Leneutre, J. (eds.) DPM 2010 and SETOP 2010. LNCS, vol.\u00a06514, pp. 22\u201335. Springer, Heidelberg (2011)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: Efficient full-domain k-anonymity. In: Proc. of SIGMOD 2005, pp. 49\u201360 (2005)","DOI":"10.1145\/1066157.1066164"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Mondrian multidimensional k-anonymity. In: Proc. of the 22nd International Conference on Data Engineering (ICDE 2006), pp. 25\u201335. IEEE (2006)","DOI":"10.1109\/ICDE.2006.101"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Workload-aware anonymization. In: Proc. ACM SIGKDD 2006, pp. 277\u2013286. ACM (2006)","DOI":"10.1145\/1150402.1150435"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Lin, J.-L., Wei, M.-C.: An efficient clustering method for k-anonymization. In: Proc. of the 2008 International Workshop on Privacy and Anonymity in Information Society (PAIS 2008), pp. 46\u201350. ACM (2008)","DOI":"10.1145\/1379287.1379297"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-04205-8_20","volume-title":"Database Systems for Advanced Applications","author":"G. Loukides","year":"2009","unstructured":"Loukides, G., Tziatzios, A., Shao, J.: Towards preference-constrained k-anonymisation. In: Chen, L., Liu, C., Liu, Q., Deng, K. (eds.) DASFAA 2009. LNCS, vol.\u00a05667, pp. 231\u2013245. Springer, Heidelberg (2009)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D.: l-diversity: Privacy beyond k-anonymity. In: Proc. of ICDE 2006, pp. 24\u201335 (2006)","DOI":"10.1109\/ICDE.2006.1"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D.: t-closeness: Privacy beyond k-anonymity and l-diversity. In: Proc. of ICDE 2007, pp. 106\u2013115 (2007)","DOI":"10.1109\/ICDE.2007.367856"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: Proc. of PODS 2004, pp. 223\u2013228 (2004)","DOI":"10.1145\/1055558.1055591"},{"key":"16_CR21","unstructured":"Miller, J., Campan, A., Truta, T.M.: Constrained k-anonymity: Privacy with generalization boundaries. In: Proc. of the Practical Preserving Data Mining Workshop, P3DM 2008 (2008)"},{"issue":"6","key":"16_CR22","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati, P.: Protecting respondents\u2019 identities in microdata release. IEEE Trans. on Knowledge and Data Engineering\u00a013(6), 1010\u20131027 (2001)","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information. In: Proc. of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1998), p. 188 (1998)","DOI":"10.1145\/275487.275508"},{"key":"16_CR24","unstructured":"Sun, X., Li, M., Wang, H., Plank, A.: An efficient hash-based algorithm for minimal k-anonymity. In: ACSC 2008: Proceedings of the Thirty-first Australasian Conference on Computer Science, pp. 101\u2013107 (2008)"},{"key":"16_CR25","unstructured":"Sun, X., Wang, H., Li, J., Truta, T.M., Li, P.: (p \u2009+\u2009, \u03b1)-sensitive k-anonymity: a new enhanced privacy protection model. In: Proc. of CIT 2008, pp. 59\u201364 (2008)"},{"issue":"5","key":"16_CR26","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: Achieving k-anonymity privacy protection using generalization and suppression. J. Uncertainty, Fuzziness, and Knowledge-Base Systems\u00a010(5), 571\u2013588 (2002)","journal-title":"J. Uncertainty, Fuzziness, and Knowledge-Base Systems"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Truta, T.M., Campan, A.: K-anonymization incremental maintenance and optimization techniques. In: Proceedings of the 2007 ACM symposium on Applied computing (SAC 2007), pp. 380\u2013387. ACM (2007)","DOI":"10.1145\/1244002.1244093"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Truta, T.M., Vinay, B.: Privacy protection: p-sensitive k-anonymity property. In: Proc. of ICDE 2006, pp. 94\u2013103 (2006)","DOI":"10.1109\/ICDEW.2006.116"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Willenborg, L., de Waal, T.: Elements of Statistical Disclosure Control. LNS, vol.\u00a0155. Springer (2001)","DOI":"10.1007\/978-1-4613-0121-9"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Wong, R.C.-W., Li, J., Fu, A.W.-C., Wang, K.: (\u03b1, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing. In: Proc. of ACM SIGKDD 2006, pp. 754\u2013759 (2006)","DOI":"10.1145\/1150402.1150499"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Xiao, X., Tao, Y.: Personalized privacy preservation. In: Proc. of SIGMOD 2006, pp. 229\u2013240. ACM (2006)","DOI":"10.1145\/1142473.1142500"},{"issue":"2","key":"16_CR32","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1233321.1233324","volume":"8","author":"J. Xu","year":"2006","unstructured":"Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., Fu, A.W.-C.: Utility-based anonymization for privacy preservation with less information loss. SIGKDD Explor. Newsl.\u00a08(2), 21\u201330 (2006)","journal-title":"SIGKDD Explor. Newsl."},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., Fu, A.W.-C.: Utility-based anonymization using local recoding. In: Proc. of ACM SIGKDD 2006, pp. 785\u2013790. ACM (2006)","DOI":"10.1145\/1150402.1150504"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-540-72524-4_76","volume-title":"Advances in Data and Web Management","author":"H. Zhu","year":"2007","unstructured":"Zhu, H., Ye, X.: Achieving k-anonymity via a density-based clustering method. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds.) APWeb\/WAIM 2007. LNCS, vol.\u00a04505, pp. 745\u2013752. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10975-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T12:59:59Z","timestamp":1746363599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10975-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10975-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}