Column generation bounds for numerical microaggregation

The biggest challenge when disclosing private data is to share information contained in databases while protecting people from being individually identified. Microaggregation is a family of methods for statistical disclosure control. The principle of microaggregation is that confidentiality rules pe...

ver descrição completa

Na minha lista:

Detalhes bibliográficos
Principais autores:	Rocha, Caroline Thennecy de Medeiros, Aloise, Daniel, Hansen, Pierre, Santi, Éverton
Formato:	article
Idioma:	English
Publicado em:	Springer
Assuntos:	Microaggregation Column generation Cuts Branch-and-bound
Endereço do item:	https://repositorio.ufrn.br/handle/123456789/30554
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!

id	ri-123456789-30554
record_format	dspace
spelling	ri-123456789-305542020-11-15T08:07:00Z Column generation bounds for numerical microaggregation Rocha, Caroline Thennecy de Medeiros Aloise, Daniel Hansen, Pierre Santi, Éverton Microaggregation Column generation Cuts Branch-and-bound The biggest challenge when disclosing private data is to share information contained in databases while protecting people from being individually identified. Microaggregation is a family of methods for statistical disclosure control. The principle of microaggregation is that confidentiality rules permit the publication of individual records if they are partitioned into groups of size larger or equal to a fixed threshold value, where none is more representative than the others in the same group. The application of such rules leads to replacing individual values by those computed from small groups (microaggregates), before data publication. This work proposes a column generation algorithm for numerical microaggregation in which its pricing problem is solved by a specialized branch-and-bound. The algorithm is able to find, for the first time, lower bounds for instances of three real-world datasets commonly used in the literature. Furthermore, new best known solutions are obtained for these instances by means of a simple heuristic method with the columns generated 2020-11-10T13:37:11Z 2020-11-10T13:37:11Z 2014-02-18 article ALOISE, Daniel; HANSEN, Pierre; ROCHA, Caroline; SANTI, Éverton. Column generation bounds for numerical microaggregation. Journal of Global Optimization, [S.L.], v. 60, n. 2, p. 165-182, 18 fev. 2014. Disponível em: https://link.springer.com/article/10.1007/s10898-014-0149-3. Acesso em: 03 set. 2020. http://dx.doi.org/10.1007/s10898-014-0149-3. 0925-5001 1573-2916 https://repositorio.ufrn.br/handle/123456789/30554 10.1007/s10898-014-0149-3 en Attribution 3.0 Brazil http://creativecommons.org/licenses/by/3.0/br/ application/pdf Springer
institution	Repositório Institucional
collection	RI - UFRN
language	English
topic	Microaggregation Column generation Cuts Branch-and-bound
spellingShingle	Microaggregation Column generation Cuts Branch-and-bound Rocha, Caroline Thennecy de Medeiros Aloise, Daniel Hansen, Pierre Santi, Éverton Column generation bounds for numerical microaggregation
description	The biggest challenge when disclosing private data is to share information contained in databases while protecting people from being individually identified. Microaggregation is a family of methods for statistical disclosure control. The principle of microaggregation is that confidentiality rules permit the publication of individual records if they are partitioned into groups of size larger or equal to a fixed threshold value, where none is more representative than the others in the same group. The application of such rules leads to replacing individual values by those computed from small groups (microaggregates), before data publication. This work proposes a column generation algorithm for numerical microaggregation in which its pricing problem is solved by a specialized branch-and-bound. The algorithm is able to find, for the first time, lower bounds for instances of three real-world datasets commonly used in the literature. Furthermore, new best known solutions are obtained for these instances by means of a simple heuristic method with the columns generated
format	article
author	Rocha, Caroline Thennecy de Medeiros Aloise, Daniel Hansen, Pierre Santi, Éverton
author_facet	Rocha, Caroline Thennecy de Medeiros Aloise, Daniel Hansen, Pierre Santi, Éverton
author_sort	Rocha, Caroline Thennecy de Medeiros
title	Column generation bounds for numerical microaggregation
title_short	Column generation bounds for numerical microaggregation
title_full	Column generation bounds for numerical microaggregation
title_fullStr	Column generation bounds for numerical microaggregation
title_full_unstemmed	Column generation bounds for numerical microaggregation
title_sort	column generation bounds for numerical microaggregation
publisher	Springer
publishDate	2020
url	https://repositorio.ufrn.br/handle/123456789/30554
work_keys_str_mv	AT rochacarolinethennecydemedeiros columngenerationboundsfornumericalmicroaggregation AT aloisedaniel columngenerationboundsfornumericalmicroaggregation AT hansenpierre columngenerationboundsfornumericalmicroaggregation AT santieverton columngenerationboundsfornumericalmicroaggregation
_version_	1773959071187075072

Column generation bounds for numerical microaggregation

Registros relacionados