Abstract
Privacy is an important issue in data mining and knowledge discovery. In this paper, we propose to use the randomized response techniques to conduct the data mining computation. Specially, we present a method to build decision tree classifiers from the disguised data. We conduct experiments to compare the accuracy of our decision tree with the one built from the original undisguised data. Our results show that although the data are disguised, our method can still achieve fairly high accuracy. We also show how the parameter used in the randomized response techniques affects the accuracy of the results.
Original language | English (US) |
---|---|
Pages | 505-510 |
Number of pages | 6 |
DOIs | |
State | Published - 2003 |
Event | 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03 - Washington, DC, United States Duration: Aug 24 2003 → Aug 27 2003 |
Other
Other | 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03 |
---|---|
Country/Territory | United States |
City | Washington, DC |
Period | 8/24/03 → 8/27/03 |
Keywords
- Data mining
- Decision tree
- Privacy
- Security
ASJC Scopus subject areas
- Software
- Information Systems