Ranking items: Is solving a seriation problem a good alternative for existing methods?

Ranking items: Is solving a seriation problem a good alternative for existing methods?

Cederhout, Quinten (TU Delft Electrical Engineering, Mathematics and Computer Science)

De Klerk, Etienne (mentor)
van Elderen, Emiel (graduation committee)
Vermolen, Fred (graduation committee)

Delft University of Technology

2017

In this dissertation we look at the seriation problem and the applications of this problem. Given a set of items, we try to find an ordering based on the similarity between the items. We start by explaining the mathematical theory behind the seriation problem. Then we describe a couple of different methods that can be used to find a solution for the problem. After that, we apply these methods to various different datasets. The results of these tests will be analysed.
Solving a seriation problem can be an alternative way to already existing methods when finding a ranking of items for a given dataset. The goal is to find out if is also a viable method to use in practice.

Ranking
Optimisation
Seriation
Competition
Algorithm
Voting theory
Sports

http://resolver.tudelft.nl/uuid:2b67e3c3-cbf6-4727-b72c-b21be6983571

Student theses

bachelor thesis

© 2017 Quinten Cederhout