{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:27:51Z","timestamp":1726410471250},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662454718"},{"type":"electronic","value":"9783662454725"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45472-5_12","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:31:39Z","timestamp":1416000699000},"page":"179-194","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Practical Secure Decision Tree Learning in a Teletreatment Application"],"prefix":"10.1007","author":[{"given":"Sebastiaan","family":"de Hoogh","sequence":"first","affiliation":[]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[]},{"given":"Ping","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Harm","family":"op den Akker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"op den Akker, H., Jones, V.M., Hermens, H.J.: Predicting feedback compliance in a teletreatment application. In: Proceedings of ISABEL 2010: The 3rd International Symposium on Applied Sciences in Biomedical and Communication Technologies, Rome, Italy (2010)","DOI":"10.1109\/ISABEL.2010.5702804"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD 2000, pp. 439\u2013450. ACM, New York (2000)","DOI":"10.1145\/342009.335438"},{"key":"12_CR3","first-page":"41","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L.: Technical note: some properties of splitting criteria. Mach. Learn. 24, 41\u201347 (1996)","journal-title":"Mach. Learn."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-32946-3_5","volume-title":"Financial Cryptography and Data Security","author":"D Bogdanov","year":"2012","unstructured":"Bogdanov, D., Talviste, R., Willemson, J.: Deploying secure multi-party computation for financial data analysis. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 57\u201364. Springer, Heidelberg (2012)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-15497-3_9","volume-title":"Computer Security \u2013 ESORICS 2010","author":"O Catrina","year":"2010","unstructured":"Catrina, O., de Hoogh, S.: Secure multiparty linear programming using fixed-point arithmetic. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 134\u2013150. Springer, Heidelberg (2010)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","volume-title":"Theory of Cryptography","author":"R Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342\u2013362. Springer, Heidelberg (2005)"},{"key":"12_CR7","unstructured":"Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Proceedings of the IEEE International Conference on Privacy, Security and Data Mining, vol. 14, pp. 1\u20138. Australian Computer Society Inc. (2002)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-03168-7_14","volume-title":"Privacy Enhancing Technologies","author":"Z Erkin","year":"2009","unstructured":"Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., Toft, T.: Privacy-preserving face recognition. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol. 5672, pp. 235\u2013253. Springer, Heidelberg (2009)"},{"key":"12_CR9","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository (2010)"},{"key":"12_CR10","unstructured":"Geisler, M.: Cryptographic protocols: theory and implementation. Ph.D. thesis, Aarhus University, Denmark, February 2010"},{"key":"12_CR11","unstructured":"Keller, M.: VIFF boost extension (2010). http:\/\/lists.viff.dk\/pipermail\/viff-devel-viff.dk\/2010-August\/000847.html"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 36\u201354. Springer, Heidelberg (2000)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-540-88582-5_49","volume-title":"Wireless Algorithms, Systems, and Applications","author":"Q Ma","year":"2008","unstructured":"Ma, Q., Deng, P.: Secure multi-party protocols for privacy preserving data mining. In: Li, Y., Huynh, D.T., Das, S.K., Du, D.-Z. (eds.) WASA 2008. LNCS, vol. 5258, pp. 526\u2013537. Springer, Heidelberg (2008)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Bashir Malik, M., Asger Ghazi, M., Ali, R.: Privacy preserving data mining techniques: current scenario and future prospects. In: Proceedings of the 2012 Third International Conference on Computer and Communication Technology, ICCCT \u201912, pp. 26\u201332. IEEE Computer Society, Washington, DC (2012)","DOI":"10.1109\/ICCCT.2012.15"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"T Nishide","year":"2007","unstructured":"Nishide, T., Ohta, K.: Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 343\u2013360. Springer, Heidelberg (2007)"},{"issue":"1","key":"12_CR16","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Rokach, L., Maimon, O.: Decision trees. In: The Data Mining and Knowledge Discovery Handbook, pp. 165\u2013192. Springer, US (2005)","DOI":"10.1007\/0-387-25465-X_9"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/B:AMAI.0000018580.96245.c6","volume":"41","author":"LE Raileanu","year":"2000","unstructured":"Raileanu, L.E., Stoffel, K.: Theoretical comparison between the Gini index and information gain criteria. Ann. Math. Artif. Intell. 41, 77\u201393 (2000)","journal-title":"Ann. Math. Artif. Intell."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Samet, S., Miri, A.: Privacy preserving ID3 using Gini index over horizontally partitioned data. In: IEEE\/ACS International Conference on Computer Systems and Applications, AICCSA 2008, pp. 645\u2013651. IEEE (2008)","DOI":"10.1109\/AICCSA.2008.4493598"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C., Kantarc\u0131o\u011flu, M., Scott Patterson, A.: Privacy-preserving decision trees over vertically partitioned data. ACM Trans. Knowl. Discov. Data 2(3), 14:1\u201314:27 (2008)","DOI":"10.1145\/1409620.1409624"},{"key":"12_CR21","unstructured":"Wang, K., Xu, Y., She, R., Yu, P.S.: Classification spanning private databases. In: Proceedings of the National Conference on Artificial Intelligence, vol. 21, p. 293. AAAI Press, MIT Press, Cambridge, London (1999, 2006)"},{"key":"12_CR22","unstructured":"Xiao, M.-J., Huang, L.-S., Luo, Y.-L., Shen, H.: Privacy preserving ID3 algorithm over horizontally partitioned data. In: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005, pp. 239\u2013243. IEEE (2005)"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (FOCS \u201986), pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45472-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T00:40:15Z","timestamp":1674175215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-45472-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662454718","9783662454725"],"references-count":23,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-662-45472-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"9 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}
