Friendship networks are very useful in recommender systems. For instance, by knowing homophily between two people, we can recommend them a product one of them has but not the other.


This project aims to develop an algorithm (and/or train a neural network) to predict if two individuals are friends or not using trajectory similarity and/or mobility habits. 

It is important for a dataset to have ground-truth for friendship information to achieve this objective. Therefore, we focus our research on the Breadcrumbs dataset (it is mandatory to work on this dataset). However, if students want to evaluate their solution on more datasets, they are encouraged to do so. Moreover, the Breadcrumbs dataset contain a “point-of-interest” table where each individual’s places are recorded. We plan a three-step plan for this project as follows:

Step 1: Implement the algorithm in [3].

Step 2: Evaluate the algorithm in [3].

Step 3: Improve the algorithm in [3] using other information from Breadcrumbs dataset such as answers from the “survey” table.

Step 4: Evaluate the improved algorithm in Step 3.

This subject as a Semester Project is a guided project.

If you want to learn more about the Breadcrumbs Dataset, we suggest you read the Breadcrumbs Paper [1] and Breadcrumbs Dataset Description [2].


Students must be confident with their algorithms, mathematics, programming, data science, and machine learning skills. Preferred programming languages are Java and Python.


[1] Vaibhav Kulkarni, Arielle Moro, Bertil Chapuis, and Benoît Garbinato. 2017. Extracting Hotspots without A-priori by Enabling Signal Processing over Geospatial Data. In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL ’17). Association for Computing Machinery, New York, NY, USA, Article 79, 1–4. DOI:

[2] Breadcrumbs Dataset Description,