{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:58:39Z","timestamp":1725580719682},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642203190"},{"type":"electronic","value":"9783642203206"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20320-6_22","type":"book-chapter","created":{"date-parts":[[2011,4,21]],"date-time":"2011-04-21T05:14:13Z","timestamp":1303362853000},"page":"207-217","source":"Crossref","is-referenced-by-count":2,"title":["Privacy Preserving Models of k-NN Algorithm"],"prefix":"10.1007","author":[{"given":"Bartosz","family":"Krawczyk","sequence":"first","affiliation":[]},{"given":"Michal","family":"Wozniak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","first-page":"37","volume":"6","author":"D.W. Aha","year":"1991","unstructured":"Aha, D.W., Kibler, D., Albert, M.: K Instance-Based Learning Algorithms. Machine Learning\u00a06, 37\u201366 (1991)","journal-title":"Machine Learning"},{"key":"22_CR2","volume-title":"Introduction to Machine Learning","author":"E. Alpaydin","year":"2010","unstructured":"Alpaydin, E.: Introduction to Machine Learning, 2nd edn. The MIT Press, London (2010)","edition":"2"},{"issue":"12","key":"22_CR3","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1109\/TKDE.2007.190665","volume":"19","author":"F. Angiulli","year":"2007","unstructured":"Angiulli, F., Folino, G.: Distributed Nearest Neighbor Based Condensation of Very Large Datasets. IEEE Transactions on Knowledge and Data Engineering\u00a019(12), 1593\u20131606 (2007)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"22_CR4","unstructured":"Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. School of Information and Computer Science, University of California, Irvine (2007), \n                    \n                      http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: Proc. of the 23rd International Conference on Machine Learning, Pittsburgh, PA, pp. 97\u2013104 (2006)","DOI":"10.1145\/1143844.1143857"},{"key":"22_CR6","unstructured":"Chitti, S., Liu, L., Xiong, L.: Mining Multiple Private Databases isung Privacy Preserving kNN Classifier, Technical Reports TR-2006-008, Emory University (2006)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving data mining. In: SIGKDD Explorations, pp. 28\u201334 (2002)","DOI":"10.1145\/772862.772867"},{"issue":"1","key":"22_CR8","first-page":"57","volume":"10","author":"S. Cost","year":"1993","unstructured":"Cost, S., Salzberg, S.: A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features. Machine Learning\u00a010(1), 57\u201378 (1993)","journal-title":"Machine Learning"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T.M. Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. on Inform. Theory\u00a013(1), 21\u201327 (1967)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"22_CR10","volume-title":"Nearest Neighbor (NN) Norms NN Pattern Classification Techniques","author":"B. Dasarathy","year":"1991","unstructured":"Dasarathy, B.: Nearest Neighbor (NN) Norms NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TPAMI.1981.4767052","volume":"3","author":"L. Devroye","year":"1981","unstructured":"Devroye, L.: On the inequality of cover and hart in nearest neighbor discrimination. IEEE Trans. on Pat. Anal. and Mach. Intel.\u00a03, 75\u201378 (1981)","journal-title":"IEEE Trans. on Pat. Anal. and Mach. Intel."},{"key":"22_CR12","volume-title":"Pattern Classification","author":"R.O. Duda","year":"2001","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. Wiley Interscience, NewYork (2001)"},{"key":"22_CR13","volume-title":"Mining Very Large Databases with Parallel Processing","author":"A.A. Freitas","year":"1998","unstructured":"Freitas, A.A., Lavington, S.H.: Mining Very Large Databases with Parallel Processing. Kluwer Academic Publishers, Boston (1998)"},{"key":"22_CR14","unstructured":"Gantz, J., Reinsel, D.: As the Economy Contracts, the Digital Universe Expands. IDC Multimedia Whitepaper (2009)"},{"issue":"3","key":"22_CR15","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. on Inform. Th.\u00a014(3), 515\u2013516 (1968)","journal-title":"IEEE Trans. on Inform. Th."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Hacigumus, H., Iyer, B., Li, C., Mehrotra, S.: Executing sql over encrypted data in the database service provider model. In: ACM SIGMOD Conference (2002)","DOI":"10.1145\/564691.564717"},{"key":"22_CR17","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2005","unstructured":"Han, J.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publ. Inc., San Francisco (2005)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Jajodia, S., Sandhu, R.: Toward a multilevel secure relational data model. In: ACM SIGMOD Conference (1991)","DOI":"10.1145\/115790.115796"},{"key":"22_CR19","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy preserving k-nn classifier. In: IEEE International Conference on Data Engineering, ICDE (2005)"},{"key":"22_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/0471660264","volume-title":"Combining pattern classifiers: Methods and algorithms","author":"L.I. Kuncheva","year":"2004","unstructured":"Kuncheva, L.I.: Combining pattern classifiers: Methods and algorithms. Wiley-Interscience, New Jersey (2004)"},{"issue":"3","key":"22_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2004","unstructured":"Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. Journal of Cryptology\u00a015(3), 177\u2013206 (2004)","journal-title":"Journal of Cryptology"},{"key":"22_CR22","first-page":"89","volume-title":"Ethics and Information Technology","author":"J.H. Moor","year":"2001","unstructured":"Moor, J.H.: The future of computer ethics: You ain\u2019t seen nothing yet! In: Ethics and Information Technology, vol.\u00a03, pp. 89\u201391. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"22_CR23","unstructured":"Nissenbaum, H.: Can we Protect Privacy in Public? In: Computer Ethics Philosophical Enquiry ACM\/SIGCAS Conference, Rotterdam, The Netherlands (1997)"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Teng, Z., Du, W.: A hybrid multi-group privacypreserving approach for building decision trees. In: Proceedings of the 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining PAKDD 2006, pp. 296\u2013307 (2006)","DOI":"10.1007\/978-3-540-71701-0_30"},{"key":"22_CR25","unstructured":"Westin, A.F.: Privacy and Freedom. The Bodley Head Ltd (1970)"}],"container-title":["Advances in Intelligent and Soft Computing","Computer Recognition Systems 4"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20320-6_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:56:59Z","timestamp":1606186619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20320-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642203190","9783642203206"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20320-6_22","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2011]]}}}