Show simple item record

dc.contributorNin Guerrero, Jordi
dc.contributor.authorRodriguez Fernandez, Pablo
dc.date.accessioned2013-07-01T14:54:31Z
dc.date.available2013-07-01T14:54:31Z
dc.date.issued2013-06-04
dc.identifier.urihttp://hdl.handle.net/2099.1/18665
dc.description.abstractWe 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.isoeng
dc.publisherUniversitat Politècnica de Catalunya
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshElectronic data processing
dc.subject.otherprivacitat
dc.subject.otherseguretat
dc.subject.othercontrol de revelació
dc.subject.otherassignació òptima
dc.subject.otherprocés de reidentificació
dc.subject.otherhadoop
dc.subject.otherprivacy
dc.subject.otherdisclosure control
dc.subject.otheroptimal assignment
dc.subject.otherrecord linkage
dc.subject.otherhungarian method
dc.subject.otherhadoop
dc.subject.othersecurity
dc.titleOptimal assignment problem on record linkage
dc.typeMaster thesis (pre-Bologna period)
dc.subject.lemacProcessament electrònic de dades
dc.subject.lemacExtracció de dades -- Automatització
dc.identifier.slug86012
dc.rights.accessOpen Access
dc.date.updated2013-06-17T22:06:42Z
dc.audience.educationlevelEstudis de primer/segon cicle
dc.audience.mediatorFacultat d'Informàtica de Barcelona


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder