Per citar aquest document: https://ddd.uab.cat/record/170940
Web of Science: 1 cites,
Supervised learning using a symmetric bilinear form for record linkage
Abril Castellano, Daniel (Institut d'Investigació en Intel·ligència Artificial (IIIA-CSIC))
Torra i Reventós, Vicenç, dir. (Institut d'Investigació en Intel·ligència Artificial (IIIA-CSIC))
Navarro-Arribas, Guillermo (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)

Data: 2015
Resum: Record Linkage is used to link records of two different files corresponding to the same individuals. These algorithms are used for database integration. In data privacy, these algorithms are used to evaluate the disclosure risk of a protected data set by linking records that belong to the same individual. The degree of success when linking the original (unprotected data) with the protected data gives an estimation of the disclosure risk. In this paper we propose a new parameterized aggregation operator and a supervised learning method for disclosure risk assessment. The parameterized operator is a symmetric bilinear form and the supervised learning method is formalized as an optimization problem. The target of the optimization problem is to find the values of the aggregation parameters that maximize the number of re-identification (or correct links). We evaluate and compare our proposal with other non-parametrized variations of record linkage, such as those using the Mahalanobis distance and the Euclidean distance (one of the most used approaches for this purpose). Additionally, we also compare it with other previously presented parameterized aggregation operators for record linkage such as the weighted mean and the Choquet integral. From these comparisons we show how the proposed aggregation operator is able to overcome or at least achieve similar results than the other parameterized operators. We also study which are the necessary optimization problem conditions to consider the described aggregation functions as metric functions.
Nota: Número d'acord de subvenció MICINN/CSD2007-00004
Nota: Número d'acord de subvenció MICINN/TIN2010-15764
Nota: Número d'acord de subvenció MICINN/TIN2011-27076-C03-03
Nota: Número d'acord de subvenció EC/FP7/262608
Drets: Tots els drets reservats.
Llengua: Anglès
Document: article ; recerca ; acceptedVersion
Matèria: Record linkage ; Data privacy ; Disclosure risk ; Bilinear form ; Choquet integral
Publicat a: Information fusion, Vol. 26 (Novembre 2015) , p. 144-153, ISSN 1566-2535

DOI: 10.1016/j.inffus.2014.11.004


Disponible a partir de: 2017-11
Post-print

El registre apareix a les col·leccions:
Documents de recerca > Documents dels grups de recerca de la UAB > Centres i grups de recerca (producció científica) > Enginyeries > Security of Networks and Distributed Applications (SENDA)
Articles > Articles de recerca
Articles > Articles publicats

 Registre creat el 2017-03-13, darrera modificació el 2017-10-13



   Favorit i Compartir