Author(s): Kolbert, András Péter
Date: 2018
Persistent ID: http://hdl.handle.net/10362/34383
Origin: Repositório Institucional da UNL
Subject(s): Job recommendation; Matrix factorisation; Alternating least squares; Latent dirichlet allocation; Scalable
Dissertation presented as the partial requirement for obtaining a Master's degree in Data Science and Advanced Analytics
A recommender system is one of the major techniques that handles information overload problem of Information Retrieval. Improves access and proactively recommends relevant information to each user, based on preferences and objectives. During the implementation and planning phases, designers have to cope with several issues and challenges that need proper attention. This thesis aims to show the issues and challenges in developing high-quality recommender systems. A paper solves a current research problem in the field of job recommendations using a distributed algorithmic framework built on top of Spark for parallel computation which allows the algorithm to scale linearly with the growing number of users. The final solution consists of two different recommenders which could be utilised for different purposes. The first method is mainly driven by latent topics among users, meanwhile the second technique utilises a latent factor algorithm that directly addresses the preference-confidence paradigm.
