对变量进行分组以方便统计披露,限制了多变量数据集的方法。

Anna Oganian, Ionut Iacob, Goran Lesaja
{"title":"对变量进行分组以方便统计披露,限制了多变量数据集的方法。","authors":"Anna Oganian, Ionut Iacob, Goran Lesaja","doi":"10.1007/978-3-319-99771-1_13","DOIUrl":null,"url":null,"abstract":"<p><p>Data sets that are subject to Statistical Disclosure Limitation (SDL) often have many variables of different types that need to be altered for disclosure limitation. To produce a good quality public data set, the data protector needs to account for the relationships between the variables. Hence, ideally SDL methods should not be univariate, that is, treating each variable independently of others, but multivariate, handling many variables at the same time. However, if a data set has many variables, as most government survey data do, the task of developing and implementing a multivariate approach for SDL becomes difficult. In this paper we propose a pre-masking data processing procedure which consists of clustering the variables of high dimensional data sets, so that different groups of variables can be masked independently, thus reducing the complexity of SDL. We consider different hierarchical clustering methods, including our version of hierarchical clustering algorithm, that we call <i>K-Link</i>, and outline how the data protector can define an appropriate number of clusters for these methods. We implemented and applied these methods to two genuine multivariate data sets. The results of the experiments show that <i>K-Link</i> has a potential to solve this problem efficiently. The success of the method, however, depends on the correlation structure of the data. For the data sets where most of the variables are correlated, clustering of variables and subsequent independent application of SDL methods to different clusters may lead to attenuated correlation in the masked data, even for efficient clustering methods. Thereby, the proposed approach is a trade-off between the computational complexity of multivariate SDL methods and data utility loss due to independent treatment of different clusters by SDL methods. <b>Keywords and phrases:</b> Statistical disclosure limitation (SDL), hierarchical clustering, dimensionality reduction.</p>","PeriodicalId":91946,"journal":{"name":"Privacy in statistical databases. PSD (Conference : 2004- )","volume":"? ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7182379/pdf/nihms-1016601.pdf","citationCount":"0","resultStr":"{\"title\":\"Grouping of variables to facilitate statistical disclosure limitation methods in multivariate data sets.\",\"authors\":\"Anna Oganian, Ionut Iacob, Goran Lesaja\",\"doi\":\"10.1007/978-3-319-99771-1_13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Data sets that are subject to Statistical Disclosure Limitation (SDL) often have many variables of different types that need to be altered for disclosure limitation. To produce a good quality public data set, the data protector needs to account for the relationships between the variables. Hence, ideally SDL methods should not be univariate, that is, treating each variable independently of others, but multivariate, handling many variables at the same time. However, if a data set has many variables, as most government survey data do, the task of developing and implementing a multivariate approach for SDL becomes difficult. In this paper we propose a pre-masking data processing procedure which consists of clustering the variables of high dimensional data sets, so that different groups of variables can be masked independently, thus reducing the complexity of SDL. We consider different hierarchical clustering methods, including our version of hierarchical clustering algorithm, that we call <i>K-Link</i>, and outline how the data protector can define an appropriate number of clusters for these methods. We implemented and applied these methods to two genuine multivariate data sets. The results of the experiments show that <i>K-Link</i> has a potential to solve this problem efficiently. The success of the method, however, depends on the correlation structure of the data. For the data sets where most of the variables are correlated, clustering of variables and subsequent independent application of SDL methods to different clusters may lead to attenuated correlation in the masked data, even for efficient clustering methods. Thereby, the proposed approach is a trade-off between the computational complexity of multivariate SDL methods and data utility loss due to independent treatment of different clusters by SDL methods. <b>Keywords and phrases:</b> Statistical disclosure limitation (SDL), hierarchical clustering, dimensionality reduction.</p>\",\"PeriodicalId\":91946,\"journal\":{\"name\":\"Privacy in statistical databases. PSD (Conference : 2004- )\",\"volume\":\"? \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7182379/pdf/nihms-1016601.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Privacy in statistical databases. PSD (Conference : 2004- )\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-99771-1_13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Privacy in statistical databases. PSD (Conference : 2004- )","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-99771-1_13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

受统计披露限制(SDL)约束的数据集通常具有许多不同类型的变量,需要对其进行更改以限制披露。为了生成高质量的公共数据集,数据保护程序需要考虑变量之间的关系。因此,理想的SDL方法不应该是单变量的,即独立地处理每个变量,而应该是多变量的,即同时处理多个变量。然而,如果一个数据集有许多变量,就像大多数政府调查数据一样,那么开发和实现SDL的多变量方法的任务就会变得困难。本文提出了一种预掩蔽数据处理方法,该方法将高维数据集的变量聚类,使不同的变量组可以独立掩蔽,从而降低了SDL的复杂性。我们考虑了不同的分层聚类方法,包括我们的分层聚类算法版本,我们称之为K-Link,并概述了数据保护器如何为这些方法定义适当数量的聚类。我们在两个真正的多元数据集上实现并应用了这些方法。实验结果表明,K-Link具有有效解决这一问题的潜力。然而,该方法的成功取决于数据的相关结构。对于大多数变量是相关的数据集,对变量进行聚类并随后对不同的聚类独立应用SDL方法可能会导致被屏蔽数据的相关性减弱,即使是高效的聚类方法。因此,所提出的方法是在多元SDL方法的计算复杂性和SDL方法独立处理不同聚类导致的数据效用损失之间的权衡。关键词:统计披露限制(SDL),层次聚类,降维。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Grouping of variables to facilitate statistical disclosure limitation methods in multivariate data sets.

Grouping of variables to facilitate statistical disclosure limitation methods in multivariate data sets.

Data sets that are subject to Statistical Disclosure Limitation (SDL) often have many variables of different types that need to be altered for disclosure limitation. To produce a good quality public data set, the data protector needs to account for the relationships between the variables. Hence, ideally SDL methods should not be univariate, that is, treating each variable independently of others, but multivariate, handling many variables at the same time. However, if a data set has many variables, as most government survey data do, the task of developing and implementing a multivariate approach for SDL becomes difficult. In this paper we propose a pre-masking data processing procedure which consists of clustering the variables of high dimensional data sets, so that different groups of variables can be masked independently, thus reducing the complexity of SDL. We consider different hierarchical clustering methods, including our version of hierarchical clustering algorithm, that we call K-Link, and outline how the data protector can define an appropriate number of clusters for these methods. We implemented and applied these methods to two genuine multivariate data sets. The results of the experiments show that K-Link has a potential to solve this problem efficiently. The success of the method, however, depends on the correlation structure of the data. For the data sets where most of the variables are correlated, clustering of variables and subsequent independent application of SDL methods to different clusters may lead to attenuated correlation in the masked data, even for efficient clustering methods. Thereby, the proposed approach is a trade-off between the computational complexity of multivariate SDL methods and data utility loss due to independent treatment of different clusters by SDL methods. Keywords and phrases: Statistical disclosure limitation (SDL), hierarchical clustering, dimensionality reduction.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信