Results 1 -
7 of
7
Towards the use of OWA operators for record linkage
- Proc. of the European Soc. on Fuzzy Logic and Technologies, CD-ROM
, 2005
"... Record linkage is used to establish links between those records that while belonging to two dierent les correspond to the same individual. Classical approaches assume that the two les contain some common variables, that are the ones used to link the records. Recently, we introduced a new approach to ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Record linkage is used to establish links between those records that while belonging to two dierent les correspond to the same individual. Classical approaches assume that the two les contain some common variables, that are the ones used to link the records. Recently, we introduced a new approach to link records among les when such common vari-ables are not available. In this approach, re-identi cation is based on the so-called structural information. In this paper we study the use of OWA operators for extracting such structural in-formation and, thus, allowing re-identication.
Microdata Protection Through Approximate Microaggregation
"... Microdata protection is a hot topic in the field of Statistical Disclosure Control, which has gained special interest after the disclosure of 658000 queries by the America Online (AOL) search engine in August 2006. Many algorithms, methods and properties have been proposed to deal with microdata dis ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Microdata protection is a hot topic in the field of Statistical Disclosure Control, which has gained special interest after the disclosure of 658000 queries by the America Online (AOL) search engine in August 2006. Many algorithms, methods and properties have been proposed to deal with microdata disclosure. One of the emerging concepts in microdata protection is k-anonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect private individual information and is gaining increasing popularity. k-anonymity requires that every record in the microdata table released be indistinguishably related to no fewer than k respondents. In this paper, we apply the concept of entropy to propose a distance metric to evaluate the amount of mutual information among records in microdata, and propose a method of constructing dependency tree to find the key attributes, which we then use to process approximate microaggregation. Further, we adopt this new microaggregation technique to study k-anonymity problem, and an efficient algorithm is developed. Experimental results show that the proposed microaggregation technique is efficient and effective in the terms of running time and information loss. Keywords: Microdata Protection, Privacy; 1
100 Multivariate Microaggregation Based Genetic Algorithms
"... Abstract — Microaggregation is a clustering problem with cardinality constraints that originated in the area of statistical disclosure control for microdata. This article presents a method for multivariate microaggregation based on genetic algorithms (GA). The adaptations required to characterize th ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract — Microaggregation is a clustering problem with cardinality constraints that originated in the area of statistical disclosure control for microdata. This article presents a method for multivariate microaggregation based on genetic algorithms (GA). The adaptations required to characterize the multivariate microaggregation problem are explained and justified. Extensive experimentation has been carried out with the aim of finding the best values for the most relevant parameters of the modified GA: the population size and the crossover and mutation rates. The experimental results demonstrate that our method finds the optimal solution to the problem in almost all experiments when working with small data sets. Thus, for small data sets the proposed method performs better than known polynomial heuristics and can be combined with these for larger data sets. Moreover, a sensitivity analysis of parameter values is reported which shows the influence of the parameters and their best values.
EUSFLAT- LFA 2005 Towards the use of OWA operators for record linkage
"... Record linkage is used to establish links between those records that while belonging to two different files correspond to the same individual. Classical approaches assume that the two files contain some common variables, that are the ones used to link the records. Recently, we introduced a new appro ..."
Abstract
- Add to MetaCart
(Show Context)
Record linkage is used to establish links between those records that while belonging to two different files correspond to the same individual. Classical approaches assume that the two files contain some common variables, that are the ones used to link the records. Recently, we introduced a new approach to link records among files when such common variables are not available. In this approach, reidentification is based on the so-called structural information. In this paper we study the use of OWA operators for extracting such structural information and, thus, allowing re-identification.
Statistical Disclosure Control for Microdata vs Artificial Intelligence
"... this paper is to stimulate interaction and increase synergy between researchers in both fields ..."
Abstract
- Add to MetaCart
this paper is to stimulate interaction and increase synergy between researchers in both fields
On the Re-Identification of Individuals Described by . . .
, 2001
"... In this paper we consider a first attempt to deal with re-identification of individuals when the variables in the two data files to be matched are not exactly the same but "similar". ..."
Abstract
- Add to MetaCart
In this paper we consider a first attempt to deal with re-identification of individuals when the variables in the two data files to be matched are not exactly the same but "similar".
