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'.
 

The Facebook love connector

Dewandeleer, Thomas
(2016)

Files

Dewandeleer_56621000_2016.pdf
  • Closed access
  • Adobe PDF
  • 2.29 MB
Dewandeleer_56621000_2016pdf.zip
  • Open access
  • Unknown
  • 1.78 MB
Download

Details

Supervisors
Deville, Yves
Faculty
Ecole polytechnique de Louvain
Degree label
Master [120] en sciences informatiques
Abstract
The context of this work was to try developing a method that would quantify the similarities between two people based on their Facebook information. Nowadays, a lot of comparison methods for graphs are based on the structure of the graphs but there are very few methods that do the comparison between graphs regarding the structure of it but also the information that is embedded in it. This work tries to find a good solution to this problem by using the combination of an algorithm that compares the structure of two graphs and an algorithm that compares the information embedded in the graphs. In order to illustrate the work, an android application applying those algorithms was developed.