Abstract
Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. In this paper, we tackle the problem of classification. We introduce a generalized privacy preserving variant of the ID3 algorithm for vertically partitioned data distributed over two or more parties. Along with the algorithm, we give a complete proof of security that gives a tight bound on the information revealed.
Original language | English (US) |
---|---|
Pages (from-to) | 139-152 |
Number of pages | 14 |
Journal | Lecture Notes in Computer Science |
Volume | 3654 |
DOIs | |
State | Published - 2005 |
Event | 19th Annual IFIP WG 11.3 Working Conference on Data and Applications Security - Storrs, CT, United States Duration: Aug 7 2005 → Aug 10 2005 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science