Microaggregation is a technique for the protection of the confidentiality of respondents in microdata releases. It is used for economic data where respondent identifiability is high. Microaggregation releases the averages of small groups in which no single respondent is dominant. It was developed for univariate data. The data was sorted and the averages of adjacent fixed size groups were reported. The groups can be allowed to have varying sizes so that no group will include a large gap in the sorted data. The groups become more homogeneous when their boundaries are sensitive to the distribution of the data. This is like clustering but with the number of clusters chosen to be as large as possible subject to homogeneous clusters and a minimum cluster size. Approximate methods based on comparisons are developed. Exact methods based on linear optimization are also developed. For bivariate, or higher dimensional, data the notion of adjacency is defined even though sorting is no longer well defined. The constraints for minimum cluster size are also more elaborate and not so easily solved. We may also use only a triangulation to limit the number of adjacencies to be considered in the algorithms. Hybrids of the approximate and exact methods combine the strengths of each strategy.
[1]
Josep Domingo-Ferrer,et al.
On the complexity of optimal microaggregation for statistical disclosure control
,
2001
.
[2]
Sumitra Mukherjee,et al.
A Polynomial Algorithm for Optimal Univariate Microaggregation
,
2003,
IEEE Trans. Knowl. Data Eng..
[3]
Josep Domingo-Ferrer,et al.
Practical Data-Oriented Microaggregation for Statistical Disclosure Control
,
2002,
IEEE Trans. Knowl. Data Eng..
[4]
Fritz Scheuren,et al.
PROTECTION OF TAXPAYER CONFIDENTIALITY WITH RESPECT TO THE TAX MODEL
,
2002
.
[5]
Robert E. Tarjan,et al.
Data structures and network algorithms
,
1983,
CBMS-NSF regional conference series in applied mathematics.