{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:40:34Z","timestamp":1725536434471},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042041"},{"type":"electronic","value":"9783642042058"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04205-8_23","type":"book-chapter","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T10:54:46Z","timestamp":1251284086000},"page":"276-286","source":"Crossref","is-referenced-by-count":3,"title":["Importance of Data Standardization in Privacy-Preserving K-Means Clustering"],"prefix":"10.1007","author":[{"given":"Chunhua","family":"Su","sequence":"first","affiliation":[]},{"given":"Justin","family":"Zhan","sequence":"additional","affiliation":[]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Bunn, P., Ostrovsky, R.: Secure two-party k-means clustering. In: Proc. of the 14th ACM conference on Computer and communications security, pp. 486\u2013497 (2007)","DOI":"10.1145\/1315245.1315306"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Chu, C.W., Holliday, J., Willett, P.: Effect of data standardization on chemical clustering and similarity searching. Journal of Chemical Information and Modeling (2008)","DOI":"10.1021\/ci800224h"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., Wright, R.: Secure multiparty computation of approximations. In: Proc. of 28th International Colloquium on Automata, Languages and Programming, pp. 927\u2013938 (2001)","DOI":"10.1007\/3-540-48224-5_75"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proc. of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11555827_23","volume-title":"Computer Security \u2013 ESORICS 2005","author":"S. Jha","year":"2005","unstructured":"Jha, S., Kruger, L., McDaniel, P.: Privacy preserving clustering. In: de di Vimercati, S.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 397\u2013417. Springer, Heidelberg (2005)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Jagannathan, G., Pillaipakkamnatt, K., Wright, R.N.: A new privacy-preserving distributed k-clustering algorithm. In: Proc. of the 2006 SIAM International Conference on Data Mining, SDM (2006)","DOI":"10.1137\/1.9781611972764.47"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Jagannathan, G., Wright, R.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proc. of the 11th International Conference on Knowledge Discovery and Data Mining, KDD (2005)","DOI":"10.1145\/1081870.1081942"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-30576-7_16","volume-title":"Theory of Cryptography","author":"E. Kiltz","year":"2005","unstructured":"Kiltz, E., Leander, G., Malone-Lee, J.: Secure computation of the mean and related statistics. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 283\u2013302. Springer, Heidelberg (2005)"},{"key":"23_CR9","first-page":"281","volume-title":"Proc. of the Fifth Berkeley Symposium on Mathematical Statistics and Probability","author":"J. MacQueen","year":"1967","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proc. of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol.\u00a01, pp. 281\u2013297. University of California Press, Berkeley (1967)"},{"key":"23_CR10","first-page":"245","volume-title":"31st ACM Symposium on Theory of Computing","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: 31st ACM Symposium on Theory of Computing, pp. 245\u2013254. ACM Press, New York (1999)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 223. Springer, Heidelberg (1999)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11496618_6","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"K. Peng","year":"2005","unstructured":"Peng, K., Boyd, C., Dawson, E., Lee, B.: An efficient and verifiable solution to the millionaire problem. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 51\u201366. Springer, Heidelberg (2005)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Rakhlin, A., Caponnetto, A.: Stability of k-means clustering. In: Proc. of Neural Information Processing Systems Conference (2006)","DOI":"10.7551\/mitpress\/7503.003.0145"},{"issue":"2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1207\/s15327906mbr3102_1","volume":"31","author":"C.M. Schaffer","year":"1996","unstructured":"Schaffer, C.M., Green, P.E.: An empirical comparison of variable standardization methods in cluster analysis. Multivariate Behavioral Research\u00a031(2), 149\u2013167 (1996)","journal-title":"Multivariate Behavioral Research"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proc. of the 9th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, USA (2003)","DOI":"10.1145\/956750.956776"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04205-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T02:50:10Z","timestamp":1710557410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04205-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042041","9783642042058"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04205-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}