Efficient microaggregation techniques for large numerical data volumes
- 8 February 2012
- journal article
- Published by Springer Science and Business Media LLC in International Journal of Information Security
- Vol. 11 (4), 253-267
- https://doi.org/10.1007/s10207-012-0158-5
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A polynomial-time approximation to optimal multivariate microaggregationComputers & Mathematics with Applications, 2008
- Efficient multivariate data-oriented microaggregationThe VLDB Journal, 2006
- Ordinal, Continuous and Heterogeneous k-Anonymity Through MicroaggregationData Mining and Knowledge Discovery, 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
- Searching in metric spacesACM Computing Surveys, 2001
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- K-d trees for semidynamic point setsPublished by Association for Computing Machinery (ACM) ,1990
- R-treesACM SIGMOD Record, 1984
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975