Change search
ReferencesLink to record
Permanent link

Direct link
Improved algorithm for weighted matching of employees
Linköping University, Department of Computer and Information Science, Database and information techniques.
2015 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

This report gives the reader a detailed description of a computer engineering master thesis work done at the company Netlight Consulting AB. Netlight Consulting AB is a growing IT consulting company based in Stockholm with offices in major cities across Europe. One of their key success factors is their focus on personal and professional development amongst all employees. An essential part of this development program consist of reoccurring evaluation periods, where every employee receives written constructive feedback from some of their co-workers. This thesis’ focus lies in improving the algorithm that organizes which employee should evaluate who. The original algorithm turned out to harbor a number of flaws, e.g. it was not always able to deliver a satisfactory matching where every participant received the minimum number of evaluations.


In this thesis a new matching algorithm has been implemented that is platform independent and that facilitates future modifications with accessible source code written in Java. The input data for the matching algorithm, i.e. the set of all potential evaluation pairs, is of importance to obtain satisfactory matching results. The number of potential evaluation pairs determines the number of possible matching combinations, which in turn increases the probability to find a satisfactory matching. In this thesis the input data has been extended by utilizing a data mining technique known as SONAR. Two different data mining sources were evaluated, and one of them is shown to extend the number of potential evaluation pairs in the matching input by 20%. Finally, a new feature to support assignment of different evaluation sizes was added to the matching algorithm.

Place, publisher, year, edition, pages
2015. , 80 p.
Keyword [en]
SONAR, Graph, Matching, Data mining, Linear programming, Linear regression, Constraint satisfaction
National Category
Computer Engineering
URN: urn:nbn:se:liu:diva-122763ISRN: LIU-IDA/LITH-EX-A--15/063--SEOAI: diva2:881511
External cooperation
Netlight Consulting AB
Subject / course
Computer Engineering
2015-11-13, Donald Knuth, Linköpings universitet, SE-581 83 Linköping, Sweden, 10:00 (Swedish)
Available from: 2015-12-15 Created: 2015-11-20 Last updated: 2015-12-15Bibliographically approved

Open Access in DiVA

fulltext(2433 kB)192 downloads
File information
File name FULLTEXT01.pdfFile size 2433 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Search in DiVA

By author/editor
Olofsson, Emil
By organisation
Database and information techniques
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 192 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 145 hits
ReferencesLink to record
Permanent link

Direct link