<div class="csl-bib-body">
<div class="csl-entry">Krenn, B. (2019). <i>Algorithms for implicit delegation to predict preferences</i> [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.69824</div>
</div>
-
dc.identifier.uri
https://doi.org/10.34726/hss.2019.69824
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/3256
-
dc.description.abstract
The lives of people are becoming more and more digitalized. With this their preferences over different topics like their favorite music or websites can be collected and analyzed. One possible goal of such an analysis is to create an overall ranking with the preferences of multiple people or countries. For this computational social choice comes into play with algorithms that take multiple rankings as input and output one ranking that represents the whole group as good and fair as possible, these algorithms are called social welfare functions. If some application wants then to create regular rankings that include the preferences of all its users there needs to be a way to predict the current preference rankings of users that did pause using the service. For this implicit delegation could be the solution as it takes previous preference data that is known and tries to create new rankings from them for the given user/person. For this thesis some algorithms were developed that try to accomplish this. One goal of these algorithms is to produce rankings that match the actual top-k preferences of a user or also called voter. As second goal it is attempted to replace multiple missing rankings and then use social welfare functions to aggregate them. Here it optimally produces a ranking that is as similar to an aggregated ranking with the real data as possible. For the similarity Kendall tau algorithms are used. To see how the implicit delegation methods work on real world data they are tested on real data sets from sources like Spotify.
en
dc.language
English
-
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
Computational Social Choice
en
dc.subject
Preference Aggregation
en
dc.title
Algorithms for implicit delegation to predict preferences
en
dc.title.alternative
Algorithmen für Implizite Delegation zur Vorhersage von Präferenzen
de
dc.type
Thesis
en
dc.type
Hochschulschrift
de
dc.rights.license
In Copyright
en
dc.rights.license
Urheberrechtsschutz
de
dc.identifier.doi
10.34726/hss.2019.69824
-
dc.contributor.affiliation
TU Wien, Österreich
-
dc.rights.holder
Benjamin Krenn
-
dc.publisher.place
Wien
-
tuw.version
vor
-
tuw.thesisinformation
Technische Universität Wien
-
dc.contributor.assistant
Lackner, Martin
-
tuw.publication.orgunit
E192 - Institut für Logic and Computation
-
dc.type.qualificationlevel
Diploma
-
dc.identifier.libraryid
AC15545838
-
dc.description.numberOfPages
89
-
dc.identifier.urn
urn:nbn:at:at-ubtuw:1-133236
-
dc.thesistype
Diplomarbeit
de
dc.thesistype
Diploma Thesis
en
dc.rights.identifier
In Copyright
en
dc.rights.identifier
Urheberrechtsschutz
de
tuw.advisor.staffStatus
staff
-
tuw.assistant.staffStatus
staff
-
tuw.assistant.orcid
0000-0003-2170-0770
-
item.openaccessfulltext
Open Access
-
item.openairecristype
http://purl.org/coar/resource_type/c_bdcc
-
item.grantfulltext
open
-
item.mimetype
application/pdf
-
item.languageiso639-1
en
-
item.openairetype
master thesis
-
item.fulltext
with Fulltext
-
item.cerifentitytype
Publications
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence