Understanding travel-activity behaviors is important for transport planning, particularly for the provisions of new mobility services. Exploratory analyses can be helpful in getting initial insights into these behaviors. This study presents an application of Graph Edit Distance (GED), which has yet to be explored in a transportation context, for clustering weekly Travel-Activity Patterns (TAPs). We used a dataset of 20,480 respondents in an online survey in Japan in 2021 for evaluating the approach. TAPs were represented as graph objects and a GED matrix was computed with the optimal edit cost structure obtained using a robustness index (RI). The K-medoids algorithm identified six clusters, including two clusters of car drivers, two clusters of public transport, one cluster of active travel modes, and one cluster of multiple travel modes. These clusters were visualized by a two-dimensional space produced by Discriminant Correspondence Analysis (DICA), with car access, occupation status, and age identified as the most important variables for discriminating them. Overall, the usefulness of GED (and the follow up DICA) in clustering TAPs was illustrated, and some directions for further uses of GED in studying travel-activity behaviors were discussed.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Travel-Activity Patterns Identification Using Graph Edit Distance


    Contributors:


    Publication date :

    2023-09-24


    Size :

    893541 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Bayesian Graph Edit Distance

    Myers, R. / Wilson, R. / Hancock, E. et al. | British Library Conference Proceedings | 1999


    Edit distance from graph spectra

    Robles-Kelly, / Hancock, | IEEE | 2003


    Edit Distance from Graph Spectra

    Robles-Kelly, A. / Hancock, E. / IEEE | British Library Conference Proceedings | 2003


    Approximate graph edit distance computation by means of bipartite graph matching

    Riesen, K. / Bunke, H. | British Library Online Contents | 2009


    Computation of graph edit distance: Reasoning about optimality and speed-up

    Serratosa, F. | British Library Online Contents | 2015