{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:19:27Z","timestamp":1761401967826,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T00:00:00Z","timestamp":1530662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["106-2221-E-155-038"],"award-info":[{"award-number":["106-2221-E-155-038"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Microaggregation refers to partitioning n given records into groups of at least k records each to minimize the sum of the within-group squared error. Because microaggregation is non-deterministic polynomial-time hard for multivariate data, most existing approaches are heuristic based and derive a solution within a reasonable timeframe. We propose an algorithm for refining the solutions generated using the existing microaggregation approaches. The proposed algorithm refines a solution by iteratively either decomposing or shrinking the groups in the solution. Experimental results demonstrated that the proposed algorithm effectively reduces the information loss of a solution.<\/jats:p>","DOI":"10.3390\/sym10070262","type":"journal-article","created":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T12:23:02Z","timestamp":1530706982000},"page":"262","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Iterative Group Decomposition for Refining Microaggregation Solutions"],"prefix":"10.3390","volume":"10","author":[{"given":"Laksamee","family":"Khomnotai","sequence":"first","affiliation":[{"name":"Faculty of Management Science, Nakhon Ratchasima Rajabhat University, Nakhon Ratchasima 30000, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6844-1182","authenticated-orcid":false,"given":"Jun-Lin","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Information Management, Yuan Ze University, Taoyuan 32003, Taiwan"},{"name":"Innovation Center for Big Data and Digital Convergence, Yuan Ze University, Taoyuan 32003, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Qiang","family":"Peng","sequence":"additional","affiliation":[{"name":"Department of Information Management, Yuan Ze University, Taoyuan 32003, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpita Samanta","family":"Santra","sequence":"additional","affiliation":[{"name":"Department of Information Management, Yuan Ze University, Taoyuan 32003, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10618-005-0009-3","article-title":"Privacy in data mining","volume":"11","author":"Torra","year":"2005","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Willenborg, L., and Waal, T.D. (2000). Data Analytic Impact of SDC Techniques on Microdata. Elements of Statistical Disclosure Control, Springer.","DOI":"10.1007\/978-1-4613-0121-9_3"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","article-title":"k-anonymity: A model for protecting privacy","volume":"10","author":"Sweeney","year":"2002","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1109\/TKDE.2003.1209020","article-title":"A polynomial algorithm for optimal univariate microaggregation","volume":"15","author":"Hansen","year":"2003","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_5","first-page":"345","article-title":"On the complexity of optimal microaggregation for statistical disclosure control","volume":"18","author":"Oganian","year":"2001","journal-title":"Stat. J. U. N. Econ. Comm. Eur."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10618-005-0007-5","article-title":"Ordinal, continuous and heterogeneous k-anonymity through microaggregation","volume":"11","author":"Torra","year":"2005","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TKDE.2005.112","article-title":"Minimum spanning tree partitioning algorithm for microaggregation","volume":"17","author":"Laszlo","year":"2005","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1866","DOI":"10.1016\/j.jss.2007.02.014","article-title":"TFRP: An efficient microaggregation algorithm for statistical disclosure control","volume":"80","author":"Chang","year":"2007","journal-title":"J. Syst. Softw."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00778-006-0007-0","article-title":"Efficient multivariate data-oriented microaggregation","volume":"15","author":"Sebe","year":"2006","journal-title":"Int. J. Large Data Bases"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"3256","DOI":"10.1016\/j.eswa.2009.09.054","article-title":"Density-based microaggregation for statistical disclosure control","volume":"37","author":"Lin","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1109\/TKDE.2011.242","article-title":"Successive group selection for microaggregation","volume":"25","author":"Panagiotakis","year":"2013","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.knosys.2014.05.011","article-title":"Fast data-oriented microaggregation algorithm for large numerical datasets","volume":"67","author":"Mortazavi","year":"2014","journal-title":"Knowl. Based Syst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1111\/itor.12125","article-title":"A derivative-free algorithm for refining numerical microaggregation solutions","volume":"22","author":"Aloise","year":"2015","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10489-013-0431-y","article-title":"Multivariate microaggregation by iterative optimization","volume":"39","author":"Mortazavi","year":"2013","journal-title":"Appl. Intell."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.jss.2014.10.012","article-title":"Iterated local search for microaggregation","volume":"100","author":"Laszlo","year":"2015","journal-title":"J. Syst. Softw."},{"key":"ref_16","first-page":"15","article-title":"A novel local search method for microaggregation","volume":"7","author":"Mortazavi","year":"2015","journal-title":"ISC Int. J. Inf. Secur."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/69.979982","article-title":"Practical data-oriented microaggregation for statistical disclosure control","volume":"14","year":"2002","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_18","unstructured":"Kabir, M.E., Mahmood, A.N., Wang, H., and Mustafa, A. (2015). Microaggregation sorting framework for K-anonymity statistical disclosure control in cloud computing. IEEE Trans. Cloud Comput., Available online: http:\/\/doi.ieeecomputersociety.org\/10.1109\/TCC.2015.2469649."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Kabir, M.E., Wang, H., and Zhang, Y. (2010, January 13\u201317). A pairwise-systematic microaggregation for statistical disclosure control. Proceedings of the IEEE 10th International Conference on Data Mining (ICDM), Sydney, NSW, Australia.","DOI":"10.1109\/ICDM.2010.111"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Kabir, M.E., and Wang, H. (2010, January 1\u20133). Systematic clustering-based microaggregation for statistical disclosure control. Proceedings of the 2010 Fourth International Conference on Network and System Security, Melbourne, VIC, Australia.","DOI":"10.1109\/NSS.2010.66"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1016\/j.eswa.2011.04.223","article-title":"An approximate microaggregation approach for microdata protection","volume":"39","author":"Sun","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/02664763.2014.993361","article-title":"A minimum spanning tree equipartition algorithm for microaggregation","volume":"42","author":"Panagiotakis","year":"2015","journal-title":"J. Appl. Stat."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","article-title":"Graph-theoretical methods for detecting and describing gestalt clusters","volume":"C-20","author":"Zahn","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","article-title":"Hierarchical grouping to optimize an objective function","volume":"58","author":"Ward","year":"1963","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1217299.1217302","article-title":"l-diversity: Privacy beyond k-anonymity","volume":"1","author":"Machanavajjhala","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., and Venkatasubramanian, S. (2007, January 15\u201320). t-closeness: Privacy beyond k-anonymity and l-diversity. Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering, Istanbul, Turkey.","DOI":"10.1109\/ICDE.2007.367856"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1093\/comjnl\/bxr028","article-title":"Satisfying privacy requirements before data anonymization","volume":"55","author":"Sun","year":"2012","journal-title":"Comput. J."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Domingo-Ferrer, J., and Soria-Comas, J. (2017, January 18\u201321). Steered microaggregation: A unified primitive for anonymization of data sets and data streams. Proceedings of the 2017 IEEE International Conference on Data Mining Workshops (ICDMW), New Orleans, LA, USA.","DOI":"10.1109\/ICDMW.2017.141"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1016\/j.camwa.2007.04.034","article-title":"A polynomial-time approximation to optimal multivariate microaggregation","volume":"55","author":"Sebe","year":"2008","journal-title":"Comput. Math. Appl."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10898-014-0149-3","article-title":"Column generation bounds for numerical microaggregation","volume":"60","author":"Aloise","year":"2014","journal-title":"J. Glob. Optim."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/7\/262\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:11:18Z","timestamp":1760195478000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/7\/262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,4]]},"references-count":30,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2018,7]]}},"alternative-id":["sym10070262"],"URL":"https:\/\/doi.org\/10.3390\/sym10070262","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2018,7,4]]}}}