{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:55:36Z","timestamp":1761292536195},"publisher-location":"Boston, MA","reference-count":35,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387709918"},{"type":"electronic","value":"9780387709925"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-70992-5_7","type":"book-chapter","created":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:04:54Z","timestamp":1212969894000},"page":"157-181","source":"Crossref","is-referenced-by-count":19,"title":["A Survey of Multiplicative Perturbation for Privacy-Preserving Data Mining"],"prefix":"10.1007","author":[{"given":"Keke","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1_1","first-page":"183","volume":"2992","author":"CC Aggarwal","year":"2004","unstructured":"Aggarwal, C. C., and Yu, P. S. A condensation approach to privacy preserving data mining. Proc. of Intl. Conf. on Extending Database Technology (EDBT) 2992 (2004), 183\u2013199.","journal-title":"Proc. of Intl. Conf. on Extending Database Technology (EDBT)"},{"key":"7_CR2_1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C. C., and Yu, P. S. On privacy-preservation of text and sparse binary data with sketches. SIAM Data Mining Conference (2007).","DOI":"10.1137\/1.9781611972771.6"},{"key":"7_CR3_1","doi-asserted-by":"crossref","unstructured":"Agrawal, D., and Aggarwal, C. C. On the design and quantification of privacy preserving data mining algorithms. Proc. of ACM PODS Conference (2002).","DOI":"10.1145\/375551.375602"},{"key":"7_CR4_1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., and Srikant, R. Privacy-preserving data mining. Proc. of ACM SIGMOD Conference (2000).","DOI":"10.1145\/342009.335438"},{"key":"7_CR5_1","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., and Szegedy, M. The space complexity of approximating the frequency moments. Proc. of ACM PODS Conference (1996).","DOI":"10.1145\/237814.237823"},{"key":"7_CR6_1","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M. M., Kriegel, H.-P., and Sander, J. OPTICS: Ordering points to identify the clustering structure. Proc. of ACM SIGMOD Conference (1999), 49\u201360.","DOI":"10.1145\/304181.304187"},{"key":"7_CR7_1","unstructured":"Chen, K., and Liu, L. A random geometric perturbation approach to privacy-preserving data classification. Technical Report, College of Computing, Georgia Tech (2005)."},{"key":"7_CR8_1","unstructured":"Chen, K., and Liu, L. A random rotation perturbation approach to privacy preserving data classification. Proc. of Intl. Conf. on Data Mining (ICDM) (2005)."},{"key":"7_CR9_1","doi-asserted-by":"crossref","unstructured":"Chen, K., and Liu, L. Towards attack-resilient geometric data perturbation. SIAM Data Mining Conference (2007).","DOI":"10.1137\/1.9781611972771.8"},{"key":"7_CR10_1","doi-asserted-by":"crossref","unstructured":"Cristianini, N., and Shawe-Taylor, J. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, 2000.","DOI":"10.1017\/CBO9780511801389"},{"key":"7_CR11_1","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. A density-based algorithm for discovering clusters in large spatial databases with noise. Second International Conference on Knowledge Discovery and Data Mining (1996), 226\u2013231."},{"key":"7_CR12_1","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Gehrke, J., and Srikant, R. Limiting privacy breaches in privacy preserving data mining. Proc. of ACM PODS Conference (2003).","DOI":"10.1145\/773153.773174"},{"key":"7_CR13_1","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., and Gehrke, J. Privacy preserving mining of association rules. Proc. of ACM SIGKDD Conference (2002).","DOI":"10.1145\/775047.775080"},{"key":"7_CR14_1","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., and Wright, R. N. Secure multiparty computation of approximations. In ICALP \u201901: Proceedings of the 28th International Colloquium on Automata, Languages and Programming, (2001), Springer-Verlag, pp. 927\u2013938."},{"key":"7_CR15_1","unstructured":"Guo, S., and Wu, X. Deriving private information from arbitrarily projected data. In Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD07) (Warsaw, Poland, Sept 2007)."},{"key":"7_CR16_1","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., and Friedmann, J. The Elements of Statistical Learning. Springer-Verlag, 2001.","DOI":"10.1007\/978-0-387-21606-5"},{"key":"7_CR17_1","unstructured":"Hinneburg, A., and Keim, D. A. An efficient approach to clustering in large multimedia databases with noise. Proc. of ACM SIGKDD Conference (1998), 58\u201365."},{"key":"7_CR18_1","doi-asserted-by":"crossref","unstructured":"Hyvarinen, A., Karhunen, J., and Oja, E. Independent Component Analysis. Wiley-Interscience, 2001.","DOI":"10.1002\/0471221317"},{"key":"7_CR19_1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain, A. K., and Dubes, R. C. Data clustering: A review. ACM Computing Surveys 31 (1999), 264\u2013323.","journal-title":"ACM Computing Surveys"},{"key":"7_CR20_1","doi-asserted-by":"crossref","unstructured":"Jiang, T. How many entries in a typical orthogonal matrix can be approximated by independent normals. To appear in The Annals of Probability (2005).","DOI":"10.1214\/009117906000000205"},{"key":"7_CR21_1","doi-asserted-by":"crossref","unstructured":"Johnson, W. B., and Lindenstrauss, J. Extensions of lipshitz mapping into hilbert space. Contemporary Mathematics 26 (1984).","DOI":"10.1090\/conm\/026\/737400"},{"key":"7_CR22_1","unstructured":"Kargupta, H., Datta, S., Wang, Q., and Sivakumar, K. On the privacy preserving properties of random data perturbation techniques. Proc. of Intl. Conf. on Data Mining (ICDM) (2003)."},{"key":"7_CR23_1","volume-title":"Multiplicative noise for masking continuous data","author":"JJ Kim","year":"2003","unstructured":"Kim, J. J., and Winkler, W. E. Multiplicative noise for masking continuous data. Tech. Rep. Statistics #2003-01, Statistical Research Division, U.S. Bureau of the Census, Washington D.C., April 2003."},{"key":"7_CR24_1","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D. J., and Ramakrishnan, R. Mondrain multidimensional k-anonymity. Proc. of IEEE Intl. Conf. on Data Eng. (ICDE) (2006).","DOI":"10.1109\/ICDE.2006.101"},{"key":"7_CR25_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1162\/089976600300015826","volume":"12","author":"M. S. Lewicki","year":"2000","unstructured":"Lewicki, M. S., and Sejnowski, T. J. Learning overcomplet representations. Neural Computation 12, 2 (2000).","journal-title":"Neural Computation"},{"issue":"3","key":"7_CR26_1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y Lindell","year":"2000","unstructured":"Lindell, Y., and Pinkas, B. Privacy preserving data mining. Journal of Cryptology 15, 3 (2000), 177\u2013206.","journal-title":"Journal of Cryptology"},{"key":"7_CR27_1","doi-asserted-by":"crossref","unstructured":"Liu, K., Giannella, C., and Kargupta, H. An attacker\u2019s view of distance preserving maps for privacy preserving data mining. In Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD\u201906) (Berlin, Germany, September 2006).","DOI":"10.1007\/11871637_30"},{"issue":"1","key":"7_CR28_1","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TKDE.2006.14","volume":"18","author":"K Liu","year":"2006","unstructured":"Liu, K., Kargupta, H., and Ryan, J. Random projection-based multiplicative data perturbation for privacy preserving distributed data mining. IEEE Transactions on Knowledge and Data Engineering (TKDE) 18, 1 (January 2006), 92\u2013106.","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"7_CR29_1","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., and Venkitasubramaniam, M. l-diversity: Privacy beyond k-anonymity. Proc. of IEEE Intl. Conf. on Data Eng. (ICDE) (2006).","DOI":"10.1109\/ICDE.2006.1"},{"key":"7_CR30_1","unstructured":"Neter, J., Kutner, M. H., Nachtsheim, C. J., and Wasserman, W. Applied Linear Statistical Methods. WCB\/McGraw-Hill, 1996."},{"key":"7_CR31_1","doi-asserted-by":"crossref","unstructured":"Oliveira, S. R. M., and Za\u00efane, O. R. Privacy preservation when sharing data for clustering. In Proceedings of the International Workshop on Secure Data Management in a Connected World (Toronto, Canada, August 2004), pp. 67\u201382.","DOI":"10.1007\/978-3-540-30073-1_6"},{"key":"7_CR32_1","unstructured":"Sadun, L. Applied Linear Algebra: the Decoupling Principle. Prentice Hall, 2001."},{"key":"7_CR33_1","doi-asserted-by":"crossref","unstructured":"Stewart, G. The efficient generation of random orthogonal matrices with an application to condition estimation. SIAM Journal on Numerical Analysis 17 (1980).","DOI":"10.1137\/0717034"},{"key":"7_CR34_1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S021848850200179X","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L. k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems 10, 5 (2002).","journal-title":"International Journal on Uncertainty, Fuzziness and Knowledge-based Systems"},{"key":"7_CR35_1","doi-asserted-by":"crossref","unstructured":"Vaidya, J., and Clifton, C. Privacy preserving k-means clustering over vertically partitioned data. Proc. of ACM SIGKDD Conference (2003).","DOI":"10.1145\/956750.956776"}],"container-title":["Advances in Database Systems","Privacy-Preserving Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-70992-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T04:53:48Z","timestamp":1557896028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-70992-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387709918","9780387709925"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-70992-5_7","relation":{},"ISSN":["1386-2944"],"issn-type":[{"type":"print","value":"1386-2944"}],"subject":[],"published":{"date-parts":[[2008]]}}}