{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:12:32Z","timestamp":1743052352305,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031139444"},{"type":"electronic","value":"9783031139451"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-13945-1_1","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T23:02:54Z","timestamp":1663110174000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Optimization-Based Decomposition Heuristic for\u00a0the\u00a0Microaggregation Problem"],"prefix":"10.1007","author":[{"given":"Jordi","family":"Castro","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Gentile","sequence":"additional","affiliation":[]},{"given":"Enric","family":"Spagnolo-Arrizabalaga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10898-014-0149-3","volume":"60","author":"D Aloise","year":"2014","unstructured":"Aloise, D., Hansen, P., Rocha, C., Santi, \u00c9.: Column generation bounds for numerical microaggregation. J. Global Optim. 60(2), 165\u2013182 (2014). https:\/\/doi.org\/10.1007\/s10898-014-0149-3","journal-title":"J. Global Optim."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1111\/itor.12125","volume":"22","author":"D Aloise","year":"2015","unstructured":"Aloise, D., Ara\u00fajo, A.: A derivative-free algorithm for refining numerical microaggregation solutions. Int. Trans. Oper. Res. 22, 693\u2013712 (2015)","journal-title":"Int. Trans. Oper. Res."},{"unstructured":"Brand, R., Domingo-Ferrer, J., Mateo-Sanz, J. M.: Reference data sets to test and compare SDC methods for protection of numerical microdata. European Project IST-2000-25069 CASC (2002). http:\/\/neon.vb.cbs.nl\/casc, https:\/\/research.cbs.nl\/casc\/CASCtestsets.html","key":"1_CR3"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"105817","DOI":"10.1016\/j.cor.2022.105817","volume":"144","author":"J Castro","year":"2022","unstructured":"Castro, J., Gentile, C., Spagnolo-Arrizabalaga, E.: An algorithm for the microaggregation problem using column generation. Comput. Oper. Res. 144, 105817 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.105817","journal-title":"Comput. Oper. Res."},{"unstructured":"Defays, D., Anwar, N.: Micro-aggregation: a generic method. In: Proceedings of Second International Symposium Statistical Confidentiality, pp. 69\u201378 (1995)","key":"1_CR5"},{"key":"1_CR6","doi-asserted-by":"publisher","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, 189\u2013201 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR7","doi-asserted-by":"publisher","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. VLDB J. 15, 355\u2013369 (2006)","journal-title":"VLDB J."},{"key":"1_CR8","doi-asserted-by":"publisher","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 Mining Knowl. Disc. 11, 195\u2013212 (2005)","journal-title":"Data Mining Knowl. Disc."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2006.10.009","volume":"4","author":"X Ji","year":"2007","unstructured":"Ji, X., Mitchell, J.E.: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement. Discr. Optim. 4, 87\u2013102 (2007)","journal-title":"Discr. Optim."},{"doi-asserted-by":"crossref","unstructured":"Ghosh, J., Liu, A.: K-means. In: The Top Ten Algorithms in Data Mining, pp. 21\u201335. Taylor & Francis, Boca Raton (2009)","key":"1_CR10","DOI":"10.1201\/9781420089653.ch2"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1109\/TKDE.2003.1209020","volume":"15","author":"S Hansen","year":"2003","unstructured":"Hansen, S., Mukherjee, S.: A polynomial algorithm for optimal univariate microaggregation. IEEE Trans. Knowl. Data Eng. 15, 1043\u20131044 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Kaufman, L., Rousseeuw, P.J.: Partitioning around medoids (Program PAM). In: Wiley Series in Probability and Statistics, pp. 68\u2013125. John Wiley & Sons, Hoboken (1990)","key":"1_CR12","DOI":"10.1002\/9780470316801.ch2"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.3390\/sym10070262","volume":"10","author":"L Khomnotai","year":"2018","unstructured":"Khomnotai, L., Lin, J.-L., Peng, Z.-Q., Samanta, A.: Iterative group decomposition for refining microaggregation solutions. Symmetry 10, 262 (2018). https:\/\/doi.org\/10.3390\/sym10070262","journal-title":"Symmetry"},{"doi-asserted-by":"publisher","unstructured":"Maya-L\u00f3pez, A., Casino, F., Solanas, A.: Improving multivariate microaggregation through Hamiltonian paths and optimal univariate microaggregation. Symmetry. 13, 916 (2021). https:\/\/doi.org\/10.3390\/sym13060916","key":"1_CR14","DOI":"10.3390\/sym13060916"},{"key":"1_CR15","first-page":"345","volume":"18","author":"A Oganian","year":"2001","unstructured":"Oganian, A., Domingo-Ferrer, J.: On the complexity of optimal microaggregation for statistical disclosure control. Statist. J. U. N. Econ. Com. Eur. 18, 345\u2013354 (2001)","journal-title":"Statist. J. U. N. Econ. Com. Eur."},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1109\/TKDE.2011.242","volume":"25","author":"C Panagiotakis","year":"2013","unstructured":"Panagiotakis, C., Tziritas, G.: Successive group selection for microaggregation. IEEE Trans. Knowl. Data Eng. 25, 1191\u20131195 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-030-26773-5_29","volume-title":"Modeling Decisions for Artificial Intelligence","author":"J Soria-Comas","year":"2019","unstructured":"Soria-Comas, J., Domingo-Ferrer, J., Mulero, R.: Efficient near-optimal variable-size microaggregation. In: Torra, V., Narukawa, Y., Pasi, G., Viviani, M. (eds.) MDAI 2019. LNCS (LNAI), vol. 11676, pp. 333\u2013345. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26773-5_29"},{"unstructured":"Spagnolo-Arrizabalaga, E.: On the use of Integer Programming to pursue Optimal Microaggregation. B.Sc. thesis, University Polit\u00e8cnica de Catalunya, School of Mathematics and Statistics, Barcelona (2016)","key":"1_CR18"},{"unstructured":"Solanas, A., Mart\u00ednez-Ballest\u00e9, A.: V-MDAV: a multivariate microaggregation with variable group size. In: Proceedings of COMPSTAT Symposium IASC, pp. 917\u2013925 (2006)","key":"1_CR19"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: $$k$$-anonymity: a model for protecting privacy. Int. J. Uncertain Fuzziness Knowl. Based Syst. 10, 557\u2013570 (2002)","journal-title":"Int. J. Uncertain Fuzziness Knowl. Based Syst."}],"container-title":["Lecture Notes in Computer Science","Privacy in Statistical Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13945-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:30:57Z","timestamp":1710329457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13945-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031139444","9783031139451"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13945-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PSD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Privacy in Statistical Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"psd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crises-deim.urv.cat\/psd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}