{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:57:53Z","timestamp":1762210673223},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T00:00:00Z","timestamp":1328659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10207-012-0158-5","type":"journal-article","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T07:16:32Z","timestamp":1328598992000},"page":"253-267","source":"Crossref","is-referenced-by-count":24,"title":["Efficient microaggregation techniques for large numerical data volumes"],"prefix":"10.1007","volume":"11","author":[{"given":"Marc","family":"Sol\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Munt\u00e9s-Mulero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Nin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,8]]},"reference":[{"key":"158_CR1","unstructured":"IPUMS-international. URL https:\/\/international.ipums.org\/international"},{"key":"158_CR2","unstructured":"UCI KDD archive. URL http:\/\/kdd.ics.uci.edu"},{"issue":"6","key":"158_CR3","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya S., Mount D., Netanyahu N., Silverman R., Wu A.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"issue":"9","key":"158_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. Bentley","year":"1975","unstructured":"Bentley J.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"158_CR5","doi-asserted-by":"crossref","unstructured":"Bentley, J.: K-d trees for semidynamic point sets. In: Proceedings of the 6th Symposium on Computational Geometry, pp. 187\u2013197 (1990)","DOI":"10.1145\/98524.98564"},{"key":"158_CR6","unstructured":"Berchtold, S., Keim, D., Kriegel, H.P.: The X-tree : an index structure for high-dimensional data. In: Proceedings of 22th International Conference on Very Large Data Bases, pp. 28\u201339 (1996)"},{"key":"158_CR7","unstructured":"Brand, R., Domingo-Ferrer, J., Mateo-Sanz, J.M.: Reference datasets to test and compare sdc methods for protection of numerical microdata. Technical report, European Project IST-2000-25069 CASC (2002)"},{"key":"158_CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez E., Navarro G., Baeza-Yates R., Marroqu\u00edn J.L.: Searching in metric spaces. ACM Comput. Surv. 33, 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"158_CR9","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Nearest-neighbor searching and metric space dimensions. In: Nearest-Neighbor Methods for Learning and Vision: Theory and Practice. MIT Press, Cambridge (2005)","DOI":"10.7551\/mitpress\/4908.003.0005"},{"key":"158_CR10","unstructured":"Defays, D., Nanopoulos, P.: Panels of enterprises and confidentiality: the small aggregates method. In: Proceedings of 92th Symposium on Design and Analysis of Longitudinal Surveys, pp. 195\u2013204. Statistics Canada, Ottawa (1993)"},{"issue":"4","key":"158_CR11","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00778-006-0007-0","volume":"15","author":"J. Domingo-Ferrer","year":"2006","unstructured":"Domingo-Ferrer J., Mart\u00ednez-Ballest\u00e9 A., Mateo-Sanz J.M., Seb\u00e9 F.: Efficient multivariate data-oriented microaggregation. Very Large Data Bases J. 15(4), 355\u2013369 (2006)","journal-title":"Very Large Data Bases J."},{"issue":"1","key":"158_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/69.979982","volume":"14","author":"J. Domingo-Ferrer","year":"2002","unstructured":"Domingo-Ferrer J., Mateo-Sanz J.M.: Practical data-oriented microaggregation for statistical disclosure control. IEEE Trans. Knowl. Data Eng. 14(1), 189\u2013201 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"158_CR13","unstructured":"Domingo-Ferrer, J., Seb\u00e9, F., Solanas, A.: Microaggregation heuristics for p-sensitive k-anonymity. In: Proceedings of Joint UNECE\/Eurostat work session on statistical data confidentiality (2007)"},{"key":"158_CR14","doi-asserted-by":"crossref","unstructured":"Domingo-Ferrer, J., Seb\u00e9, F., Solanas, A.: A polynomial-time approximation to optimal multivariate microaggregation. In: Computers and Mathematics with Applications, vol. 55, pp. 714\u2013732 (2008)","DOI":"10.1016\/j.camwa.2007.04.034"},{"issue":"2","key":"158_CR15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10618-005-0007-5","volume":"11","author":"J. Domingo-Ferrer","year":"2005","unstructured":"Domingo-Ferrer J., Torra V.: Ordinal, continuous and heterogeneous k-anonymity through microaggregation. Data Min. Knowl. Discov. 11(2), 195\u2013212 (2005)","journal-title":"Data Min. Knowl. Discov."},{"key":"158_CR16","unstructured":"Domingo-Ferrer, J., Torra, V., Mateo-Sanz, J.M., Seb\u00e9, F.: Systematic measures of re-identification risk based on the probabilistic links of the partially synthetic data back to the original microdata. Technical report, Cornell University (2005)"},{"key":"158_CR17","unstructured":"Ghinita, G., Karras, P., Kalnis, P., Mamoulis, N.: Fast data anonymization with low information loss. In: Proceedings of the 33rd International Conference Very Large Data Bases, pp. 758\u2013769 (2007)"},{"key":"158_CR18","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM International Conference on Management of data, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"issue":"4","key":"158_CR19","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1109\/TKDE.2003.1209020","volume":"15","author":"S.L. Hansen","year":"2003","unstructured":"Hansen S.L., Mukherjee S.: A polynomial algorithm for optimal univariate microaggregation. IEEE Trans. Knowl. Data Engi. 15(4), 1043\u20131044 (2003)","journal-title":"IEEE Trans. Knowl. Data Engi."},{"key":"158_CR20","doi-asserted-by":"crossref","unstructured":"Hore, B., Jammalamadaka, R.C., Mehrotra, S.: Flexible anonymization for privacy preserving data publishing: a systematic search based approach. In: Proceedings of the 7th SIAM International Conference on Data Mining (2007)","DOI":"10.1137\/1.9781611972771.51"},{"key":"158_CR21","unstructured":"Hundepool, A., deWetering deWetering, A.V., Ramaswamy, R., Franconi, L., Polettini, S., Capo-bianchi, A., de Wolf, P.P., Domingo-Ferrer, J., Torra, V., Brand, R., Giessing, S.:\u00a0\u03bc-argus version 4.1 software and users manual. http:\/\/neon.vb.cbs.nl\/casc (2007)"},{"key":"158_CR22","volume-title":"Handbook of Discrete and Computational Geometry","author":"P. Indyk","year":"2004","unstructured":"Indyk P.: Nearest neighbors in high-dimensional spaces. In: Goodman, J.E., O\u2019Rourke, J. (eds) Handbook of Discrete and Computational Geometry, 2nd edn, CRC Press LLC, Boca Raton (2004)","edition":"2"},{"key":"158_CR23","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1080\/01621459.1989.10478785","volume":"84","author":"M. Jaro","year":"1989","unstructured":"Jaro M.: Advances in record-linkage methodology as applied to matching the 1985 census of tampa, florida. J. Am. Stat. Assoc. 84, 414\u2013420 (1989)","journal-title":"J. Am. Stat. Assoc."},{"key":"158_CR24","doi-asserted-by":"crossref","unstructured":"Jian-min, H., Ting-ting, C., Hui-qun: An improved v-mdav algorithm for l-diversity. In: International Symposiums on Information Processing, pp. 733\u2013739 (2008)","DOI":"10.1109\/ISIP.2008.110"},{"issue":"7","key":"158_CR25","doi-asserted-by":"crossref","first-page":"2439","DOI":"10.1016\/j.csda.2008.09.028","volume":"53","author":"G. Kokolakis","year":"2009","unstructured":"Kokolakis G., Fouskakis D.: Importance partitioning in micro-aggregation. Comput. Stat. Data Anal. 53(7), 2439\u20132445 (2009)","journal-title":"Comput. Stat. Data Anal."},{"issue":"7","key":"158_CR26","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TKDE.2005.112","volume":"17","author":"M. Laszlo","year":"2005","unstructured":"Laszlo M., Mukherjee S.: Minimum spanning tree partitioning algorithm for microaggregation. IEEE Trans. Knowl. Data Eng. 17(7), 902\u2013911 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"158_CR27","first-page":"23","volume":"9","author":"D.T. Lee","year":"1977","unstructured":"Lee D.T., Wong C.K.: Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees. Acta Informatica 9, 23\u201329 (1977)","journal-title":"Acta Informatica"},{"key":"158_CR28","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Mondrian multidimensional k-anonymity. In: Proceedings of International Conference on Data Engineering (2006)","DOI":"10.1109\/ICDE.2006.101"},{"key":"158_CR29","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-diversity: privacy beyond k-anonymity. In: IEEE International Conference on Data Engineering (2006)","DOI":"10.1109\/ICDE.2006.1"},{"key":"158_CR30","unstructured":"Mount, D., Arya, S.: ANN: a library for approximate nearest neighbor searching. URL http:\/\/www.cs.umd.edu\/~mount\/ANN"},{"issue":"1","key":"158_CR31","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G. Navarro","year":"2002","unstructured":"Navarro G.: Searching in metric spaces by spatial approximation. Very Large Data Bases J. 11(1), 28\u201346 (2002)","journal-title":"Very Large Data Bases J."},{"issue":"4","key":"158_CR32","first-page":"345","volume":"18","author":"A. Oganian","year":"2000","unstructured":"Oganian A., Domingo-Ferrer J.: On the complexity of optimal microaggregation for statistical disclosure control. Stat. J. U.N. Econ. Comm. Eur. 18(4), 345\u2013354 (2000)","journal-title":"Stat. J. U.N. Econ. Comm. Eur."},{"key":"158_CR33","unstructured":"Sample, N., Haines, M., Arnold, M., Purcell, T.: Optimizing search strategies in k-d trees. In: 5th WSES\/IEEE World Multiconference on Circuits, Systems, Communications & Computers (CSCC) (2001)"},{"key":"158_CR34","doi-asserted-by":"crossref","unstructured":"Smid, M.: Closest-point problems in computational geometry. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of computational geometry, pp. 877\u2013935. North-Holland (2000)","DOI":"10.1016\/B978-044482537-7\/50021-8"},{"key":"158_CR35","unstructured":"Solanas, A., Mart\u00ednez-Ballest\u00e9, A.: V-MDAV: a multivariate microaggregation with variable group size. In: Computational Statistics (COMPSTAT), pp. 917\u2013925 (2006)"},{"key":"158_CR36","doi-asserted-by":"crossref","unstructured":"Solanas, A., Martinez-Balleste, A., Domingo-Ferrer, J., Mateo-Sanz, J.M.: A 2 d -tree-based blocking method for microaggregating very large data sets. In: International Conference on Availability, Reliability and Security, pp. 922\u2013928 (2006)","DOI":"10.1109\/ARES.2006.1"},{"key":"158_CR37","doi-asserted-by":"crossref","unstructured":"Solanas, A., Pietro, R.: A linear-time multivariate micro-aggregation for privacy protection in uniform very large data sets. In: Proceedings of the 5th International Conference on Modeling Decisions for Artificial Intelligence, pp. 203\u2013214 (2008)","DOI":"10.1007\/978-3-540-88269-5_19"},{"issue":"5","key":"158_CR38","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney L.: -anonymity: a model for protecting privacy k. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"key":"158_CR39","unstructured":"Templ, M.: sdcMicro. Manual and Package. Version 2.5.1. Statistics Austria and Vienna University of Technology, http:\/\/cran.r-project.org\/src\/contrib\/Descriptions\/sdcMicro.html (2008)"},{"key":"158_CR40","doi-asserted-by":"crossref","unstructured":"Truta, T.M., Vinay, B.: Privacy protection: p-sensitive k-anonymity property. In: IEEE International Confernce on Data Engineering Workshops (2006)","DOI":"10.1109\/ICDEW.2006.116"},{"key":"158_CR41","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0121-9","volume-title":"Elements of Statistical Diclosure Control. Lecture Notes in Statistics","author":"L. Willenborg","year":"2001","unstructured":"Willenborg L., de Waal T.: Elements of Statistical Diclosure Control. Lecture Notes in Statistics. Springer, Berlin (2001)"},{"key":"158_CR42","doi-asserted-by":"crossref","unstructured":"Wong, W.K., Mamoulis, N., Cheung, D.W.: Non-homogeneous generalization in privacy preserving data publishing. In: ACM International Conference on Management of Data (SIGMOD), pp. 747\u2013758 (2010)","DOI":"10.1145\/1807167.1807248"},{"key":"158_CR43","doi-asserted-by":"crossref","unstructured":"Xia, C., Lu, H., Ooi, B.C., Hu, J.: Gorder: an efficient method for KNN join processing. In: Proceedings of the International Conference on Very large data bases, pp. 756\u2013767 (2004)","DOI":"10.1016\/B978-012088469-8\/50067-X"},{"key":"158_CR44","unstructured":"Yuan, C., Gersho, A., Ramamurthi, B., Shoham, Y.: Fast search algorithms for vector quantization and pattern matching. In: International Conference on Acoustics, Speech, and Signal Processing, pp. 372\u2013375 (1984)"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-012-0158-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-012-0158-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-012-0158-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T02:39:50Z","timestamp":1713494390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-012-0158-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,8]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["158"],"URL":"https:\/\/doi.org\/10.1007\/s10207-012-0158-5","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,8]]}}}