Kd-trees and the real disclosure risks of large statistical databases
Rights accessRestricted access - publisher's policy
In data privacy, record linkage can be used as an estimator of the disclosure risk of protected data. To model the worst case scenario one normally attempts to link records from the original data to the protected data. In this paper we introduce a parametrization of record linkage in terms of a weighted mean and its weights, and provide a supervised learning method to determine the optimum weights for the linkage process. That is, the parameters yielding a maximal record linkage between the protected and original data. We compare our method to standard record linkage with data from several protection methods widely used in statistical disclosure control, and study the results taking into account the performance in the linkage process, and its computational effort
CitationHerranz, J.; Nin, J.; Solé, M. Kd-trees and the real disclosure risks of large statistical databases. "Information fusion", 2011, vol. 13, núm. 4, p. 260-273.
|information fusion.pdf||725.9Kb||Restricted access|