In Paris, counters are installed all over the city to measure bicycle traffic. They have sensors to detect when a bicycle passes them and hence they count the number of bicycles that pass at a certain location throughout the day. Counts are then aggregated by hours and the goal of this project was to predict future bicycle traffic in Paris.
In this project, we are asked by a portuguese bank to help them predict which customers are likely to subscribe to a financial product. A logistic regression was used to solve this problem using the software R.
Breadth-first search (BFS) and depth-first search (DFS) are two common algorithms for traversing a graph or tree data structure. BFS visits all the nodes in a level before going deeper, while DFS visits all the nodes as deep as possible before backtracking and visiting other nodes. In this project we discuss both algorithms, their specificity and how they can be used to solve problems