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

Bachelor thesis (2017)

Authors

Q. Cederhout Electrical Engineering, Mathematics and Computer Science

Contributors

E. de Klerk (mentor)
E.M. van Elderen (graduation committee member)
F.J. Vermolen (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2017 Quinten Cederhout
More Info
expand_more

Published Date

08-07-2017

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

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.