|
| | | |
Building Decision Tree Classifier on Private Data
Du, W. and Zhan, Z.
This paper studies how to build a decision tree classifier under the following scenario: a database is vertically partitioned into two pieces, with one piece owned by Alice and the other piece owned by Bob. Alice and Bob want to build a decision tree classifier based on such a database, but due to the privacy constraints, neither of them wants to disclose their private pieces to the other party or to any third party. We present a protocol that allows Alice and Bob to conduct such a classifier building without having to compromise their privacy. Our protocol uses an untrusted third-party server, and is built upon a useful building block, the scalar product protocol. Our solution to the scalar product protocol is more efficient than any existing solutions. |
Cite as: Du, W. and Zhan, Z. (2002). Building Decision Tree Classifier on Private Data. In Proc. IEEE ICDM Workshop on Privacy, Security and Data Mining (PSDM 2002), Maebashi City, Japan. CRPIT, 14. Clifton, C. and Estivill-Castro, V., Eds. ACS. 1-8. |
(from crpit.com)
(local if available)
|
|