Mostra el registre d'ítem simple
Optimal assignment problem on record linkage
dc.contributor | Nin Guerrero, Jordi |
dc.contributor.author | Rodriguez Fernandez, Pablo |
dc.date.accessioned | 2013-07-01T14:54:31Z |
dc.date.available | 2013-07-01T14:54:31Z |
dc.date.issued | 2013-06-04 |
dc.identifier.uri | http://hdl.handle.net/2099.1/18665 |
dc.description.abstract | We present an application of the Hungarian Method, an optimal assignment graph theory algorithm, to record linkage in order to improve the disclosure risk assessment. We should note that Hungarian Method has O(n^3) complexity; three different methods are presented to reduce its computational cost. |
dc.language.iso | eng |
dc.publisher | Universitat Politècnica de Catalunya |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.lcsh | Electronic data processing |
dc.subject.other | privacitat |
dc.subject.other | seguretat |
dc.subject.other | control de revelació |
dc.subject.other | assignació òptima |
dc.subject.other | procés de reidentificació |
dc.subject.other | hadoop |
dc.subject.other | privacy |
dc.subject.other | disclosure control |
dc.subject.other | optimal assignment |
dc.subject.other | record linkage |
dc.subject.other | hungarian method |
dc.subject.other | hadoop |
dc.subject.other | security |
dc.title | Optimal assignment problem on record linkage |
dc.type | Master thesis (pre-Bologna period) |
dc.subject.lemac | Processament electrònic de dades |
dc.subject.lemac | Extracció de dades -- Automatització |
dc.identifier.slug | 86012 |
dc.rights.access | Open Access |
dc.date.updated | 2013-06-17T22:06:42Z |
dc.audience.educationlevel | Estudis de primer/segon cicle |
dc.audience.mediator | Facultat d'Informàtica de Barcelona |
dc.audience.degree | ENGINYERIA INFORMÀTICA (Pla 2003) |