Understanding human mobility patterns in Chicago: an analysis of taxi data using clustering techniques

June 21, 2023 · Entered Twilight · 🏛 arXiv.org

Repo contents: .gitignore, HCS.py, README.md, data_to_graph.ipynb, get_graph_from_data.py, igraph_clusters.ipynb, leiden.csv, requirements.txt, spectral_clustering.ipynb, spectral_clustering_travel_time.ipynb, spectral_clustering_travel_time_2.ipynb, undirected_0_02.png, undirected_0_04.png, undirected_0_06.png, undirected_0_08.png, undirected_0_10.png, undirected_0_12.png, undirected_0_14.png, undirected_0_16.png, undirected_0_18.png, walktrap.csv, walktrap.png

Authors Harish Chauhan, Nikunj Gupta, Zoe Haskell-Craig arXiv ID 2306.12094 Category cs.SI: Social & Info Networks Cross-listed cs.LG Citations 1 Venue arXiv.org Repository https://github.com/Nikunj-Gupta/Spectral-Clustering-Directed-Graphs ⭐ 4 Last Checked 3 months ago

Abstract

Understanding human mobility patterns is important in applications as diverse as urban planning, public health, and political organizing. One rich source of data on human mobility is taxi ride data. Using the city of Chicago as a case study, we examine data from taxi rides in 2016 with the goal of understanding how neighborhoods are interconnected. This analysis will provide a sense of which neighborhoods individuals are using taxis to travel between, suggesting regions to focus new public transit development efforts. Additionally, this analysis will map traffic circulation patterns and provide an understanding of where in the city people are traveling from and where they are heading to - perhaps informing traffic or road pollution mitigation efforts. For the first application, representing the data as an undirected graph will suffice. Transit lines run in both directions so simply a knowledge of which neighborhoods have high rates of taxi travel between them provides an argument for placing public transit along those routes. However, in order to understand the flow of people throughout a city, we must make a distinction between the neighborhood from which people are departing and the areas to which they are arriving - this requires methods that can deal with directed graphs. All developed codes can be found at https://github.com/Nikunj-Gupta/Spectral-Clustering-Directed-Graphs.