<?xml version="1.0" encoding="UTF-8"?>
<XML><RECORDS>
<RECORD>
	<REFERENCE_TYPE>31</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Daniel Abril</AUTHOR>
		<AUTHOR>Guillermo Navarro-Arribas</AUTHOR>
		<AUTHOR>Vicenç Torra</AUTHOR>
	</AUTHORS>
	<YEAR>2011</YEAR>
	<TITLE>Supervised learning using mahalanobis distance for record linkage</TITLE>
	<SECONDARY_AUTHORS>
		<SECONDARY_AUTHOR>Bernard De Baets, Radko Mesiar, Luigi Troiano</SECONDARY_AUTHOR>
	</SECONDARY_AUTHORS>
	<SECONDARY_TITLE>6th International Summer School on Aggregation Operators-AGOP2011</SECONDARY_TITLE>
	<PLACE_PUBLISHED>Univ. of Sannio, Benevento, Italy</PLACE_PUBLISHED>
	<PUBLISHER>Lulu.com</PUBLISHER>
	<PAGES>223--228</PAGES>
	<DATE>11/07/2011</DATE>
	<ISBN> 978-1-4477-7019-0</ISBN>
	<KEYWORDS>
		<KEYWORD>data</KEYWORD>
		<KEYWORD>privacy,</KEYWORD>
		<KEYWORD>record</KEYWORD>
		<KEYWORD>linkage,</KEYWORD>
		<KEYWORD>disclosure</KEYWORD>
		<KEYWORD>risk,</KEYWORD>
		<KEYWORD>Mahalanobis</KEYWORD>
		<KEYWORD>distance</KEYWORD>
		<KEYWORD>,</KEYWORD>
		<KEYWORD>fuzzy</KEYWORD>
		<KEYWORD>measure,</KEYWORD>
		<KEYWORD>Choquet</KEYWORD>
		<KEYWORD>integral</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>In data privacy, record linkage is a well known technique used to evaluate the disclosure risk of  protected data. Mainly, the idea is the linkage between records of different databases, which make reference to the same individuals. In this paper we introduce a new parametrized  variation of record linkage relying on the Mahalanobis distance, and a supervised learning method to determine the optimum simulated covariance matrix for the linkage process. We evaluate and compare our proposal with other studied parametrized and not parametrized variations of record linkage, such as weighted mean or the Choquet integral, which determines the optimal fuzzy measure.</ABSTRACT>
	<URL>http://agop2011.ciselab.org/proceedings</URL>
</RECORD>
</RECORDS></XML>