Security-control methods for statistical databases: a comparative study
ACM Computing Surveys (CSUR)
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Data mining: concepts and techniques
Data mining: concepts and techniques
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Data Mining, the Internet, and Privacy
WEBKDD '99 Revised Papers from the International Workshop on Web Usage Analysis and User Profiling
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Hi-index | 0.01 |
It is important to process data effectively while preserving privacy of personal information. In this paper, we propose a technique to reconstruct results of count aggregate queries from a perturbed table for building a decision tree whose target attribute contains more than two classes. Using the conventional technique, we must reconstruct the results of target values from those of each value calculated independently in such the case. In this paper, we borrow and extend the conventional technique to reconstruct the results of target values at once. We also report some experimental results showing that our proposal can reduce reconstruction errors compared to the conventional technique in cases where perturbation ratio is high.