Group project for the Algorithmic Methods of Data Mining course — Sc.M. in Data Science, Sapienza University of Rome, A.Y. 2024–2025 (Homework 5, Group 12).
The goal of this project is to build a Graph in order to compute the most significant features.
Then we have implemented by scratch the most important search algorithm in the Graphs, such as Dijkstra or BFS.
All the data we've worked on was downloaded from the Kaggle dataset.
-
In this repository you can find:
main.ipynb:
- A Jupyter Notebook where we gather all the answers and the explanations to the Research and Algorithmic Questions.
functions.py:
- A python script where we have define the functions we have used in the
main.ipynb
assets/*:
- all Folium interactive maps asked in the Homework, like the following one:
