ATTENTION/WARNING - NE PAS DÉPOSER ICI/DO NOT SUBMIT HERE

Ceci est la version de TEST de DIAL.mem. Veuillez ne pas soumettre votre mémoire sur ce site mais bien à l'URL suivante: 'https://thesis.dial.uclouvain.be'.
This is the TEST version of DIAL.mem. Please use the following URL to submit your master thesis: 'https://thesis.dial.uclouvain.be'.
 

An algorithmic framework for avoiding filter bubbles

(2019)

Files

Laurinaviciute_44571700_2019.pdf
  • Closed access
  • Adobe PDF
  • 3.51 MB

Details

Supervisors
Faculty
Degree label
Abstract
Recommendation systems are designed to search for content similar to that which a user already has consumed in order to create a recommendation list likely to be of interest to the user. Recently, it has been argued that such systems not only filter out large amounts of available data but also produce a side-effect referred to as a filter bubble - a virtual environment which contains only contents that confirm users' own beliefs. In this master thesis, we propose a mathematical model of the filter bubble and propose an algorithmic challenge to avoid this phenomenon. Based on existing literature on the current flow centrality, we develop an algorithm which solves this challenge. The novelty of our approach is the ability to find sequences of sets of contents which serve as recommendations that lead the user towards unconsumed categories. In an extensive empirical study we applied our algorithm on RTBF data.