{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:49:26Z","timestamp":1725544166917},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332060"},{"type":"electronic","value":"9783540332077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11731139_72","type":"book-chapter","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T04:03:44Z","timestamp":1141877024000},"page":"621-636","source":"Crossref","is-referenced-by-count":2,"title":["On Robust and Effective K-Anonymity in Large Databases"],"prefix":"10.1007","author":[{"given":"Wen","family":"Jin","sequence":"first","affiliation":[]},{"given":"Rong","family":"Ge","sequence":"additional","affiliation":[]},{"given":"Weining","family":"Qian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"72_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, D., et al.: On the design and quantification of privacy preserving data mining algorithms. In: PODS 2001 (2001)","DOI":"10.1145\/375551.375602"},{"key":"72_CR2","unstructured":"Agrawal, S., Haritsa, J.R.: A Framework for High-Accuracy Privacy-Preserving Mining. In: ICDE 2005 (2005)"},{"key":"72_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy Preserving Data Mining. In: SIGMOD 2000 (2000)","DOI":"10.1145\/342009.335438"},{"key":"72_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-24741-8_12","volume-title":"Advances in Database Technology - EDBT 2004","author":"C.C. Aggarwal","year":"2004","unstructured":"Aggarwal, C.C., Yu, P.S.: A Condensation Approach to Privacy Preserving Data Mining. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 183\u2013199. Springer, Heidelberg (2004)"},{"key":"72_CR5","unstructured":"Bayardo, R.J., Agrawal, R.: Data Privacy through Optimal k-Anonymization. In: ICDE 2005 (2005)"},{"key":"72_CR6","unstructured":"Fung, B.M., et al.: Top-Down Specialization for Information and Privacy Preservation. In: ICDE 2005 (2005)"},{"key":"72_CR7","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H.Freeman, New York (1979)"},{"key":"72_CR8","unstructured":"US Department of Health and Human Services, http:\/\/www.hhs.gov\/ocr\/hipaa\/"},{"key":"72_CR9","doi-asserted-by":"crossref","unstructured":"Iyengar, V.S.: Transforming Data to Satisfy Privacy Constraints. In: KDD (2002)","DOI":"10.1145\/775088.775089"},{"key":"72_CR10","unstructured":"Klusch, M., Lodi, S., et al.: Distributed Clustering Based on Sampling Local Density Estimates. In: IJCAI 2003 (2003)"},{"key":"72_CR11","unstructured":"Knorr, E.M., Ng, R.T.: Algorithms for Mining Distance-Based Outliers in Large Datasets. In: VLDB 1998(1998)"},{"key":"72_CR12","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: Efficient Full-Domain KAnonymity. In: SIGMOD 2005 (2005)","DOI":"10.1145\/1066157.1066164"},{"key":"72_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L., et al.: Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, Chichester (1990)"},{"key":"72_CR14","unstructured":"Merugu, S., Ghosh, J.: Privacy-preserving Distributed Clustering using Generative Models. In: ICDM 2003 (2003)"},{"key":"72_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"72_CR16","unstructured":"Data Mining: Staking a Claim on Your Privacy. Office of the Information and Privacy Commissioner (January 1998)"},{"key":"72_CR17","unstructured":"Oliveira, S.R., Zaiane, O.R.: Privacy Preserving Clustering By Data Transformation. In: SBBD 2003 (2003)"},{"key":"72_CR18","doi-asserted-by":"crossref","unstructured":"Pinaks, B.: Cryptographic Techniques for Privacy Preserving Data Mining. In: SIGKDD Explorations 2000, vol.\u00a04,2 (2000)","DOI":"10.1145\/772862.772865"},{"issue":"2","key":"72_CR19","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/335191.335437","volume":"29","author":"Sridhar Ramaswamy","year":"2000","unstructured":"Ramaswamy, S., et al.: Efficient Algorithms for Mining Outliers from Large Data Sets. In: SIGMOD 2000 (2000)","journal-title":"ACM SIGMOD Record"},{"issue":"05","key":"72_CR20","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"LATANYA SWEENEY","year":"2002","unstructured":"Sweeney, L.: k-anonymity: A Model for Protecting Privacy. In: IJUFKS 2002 (2002)","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"issue":"05","key":"72_CR21","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"LATANYA SWEENEY","year":"2002","unstructured":"Sweeney, L.: Achieving k-Anonymity Privacy Protection Using Generalization and Suppression. In: IJUFKS 2002 (2002)","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"72_CR22","doi-asserted-by":"crossref","unstructured":"Schlrer, J.: Security of Statistical Databases: Multidimensional Transformation. TODS\u00a06(1) (March 1981)","DOI":"10.1145\/319540.319555"},{"key":"72_CR23","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-Preserving K-Means Clustering over Vertically Partitioned Data. In: KDD 2003 (2003)","DOI":"10.1145\/956755.956776"},{"key":"72_CR24","first-page":"162","volume-title":"FOCS","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to Generate and Exchange Secrets. In: FOCS, pp. 162\u2013167. IEEE, Los Alamitos (1986)"},{"key":"72_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, T., et al.: BIRCH: An Efficient Data Clustering Method for Very Large Databases. SIGMOD 1996 Datasets (1998)","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11731139_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:52:03Z","timestamp":1619506323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11731139_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332060","9783540332077"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11731139_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}