{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T01:48:59Z","timestamp":1777081739888,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T00:00:00Z","timestamp":1290470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10115-010-0362-4","type":"journal-article","created":{"date-parts":[[2010,11,22]],"date-time":"2010-11-22T08:11:18Z","timestamp":1290413478000},"page":"657-695","source":"Crossref","is-referenced-by-count":70,"title":["Geometric data perturbation for privacy preserving outsourced data mining"],"prefix":"10.1007","volume":"29","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","published-online":{"date-parts":[[2010,11,23]]},"reference":[{"key":"362_CR1","unstructured":"Aggarwal CC, Yu PS (2004) A condensation approach to privacy preserving data mining. In: Proceedings of international conference on extending database technology (EDBT), vol 2992. Springer, Heraklion, pp 183\u2013199"},{"key":"362_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal D, Aggarwal CC (2002) On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of ACM conference on principles of database systems (PODS). ACM, Madison","DOI":"10.1145\/375551.375602"},{"key":"362_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R, (2000) Privacy-preserving data mining. In: Proceedings of ACM SIGMOD conference. ACM, Dallas","DOI":"10.1145\/342009.335438"},{"key":"362_CR4","unstructured":"Amazon (n.d.) Applications hosted on amazon clouds. http:\/\/aws.amazon.com\/solutions\/case-studies\/"},{"key":"362_CR5","doi-asserted-by":"crossref","unstructured":"Armbrust M, Fox A, Griffith R, Joseph AD, Katz R, Konwinski A, Lee G, Patterson D, Rabkin A, Stoica I, Zaharia M (2009) Above the clouds: a berkeley view of cloud computing. Technical report, University of Berkerley","DOI":"10.1145\/1721654.1721672"},{"key":"362_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix analysis","author":"R Bhatia","year":"1997","unstructured":"Bhatia R (1997) Matrix analysis. Springer, Berlin"},{"key":"362_CR7","unstructured":"Bruening PJ, Treacy BC (2009) Privacy, security issues raised by cloud computing. BNA Privacy Security Law Report 8(10)"},{"key":"362_CR8","unstructured":"Chen K, Liu L (2005) A random rotation perturbation approach to privacy preserving data classification In: Proceedings of international conference on data mining (ICDM). IEEE, Houston"},{"key":"362_CR9","doi-asserted-by":"crossref","unstructured":"Chen K, Liu L, Sun G (2007) Towards attack-resilient geometric data perturbation. In: SIAM data mining conference","DOI":"10.1137\/1.9781611972771.8"},{"key":"362_CR10","unstructured":"Clifton C (2003) Tutorial: Privacy-preserving data mining, In Proceedings of ACM SIGKDD Conference"},{"key":"362_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801389","volume-title":"An introduction to support vector machines and other kernel-based learning methods","author":"N Cristianini","year":"2000","unstructured":"Cristianini N, Shawe-Taylor J (2000) An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, Cambridge"},{"key":"362_CR12","doi-asserted-by":"crossref","unstructured":"Evfimievski A, Gehrke J, Srikant R (2003) Limiting privacy breaches in privacy preserving data mining. In: Proceedings of ACM conference on principles of database systems (PODS)","DOI":"10.1145\/773153.773174"},{"key":"362_CR13","doi-asserted-by":"crossref","unstructured":"Evfimievski A, Srikant R, Agrawal R, Gehrke J (2002) Privacy preserving mining of association rules. In: Proceedings of ACM SIGKDD conference","DOI":"10.1145\/775079.775080"},{"issue":"5","key":"362_CR14","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman JH (2001) Greedy function approximation: a gradient boosting machine. Ann Stat 29(5): 1189\u20131232","journal-title":"Ann Stat"},{"issue":"4","key":"362_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1749603.1749605","volume":"42","author":"BC Fung","year":"2010","unstructured":"Fung BC, Wang K, Chen R, Yu PS (2010) Privacy-preserving data publishing: a survey on recent developments. ACM Comput Surv 42(4): 1\u201353","journal-title":"ACM Comput Surv"},{"key":"362_CR16","volume-title":"Methods and applications for computer science and engineering","author":"J Gallier","year":"2000","unstructured":"Gallier J (2000) Methods and applications for computer science and engineering. Springer, New York"},{"key":"362_CR17","unstructured":"Google (n.d.) Google appengine gallery. http:\/\/appgallery.appspot.com\/"},{"key":"362_CR18","unstructured":"Guo S, Wu X (2007) 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"},{"issue":"2","key":"362_CR19","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10115-008-0123-9","volume":"17","author":"S Guo","year":"2008","unstructured":"Guo S, Wu X, Li Y (2008) Determining error bounds for spectral filtering based reconstruction methods in privacy preserving data mining. Knowl Inform Syst 17(2): 217\u2013240","journal-title":"Knowl Inform Syst"},{"key":"362_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The elements of statistical learning","author":"T Hastie","year":"2001","unstructured":"Hastie T, Tibshirani R, Friedman J (2001) The elements of statistical learning. Springer, Berlin"},{"key":"362_CR21","doi-asserted-by":"crossref","unstructured":"Huang Z, Du W, Chen B, (2005) Deriving private information from randomized data. In: Proceedings of ACM SIGMOD conference","DOI":"10.1145\/1066157.1066163"},{"key":"362_CR22","doi-asserted-by":"crossref","DOI":"10.1002\/0471221317","volume-title":"Independent component analysis","author":"A Hyvarinen","year":"2001","unstructured":"Hyvarinen A, Karhunen J, Oja E (2001) Independent component analysis. Wiley, London"},{"key":"362_CR23","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A Jain","year":"1999","unstructured":"Jain A, Murty M, Flynn P (1999) Data clustering: a review. ACM Comput Surv 31: 264\u2013323","journal-title":"ACM Comput Surv"},{"issue":"4","key":"362_CR24","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1214\/009117906000000205","volume":"34","author":"T Jiang","year":"2006","unstructured":"Jiang T (2006) How many entries in a typical orthogonal matrix can be approximated by independent normals. Ann Prob 34(4): 1497\u20131529","journal-title":"Ann Prob"},{"key":"362_CR25","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"WB Johnson","year":"1984","unstructured":"Johnson WB, Lindenstrauss J (1984) Extensions of lipshitz mapping into hilbert space. Contemp Math 26: 189\u2013206","journal-title":"Contemp Math"},{"key":"362_CR26","unstructured":"Kargupta H, Datta S, Wang Q, Sivakumar K (2003) On the privacy preserving properties of random data perturbation techniques. In: Proceedings of international conference on data mining (ICDM)"},{"key":"362_CR27","doi-asserted-by":"crossref","unstructured":"LeFevre K, DeWitt DJ, Ramakrishnan R (2006) Mondrain multidimensional k-anonymity. In: Proceedings of IEEE international conference on data engineering (ICDE)","DOI":"10.1109\/ICDE.2006.101"},{"key":"362_CR28","volume-title":"Theory of point estimation","author":"EL Lehmann","year":"1998","unstructured":"Lehmann EL, Casella G (1998) Theory of point estimation. Springer, Berlin"},{"issue":"3","key":"362_CR29","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y Lindell","year":"2000","unstructured":"Lindell Y, Pinkas B (2000) Privacy preserving data mining. J Cryptol 15(3): 177\u2013206","journal-title":"J Cryptol"},{"key":"362_CR30","doi-asserted-by":"crossref","unstructured":"Liu K, Giannella C, Kargupta H (2006) An attacker\u2019s view of distance preserving maps for privacy preserving data mining In: European conference on principles and practice of knowledge discovery in databases (PKDD). Berlin, Germany","DOI":"10.1007\/11871637_30"},{"issue":"1","key":"362_CR31","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TKDE.2006.14","volume":"18","author":"K Liu","year":"2006","unstructured":"Liu K, Kargupta H, Ryan J (2006) Random projection-based multiplicative data perturbation for privacy preserving distributed data mining. IEEE Trans Knowl Data Eng 18(1): 92\u2013106","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"362_CR32","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10115-008-0167-x","volume":"20","author":"H Luo","year":"2009","unstructured":"Luo H, Fan J, Lin X, Zhou A, Bertino E (2009) A distributed approach to enabling privacy-preserving model-based classifier training. Knowl Inform Syst 20(2): 157\u2013185","journal-title":"Knowl Inform Syst"},{"key":"362_CR33","doi-asserted-by":"crossref","DOI":"10.1002\/0471721182","volume-title":"Finite mixture models","author":"G McLachlan","year":"2000","unstructured":"McLachlan G, Peel D (2000) Finite mixture models. Wiley, London"},{"key":"362_CR34","doi-asserted-by":"crossref","unstructured":"Oliveira SRM, Za\u00efane OR (2004) Privacy preservation when sharing data for clustering. In: Proceedings of the international workshop on secure data management in a connected world. Toronto, Canada, pp 67\u201382","DOI":"10.1007\/978-3-540-30073-1_6"},{"issue":"1","key":"362_CR35","first-page":"67","volume":"1","author":"SR Oliveira","year":"2010","unstructured":"Oliveira SR, Zaiane OR (2010) Privacy preserving clustering by data transformation. J Inform Data Manag (JIDM) 1(1): 67\u201382","journal-title":"J Inform Data Manag (JIDM)"},{"key":"362_CR36","volume-title":"Applied linear algebra: the decoupling principle","author":"L Sadun","year":"2001","unstructured":"Sadun L (2001) Applied linear algebra: the decoupling principle. Prentice Hall, Englewood Cliffs"},{"key":"362_CR37","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0717034","volume":"17","author":"G Stewart","year":"1980","unstructured":"Stewart G (1980) The efficient generation of random orthogonal matrices with an application to condition estimation. SIAM J Num Anal 17: 403\u2013409","journal-title":"SIAM J Num Anal"},{"issue":"5","key":"362_CR38","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) k-anonymity: a model for protecting privacy. Int J Uncert Fuzz Knowl Based Syst 10(5): 557\u2013570","journal-title":"Int J Uncert Fuzz Knowl Based Syst"},{"issue":"2","key":"362_CR39","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10115-008-0158-y","volume":"19","author":"Z Teng","year":"2009","unstructured":"Teng Z, Du W (2009) A hybrid multi-group approach for privacy-preserving data mining. Knowl Inform Syst 19(2): 133\u2013157","journal-title":"Knowl Inform Syst"},{"key":"362_CR40","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C (2003) Privacy preserving k-means clustering over vertically partitioned data. In: Proceedings of ACM SIGKDD conference","DOI":"10.1145\/956750.956776"},{"key":"362_CR41","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/065","volume-title":"The random projection method","author":"SS Vempala","year":"2005","unstructured":"Vempala SS (2005) The random projection method. American Mathematical Society, Providence"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0362-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-010-0362-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0362-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T08:58:03Z","timestamp":1559811483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-010-0362-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,23]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["362"],"URL":"https:\/\/doi.org\/10.1007\/s10115-010-0362-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,23]]}}}