The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Para o primeiro estágio do método de bucketização multissensível (MSB), o l-o agrupamento de diversidade para vários atributos sensíveis está incompleto, causando mais perda de informações. Para resolver este problema, damos as definições do l- conjunto de evitação de diversidade para múltiplos atributos sensíveis e evitando um balde multidimensional, e propor um completo l-algoritmo de agrupamento de diversidade (CLDG) para vários atributos sensíveis. Em seguida, melhoramos os primeiros estágios dos algoritmos MSB aplicando-lhes o algoritmo CLDG. Os resultados experimentais mostram que a proporção de agrupamento dos primeiros estágios melhorados dos algoritmos MSB é significativamente maior do que a dos primeiros estágios originais dos algoritmos MSB, diminuindo a perda de informação dos microdados publicados.
Yuelei XIAO
Xi'an University of Post & Telecommunications
Shuang HUANG
Xi'an University of Post & Telecommunications
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Yuelei XIAO, Shuang HUANG, "Complete l-Diversity Grouping Algorithm for Multiple Sensitive Attributes and Its Applications" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 7, pp. 984-990, July 2021, doi: 10.1587/transfun.2020EAL2084.
Abstract: For the first stage of the multi-sensitive bucketization (MSB) method, the l-diversity grouping for multiple sensitive attributes is incomplete, causing more information loss. To solve this problem, we give the definitions of the l-diversity avoidance set for multiple sensitive attributes and the avoiding of a multiple dimensional bucket, and propose a complete l-diversity grouping (CLDG) algorithm for multiple sensitive attributes. Then, we improve the first stages of the MSB algorithms by applying the CLDG algorithm to them. The experimental results show that the grouping ratio of the improved first stages of the MSB algorithms is significantly higher than that of the original first stages of the MSB algorithms, decreasing the information loss of the published microdata.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAL2084/_p
Copiar
@ARTICLE{e104-a_7_984,
author={Yuelei XIAO, Shuang HUANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Complete l-Diversity Grouping Algorithm for Multiple Sensitive Attributes and Its Applications},
year={2021},
volume={E104-A},
number={7},
pages={984-990},
abstract={For the first stage of the multi-sensitive bucketization (MSB) method, the l-diversity grouping for multiple sensitive attributes is incomplete, causing more information loss. To solve this problem, we give the definitions of the l-diversity avoidance set for multiple sensitive attributes and the avoiding of a multiple dimensional bucket, and propose a complete l-diversity grouping (CLDG) algorithm for multiple sensitive attributes. Then, we improve the first stages of the MSB algorithms by applying the CLDG algorithm to them. The experimental results show that the grouping ratio of the improved first stages of the MSB algorithms is significantly higher than that of the original first stages of the MSB algorithms, decreasing the information loss of the published microdata.},
keywords={},
doi={10.1587/transfun.2020EAL2084},
ISSN={1745-1337},
month={July},}
Copiar
TY - JOUR
TI - Complete l-Diversity Grouping Algorithm for Multiple Sensitive Attributes and Its Applications
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 984
EP - 990
AU - Yuelei XIAO
AU - Shuang HUANG
PY - 2021
DO - 10.1587/transfun.2020EAL2084
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2021
AB - For the first stage of the multi-sensitive bucketization (MSB) method, the l-diversity grouping for multiple sensitive attributes is incomplete, causing more information loss. To solve this problem, we give the definitions of the l-diversity avoidance set for multiple sensitive attributes and the avoiding of a multiple dimensional bucket, and propose a complete l-diversity grouping (CLDG) algorithm for multiple sensitive attributes. Then, we improve the first stages of the MSB algorithms by applying the CLDG algorithm to them. The experimental results show that the grouping ratio of the improved first stages of the MSB algorithms is significantly higher than that of the original first stages of the MSB algorithms, decreasing the information loss of the published microdata.
ER -