On Optimizing the k-Ward Micro-aggregation Technique for Secure Statistical Databases
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 324-335
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A 2/sup d/-tree-based blocking method for microaggregating very large data sets2006
- Minimum spanning tree partitioning algorithm for microaggregationIEEE Transactions on Knowledge and Data Engineering, 2005
- A polynomial algorithm for optimal univariate microaggregationIEEE Transactions on Knowledge and Data Engineering, 2003
- Practical data-oriented microaggregation for statistical disclosure controlIEEE Transactions on Knowledge and Data Engineering, 2002
- A Privacy-Enhanced Microaggregation Method2002
- Resampling for statistical confidentiality in contingency tablesComputers & Mathematics with Applications, 1999
- Security-control methods for statistical databases: a comparative studyACM Computing Surveys, 1989
- On the Complexity of Clustering Problems1978
- Hierarchical Grouping to Optimize an Objective FunctionJournal of the American Statistical Association, 1963