---
title: "Enhancing Sustainable Urban Mobility Prediction with Telecom Data: A Spatio-Temporal Framework Approach"
authors:
  - "ChungYi Lin"
  - "Shen-Lung Tung"
  - "Hung-Ting Su"
  - "Winston H. Hsu"
doi: "10.24963/ijcai.2024/812"
url: "https://ijcai.org/proceedings/2024/812"
pdf: "https://ijcai.org/proceedings/2024/0812.pdf"
venue: "Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence"
year: 2024
pages: "7340-7348"
track: "AI for Good"
keywords:
  - "Knowledge Representation and Reasoning: General"
  - "Data Mining: General"
---

# Enhancing Sustainable Urban Mobility Prediction with Telecom Data: A Spatio-Temporal Framework Approach

ChungYi Lin, Shen-Lung Tung, Hung-Ting Su, Winston H. Hsu

*Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence*, pages 7340-7348. DOI: [10.24963/ijcai.2024/812](https://doi.org/10.24963/ijcai.2024/812)

## Abstract

Traditional traffic prediction, limited by the scope of sensor data, falls short in comprehensive traffic management. Mobile networks offer a promising alternative using network activity counts, but these lack crucial directionality. Thus, we present the TeltoMob dataset, featuring undirected telecom counts and corresponding directional flows, to predict directional mobility flows on roadways. To address this, we propose a two-stage spatio-temporal graph neural network (STGNN) framework. The first stage uses a pre-trained STGNN to process telecom data, while the second stage integrates directional and geographic insights for accurate prediction. Our experiments demonstrate the framework's compatibility with various STGNN models and confirm its effectiveness. We also show how to incorporate the framework into real-world transportation systems, enhancing sustainable urban mobility.

## Full text

## 1 Introduction

Effective traffic management is crucial for intelligent transportation systems [Xie et al., 2020; Lv et al., 2021]. Traditional methods rely on costly detectors with limited coverage [Sen et al., 2012; Li et al., 2018; Guo et al., 2019]. With over 71% of the global population connected to mobile networks [Cisco, 2021], cellular traffic activities [Jiang, 2022] offer valuable insights. The count of cellular traffic (i.e., cellular traffic flow) can proxy traffic conditions [Lin et al., 2021a]. However, the lack of directionality in cellular traffic flows from road areas limits understanding commuting patterns and easing congestion, thus reducing their utility.

To extract directionality for traffic management, we present a task utilizing cellular traffic flows from selected road areas to predict user mobility counts (i.e., mobility flows) along routes (as Figure 1). This enhances the utility of undirected telecom data by providing directional insights, reducing costs and environmental impact associated with sensor deployment, and aligning with the Sustainable Development Goals (SDG) 1 for urban sustainability. To support this task, we propose the Tel-to-Mob dataset, including undirected telecombased flows from 34 roads and directed mobility flows for 84 routes, with analysis to exhibit its relevance to road structure.

1 https://sdgs.un.org/goals/goal11

Figure 1: Overview of the task and framework. Network activities collected at road areas (points 1 to 3) act as proxies for traffic conditions but lack crucial directionality for accurate traffic management. Our framework leverages non-directional telecom data from past time steps to predict future directional mobility flows, enhancing its utility for urban computing.

![Image](https://ijcai.org/proceedings/2024/fulltext/812/image_000000_e92a5f7c2cb017dba355f6af779fd9bb20f0060759b8532181f14d7f3b7d035b.png)

We identified two main challenges: Magnitude Disparity, where cellular traffic flows capture all users in an area, unlike mobility flows that reflect specific directional movements; and Amount Disparity, where a single road area being part of multiple routes leads to misalignments, hindering direct mapping from cellular traffic to mobility flows, a gap not addressed by current models (e.g., [Li et al., 2023; Lin et al., 2024]). To tackle these, we propose a SpatioTemporal Graph Neural Network (STGNN) Framework with two stages. Stage 1 employs a pre-trained STGNN to extract features from cellular traffic flows. Stage 2 transforms these features to integrate directionality and enhances them with geographical insights, using another STGNN to capture spatio-temporal dynamics and predict future mobility flows.

Overall, our main contributions:

- What Addressed: We use telecom-based flows to forecast directional mobility flows, overcoming traffic sensor limitations and advancing sustainable urban living.
- Who Involved: We use anonymous data from extensive mobile users provided by a cooperating telecom operator.
- How Evaluated: Our framework's effectiveness is evaluated based on prediction accuracy. All related data and code are accessible at: https://github.com/cy07gn/TeltoMob.

## 2 TeltoMob Dataset

Related Tasks. As cellular traffic is collected from mobile users moving across adjacent areas [Zhang et al., 2018], it exhibits spatial correlations [Wang et al., 2018; Wang et al., 2022]. However, the primary goal usually focuses on enhancing network resource allocation in specific areas [Yao et al., 2021; Zhao et al., 2021] or at base stations [Wang et al., 2018], as well as inducing energy savings [Lin et al., 2021b] and improving resource scheduling [He et al., 2020].

However, as we aim to utilize cellular traffic for transportation evaluation, the lack of directionality reduces its practicality for traffic management. Thus, we introduce the TeltoMob dataset, which contains undirected telecom-based flow and directed mobility flow among road sections.

## 2.1 Definitions

- Geographical Cellular Traffic (GCT). A cellular traffic record with its originating GPS coordinates, as Table 1A.
- Road Segment. A 20m x 20m road area, based on the average road size in the Proof-of-Concept area, as Figure 2(a).
- Route. A directional pathway from start road segment i to end segment j, denoted as ij.
- GCT Flow. The count of GCT records on a road segment, accumulated over a fixed time interval, as Figure 2(b).
- GCT Pairing. An entry by associating two GCT records from consecutive segments of the same user, as Table 1B.
- Mobility Flow. The count of GCT pairings along routes, recorded over fixed time intervals (see Figure 2(c)), offers an alternative to physical detectors, aligning with SDG aims.

| A. Examples of GCT Records - IMEI1   | A. Examples of GCT Records - Date   |   A. Examples of GCT Records - Latitude |   A. Examples of GCT Records - Longitude |
|--------------------------------------|-------------------------------------|-----------------------------------------|------------------------------------------|
| ... 524edbbd5122                     | 2022-09-06 18:02:17                 |                               24.801066 |                               120.987103 |
| a63cc2cc752e                         | 2022-09-06 18:02:23                 |                               24.801219 |                               120.987091 |
| f4f79deaff0c ...                     | 2022-09-06 18:02:30                 |                               24.801246 |                               120.987090 |

| B. Examples of GCT Pairings - Pairing2   | B. Examples of GCT Pairings - Start Time   | B. Examples of GCT Pairings - End Time   |
|------------------------------------------|--------------------------------------------|------------------------------------------|
| ... 524edbbd5122                         | 2022/09/06 18:02:17                        | 2022/09/06 18:04:02                      |
| a63cc2cc752e                             | 2022/09/06 18:02:23                        | 2022/09/06 18:11:52                      |
| f4f79deaff0c ...                         | 2022/09/06 18:02:30                        | 2022/09/06 18:11:51                      |

Table 1: Examples of GCT Records and GCT Pairings.

## 2.2 Data Collection and Processing

Location Selection. In collaboration with City Authorities, we selected 34 road segments based on criteria like daily commutes, and congestion-prone areas. The segments are near areas with distinct environments, including universities, shopping centers, and science parks.

After identifying road segments, we determined 84 directional routes based on the road network structure, facilitating GCT record pairing to capture mobility. Each route connects a start and end road segment.

GCT Records Sourcing. All GCT records are stored in the telecom company's Geographical Cellular Traffic Database. We extracted GCTs from 34 road segments, focusing on essential data fields-IMEI, recording time, and coordinates-for time efficiency, as shown in Table 1A.

GCT Pairings. We match two GCT records with the same IMEI number (i.e., the same user) across adjacent road segments, originating from the start and end road segments, respectively. The time difference between these records is kept within a 15-minute window to exclude pedestrian or nonvehicular traffic, thus focusing on vehicle movements. Table 1 displays the pairing results for route 30 31.

Processing. GCT and mobility flows denote the cumulative counts of GCT records and GCT pairings at 15-minute intervals, respectively, revealing unique temporal patterns for each road segment and route over time.

Figure 2: Overview of data collected from 34 road segments, including 84 directional routes in Hsinchu City. (a) The map depicts GCTs sourced from user activity, while mobility (i.e., GCT pairing) is determined by associating GCT records appearing in adjacent segments along routes. Color intensity represents the average volumes of GCT and mobility flows. (b) Sample daily GCT flow pattern. (c) Sample daily mobility flow pattern.

![Image](https://ijcai.org/proceedings/2024/fulltext/812/image_000001_f98cf776fd0f35827ec112f8eb9998ade8bf77d6153f5ead64793b3f0eae0923.png)

## 2.3 Data Privacy Protection

Data privacy is paramount in telecom data. Here's how we protect user anonymity and privacy for our task:

Location Constraints. We restrict data collection to road segments, avoiding sensitive areas like commercial or residential districts. We focus on GCTs from these segments, preventing tracking of journeys or user pattern identification. Data Aggregation. GCT flow is the cumulative count of GCT records that masks individual identities, securing user information for telecom data use.

International Standards. Our partner telecom company follows ISO 27001 standards, ensuring sensitive data management and access are rigorously controlled.

## 2.4 Data Analysis

Descriptive Statistics. Table 2 summarizes the descriptive statistics of our dataset from 2022/08/28 to 2022/09/27 with 2,976 samples from 34 road segments and 84 routes. Notably, segment 31 near a hospital has the highest GCT flow with 400.58 entries per 15 minutes, and Route 30 31, linking downtown to the freeway, records the highest mobility flow with 57.82 movements per 15 minutes.

| Type     |   #Samples |   #Amount | Interval   |   Avg. |   STD 1 |   Max Avg. |
|----------|------------|-----------|------------|--------|---------|------------|
| GCT      |       2976 |        34 | 15-min.    |  159.9 |  116.59 |      400.5 |
| Mobility |       2976 |        84 | 15-min.    |   12.9 |   11.03 |       57.8 |

Table 2: Descriptive Statistics of the Dataset.

Magnitude Discrepancy. Table 2 shows that the average GCT flow markedly exceeds that of the mobility flow. This difference is due to the GCT flow including all users-stationary and pedestrians-without considering direction, while mobility flow counts directional movements between segments, typically vehicular. Thus, GCT flow reflects broader user activity, and mobility flow precisely indicates directional vehicular traffic.

Flow Distribution Analysis. Figure 3 shows the distribution of average GCT and mobility flows for road segments and routes. The right skew indicates low traffic in most locations, with few experiencing high volumes. This reflects the typical urban network structure [Peng et al., 2016; Babu and Manoj, 2020] where arterials carry main traffic, while local streets have less flow. The dataset accurately reflects real-world traffic trends, proving valuable for urban.

Figure 3: Histograms showing average GCT and mobility flow distribution in our dataset. The x-axis indicates flow intervals, and the y-axis counts road segments and routes. The right-skewed distribution highlights low traffic on most routes, with a few experiencing high volumes, typical of urban road network hierarchies.

![Image](https://ijcai.org/proceedings/2024/fulltext/812/image_000002_99882e2d4b7e5bfceaf9dba252ed616febf51a3e5921f6cdfea9d17ceece1b19.png)

Relationships Between Mobility and GCT Flows. We analyzed the correlation between mobility flow on route 5 4, connecting residential areas to Hsinchu Science Park, and GCT flow on overlapping segment 5. The weekly trends (Figure 4a) show generally similar patterns, but with some distinct variations during evening commutes. Mobility flow peaks in the morning for work commutes on 54 and declines in the evening as commuters use the opposite route 4 5. In contrast, GCT flow, which represents all user activities on segment 5, peaks during both morning and evening commutes, thus diverging from mobility flow. Figure 4b depicts this varying correlation, although typically positive, with some weakening (as blue ovals) due to lower evening mobility on 54 despite high GCT flows. These findings highlight the interplay between these flows, influenced by time and direction.

Figure 4: Relationships between GCT and mobility flows. (a) Weekly patterns show morning peaks in mobility flow for work commutes, with less evening traffic, unlike GCT flow, which reflects all directional activities. (b) Although correlations are generally positive, reduced evening mobility compared to persistent high GCT flows leads to lower correlations (indicated by blue ovals).

![Image](https://ijcai.org/proceedings/2024/fulltext/812/image_000003_e4370a4f4f312e89236d988d99ae75f720ce3107a875b429e6f6d2141935c935.png)

Interactions Between Route's Neighbors. Acknowledging that the mobility flow of a route is influenced by upstream movements as users transition from upstream to downstream areas, we analyzed its correlation with upstream neighbors. Focusing on route 54 and its upstream routes on 2022/9/05 as an example, we employed Pearson correlation coefficients [Cohen et al., 2009] to assess daily patterns. Figure 5 reveals strong correlations (above 0.8) with direct upstream routes (8 5 and 30 5), signifying their significant impact. Conversely, 2-hop upstream routes exhibit weaker correlations (0.3 to 0.6), suggesting a reduced impact with increased distance. This chart highlights the critical role of the nearest upstream routes in ensuring traffic flow continuity, which informs the geographical insights incorporated in our framework.

Figure 5: Pearson correlation analysis of daily mobility flow for route 5 4 and its upstream routes on 2022/09/05 reveals strong correlations with 1-hop upstream routes and weaker ones with 2-hop upstream routes, indicating a diminishing impact from distant routes. This finding directs our framework's emphasis on 1-hop upstream route correlations for understanding traffic continuity.

![Image](https://ijcai.org/proceedings/2024/fulltext/812/image_000004_eb230aca38ac76954f72b1d7debc5b33ca96b6da79209b5a15ea7c4e03619cfb.png)

## 3 Methodology

## 3.1 Task Definition

Using undirected N GCT flows from past steps (Tin) to forecast directional Mmobility flows for future steps (Tout).

## 3.2 Framework Overview

As Figure 6, our framework functions in two stages to address the magnitude disparity among GCT and mobility flows, and the amount disparity among 32 segments and 84 routes:

- Stage 1. We pre-train the first STGNN on GCT flows for feature extraction, separate from the framework's training. This enables the model to focus on the attributes of GCT flows, thus mitigating the impact of magnitude disparity.
- Stage 2. We transform the features extracted in Stage 1 to align with the amount of mobility flows, addressing the amount disparity. The secondary STGNN is then used to process them and predict the mobility flows.

## 3.3 Stage 1 of the Framework

Motivations. The first STGNN model on GCT flows, separately from the framework, enhances focus on capturing spatial-temporal patterns, thus yielding enriched features. This distinct training approach simplifies the learning process and reduces the risk of overfitting [Lin et al., 2023b].

Notations. The following are the notations for this stage:

- X: GCT flows of size [N,D], regarded as N road segment with D observations.
- Ggct: The graph structure representing connections among road segments collecting GCT flows.
- hi: Multi-channel feature of GCT flow i, sized [C,D], representing D dimensions across C channels.
- H: The set of all hi, denoted H = {hi}, sized [N, C, D].
- STGNN 1st : The pre-trained STGNN in Stage 1, used for feature extraction.

Implementation. The following are the details for this stage: Training. We utilize existing STGNNs (e.g., [Li et al., 2023; Lin et al., 2024]) trained for feature extraction. Following the traffic prediction [Wu et al., 2019], we train the STGNN to predict N GCT flows in the future D′ steps, based on X (sized [N, D]). Details on the data setup are available 2 .

Extracted Feature. STGNN models often encode the input X into multi-channel features H (sized [N,C,D]) to enrich the representation, with each channel encapsulating distinct spatial-temporal dynamics. Once trained, we regard the output of the STGNN as the extracted feature, denoted as:

<!-- formula-not-decoded -->

where STGNN 1st is the pre-trained STGNN in Stage 1, and H = {h1, h2, . . . , hN} ∈ RN×C×D , with each hi representing the multi-channel feature of GCT flow of segment i.

## 3.4 Stage 2 of the Framework

Stage 2 uses the extracted feature H from Stage 1 to generate mobility flow predictions, comprising three steps as follows:

[2 https://github.com/nnzhan/Graph-WaveNet](https://github.com/nnzhan/Graph-WaveNet)

## Transformation Step

Motivations. Due to the misalignment between the amounts of GCT and mobility flows, the extracted feature H cannot be directly mapped to individual mobility flows. Thus, we transform H into representations that align with the amounts of mobility flows, integrating directionality within each route. Notations. The following are the notations for this step:

- hij : The representation for the mobility flow of route ij.
- H: The set of all hij , as H = {hij }, sized [M, C, D]. Implementation. To incorporate directionality, we denote ij as the result of subtracting the extracted feature hi of the starting segment i from hj of the ending segment j, as:

<!-- formula-not-decoded -->

where σ(·) is a nonlinear function. After process for all M routes, we obtain the initial representation set:

<!-- formula-not-decoded -->

## Enhancement Step

Motivations. While the derived hij corresponds to the mobility flow ij, it may not capture correlations with neighboring routes, potentially overlooking factors such as congestion propagation from upstream routes [Saberi et al., 2020; Yidan et al., 2021]. Thus, we enrich these representations by integrating interactions among a route's upstream neighbors. Notations. The following are the notations for this step:

- ki: The 1-hop upstream neighbor of route ij, where segment k leads directly into the start segment i of route ij.
- {hki }: The set of representations for all 1-hop upstream neighbors of route ij.
- Hij : The set of representations comprised of route ij and its upstream neighbors {ki}.
- hcij : c-th channel representation of the mobility flow ij.
- h′ij : The enhanced representation of route ij after fusion.
- H′ : The set of all h′ij , denoted H′ = {h′ij }.

Implementation. The following are the details for this step: Preliminary. While Graph Attention Networks (GAT) [Veliˇckovi´c et al., 2018] are adept at exploring interactions among features and adaptively adjusting weights [Zhao et al., 2020], current GATs fall short in exploring correlations between multi-channel features as they apply uniform weights across all channels. This process may potentially overlook channels that are critical for prediction [Brody et al., 2022]. Solution. We employ the concept of Multi-Channel GAT (MGAT) [Lin et al., 2023a], which is simple but effectively handles multi-channel representations. Below, we briefly outline how we applied MGAT in the fusion process:

1. We concatenate each hij with its upstream neighbors {hki }, as Hij with size [Z, C, D], Z = 1 + |{hki }|.
2. We explore the interactions among entities in Hij . To determine channel-specific weights, MGAT employs C independent GATs, each focusing on the c-th channel representation Hcij ∈ RZ×D .

Figure 6: Overview of the proposed two-stage STGNN framework. Stage 1 employs a pre-trained STGNN (STGNN 1st ) to extract features from GCT flows (as blue shapes). Stage 2 comprises three steps: transformation step derives initial representations (as dotted orange arrows) aligned with the amount of mobility flow while incorporating directionality. The enhancement step integrates each mobility flow representation with its upstream neighbors using the Multi-Channel Graph Attention (MGAT), resulting in enhanced representations (as solid orange arrows). prediction step utilizes a secondary STGNN (STGNN 2nd ) to generate mobility flow predictions.

![Image](https://ijcai.org/proceedings/2024/fulltext/812/image_000005_975dcbfeb4bf047c8bc4a94a1992307d1da57b0f38e79978670bada92de99a6c.png)

3. Specifically, for c-th channel representation Hcij , the attention coefficient in [Veliˇckovi´c et al., 2018], denoted as: e(hc ij , hcki ), is employed to calculate the importance of route ki to route ij. These coefficients are normalized by the Softmax function across all neighbors of node i, denoted as the attention function: αc ij,ki = softmax(e(hc ij , hcki )). MGAT then computes a weighted sum of the features for node i and its neighbors, and concatenates results from C independent attention mechanisms: h′ij = ∥Cc=1 (σ(∑k αc ij,kihcki )).

We denote the above process (steps 1-3) as

<!-- formula-not-decoded -->

where Gij is the graph structure among routes ij and ki.

After processing all M routes with Equation 4 to integrate insights from neighbors, we obtain the enhanced sets:

<!-- formula-not-decoded -->

Following STGNN 2nd , an MLP is employed to transform ˆH into the prediction output format:

<!-- formula-not-decoded -->

Here, the MLP achieves nonlinear transformations to map the high-level features of STGNN 2nd to the desired output.

## Framework Training

We fix the hyperparameters of the pre-trained STGNN 1st in Stage 1 to ensure consistency. The feature extracted in Stage 1 is fed forward through Stage 2 to generate mobility flow predictions. We adopt the Mean Absolute Error (MAE) as our loss function, evaluating the accuracy of predictions against the ground truth in our dataset. The MAE is minimized by tuning the hyperparameters of the transformation, enhancement, and prediction steps to achieve optimal accuracy. Details are provided at: https://github.com/cy07gn/TeltoMob/tree/main/Model

## 4 Experiments

## 4.1 Experimental Setup

Data Setups. We collected data at 15-minute intervals from 2022/8/28 to 2022/9/27, yielding 2,976 samples of GCT and mobility flows across 34 road segments and 84 routes. Sequences for the Train/Test/Valid were formed from these samples, each comprising 12 steps: the initial 8 steps (Tin) as historical GCT flows and the next 4 steps (Tout) as future mobility flows. Following [Li et al., 2018], we divided these sequences into Train/Test/Valid sets in a 70%-20%-10% ratio. Each experiment runs for 180 epochs with early stopping.

Baselines. We chosen representative STGNN baselines integrated into our framework for this new task: DMGCN [Han et al., 2021]: Leverages time-specific spatial dependencies with a multi-faceted fusion. ESG[Ye et al., 2022]: Employs evolutionary and multi-scale graph structures. DGCRN [Li et al., 2023]: Models the dynamic graph with a seq2seq architecture. MFGM[Lin et al., 2024]: Captures multivariate, temporal, and spatial dynamics with a GNN-based approach.

<!-- formula-not-decoded -->

## Prediction Step

Motivations. Given that the enhanced representations H′ align with the amounts of mobility flows, we further apply a secondary STGNN to capture the spatial-temporal dynamics within these representations and generate predictions.

Notations. The following are the notations for this step:

- STGNN 2nd : The STGNN in Stage 2 for generating mobility flow predictions.
- Gmob: The graph structure of connections among routes.
- Y : The output of mobility flow prediction, sized [M, D′ ], representingM mobility flows and D′ future steps.
- MLP : A multilayer perception, is a fully connected neural network.

Implementation. We employ a secondary STGNN (STGNN 2nd ), denoted as:

<!-- formula-not-decoded -->

| STGNNmodels1   | 15 min. - MAE   | 15 min. - RMSE   | 15 min. - MAPE   | 30 min. - MAE   | 30 min. - RMSE   | 30 min. - MAPE   | 60 min. - MAE   | 60 min. - RMSE   | 60 min. - MAPE   | Overall3 - MAE   | Overall3 - RMSE   | Overall3 - MAPE   |
|----------------|-----------------|------------------|------------------|-----------------|------------------|------------------|-----------------|------------------|------------------|------------------|-------------------|-------------------|
| DMGCN(w/o1 )   | 3.99            | 7.21             | 39.9%            | 4.05            | 7.38             | 40.7%            | 4.39            | 8.35             | 42.7%            | 4.14             | 7.65              | 41.1%             |
| DMGCN(w)       | 3.61            | 6.26             | 36.6%            | 3.65            | 6.31             | 37.1%            | 3.80            | 6.89             | 38.9%            | 3.69             | 6.49              | 37.5%             |
| IR2            | 9.5%            | 13.2%            | 8.3%             | 9.9%            | 14.5%            | 8.8%             | 13.4%           | 17.5%            | 8.9%             | 11.0%            | 15.2%             | 8.7%              |
| ESG(w/o)       | 3.87            | 6.63             | 39.7%            | 4.01            | 7.28             | 41.1%            | 4.21            | 7.89             | 43.2%            | 4.03             | 7.27              | 41.3%             |
| ESG(w)         | 3.59            | 6.27             | 37.3%            | 3.65            | 6.33             | 37.7%            | 3.76            | 6.56             | 38.4%            | 3.67             | 6.39              | 37.8%             |
| IR             | 7.2%            | 5.4%             | 6.0%             | 9.0%            | 13.1%            | 8.3%             | 10.7%           | 16.9%            | 11.1%            | 9.0%             | 12.1%             | 8.5%              |
| DGCRN(w/o)     | 3.86            | 7.09             | 39.4%            | 3.92            | 7.22             | 39.9%            | 4.10            | 7.69             | 42.2%            | 3.96             | 7.33              | 40.5%             |
| DGCRN(w)       | 3.58            | 6.25             | 37.4%            | 3.61            | 6.30             | 37.6%            | 3.74            | 6.46             | 38.1%            | 3.64             | 6.34              | 37.7%             |
| IR             | 7.3%            | 11.9%            | 5.1%             | 7.9%            | 12.7%            | 5.8%             | 8.8%            | 16.0%            | 9.7%             | 8.0%             | 13.6%             | 6.9%              |
| MFGM(w/o)      | 3.72            | 6.41             | 38.3%            | 3.84            | 6.66             | 38.9%            | 4.01            | 7.41             | 40.6%            | 3.86             | 6.83              | 39.27%            |
| MFGM(w)        | 3.45            | 5.69             | 34.7%            | 3.54            | 5.89             | 34.9%            | 3.69            | 6.41             | 36.2%            | 3.56             | 6.00              | 35.29%            |
| IR             | 7.3%            | 11.2%            | 9.4%             | 7.8%            | 11.6%            | 10.2%            | 8.0%            | 13.5%            | 10.7%            | 7.68%            | 12.10%            | 10.11%            |
| Average IR     | 7.8%            | 10.4%            | 7.2%             | 8.6%            | 13.0%            | 8.3%             | 10.2%           | 16.0%            | 10.1%            | 8.9%             | 13.2%             | 8.6%              |

Table 3: Performance Comparisons With/Without Framework.

Metrics. We use Mean Absolute Error (MAE), Root Mean Squared Error (RMSE), and Mean Absolute Percentage Error (MAPE) to assess our predictions against ground truth mobility flows from 15 (1 step) to 60 minutes (4 steps).

## 4.2 Prediction Performance

Performance Improvement with Framework. We evaluated the integration of various STGNN models with our framework, focusing on prediction intervals ranging from 15 to 60 minutes. Each model was examined under two settings: without the framework integration (w/o) and with our framework integration (w). For the w/o setting, we used the STGNN, inputting the GCT flow from each route's starting segment, to output the predicted mobility flows.

Table 3 presents the performance of all models in both settings, with each reported result representing the average of 10 individual runs. We use the Improvement Ratio (IR) to measure the enhancement achieved by integrating STGNN models into our framework. The results reveal that this integration boosts performance, with overall average IRs of 8.9%, 13.2%, and 8.6% for MAE, RMSE, and MAPE, respectively, and up to a 17.5% RMSE improvement for long-term predictions. This underlines the compatibility of our framework across different STGNN models and its effectiveness.

Notably, as the prediction interval lengthens, performance typically declines due to the increased complexity of long-term dependencies. However, models enhanced with our framework consistently improve in prediction accuracy, achieving progressively larger IRs as the forecast duration extends. Specifically, the average IR for MAE, RMSE, and MAPE grew from 7.8%, 10.4%, and 7.2% at 15 minutes to 10.2%, 16.0%, and 10.1% at 60 minutes, respectively. These findings underscore our framework's capability for more complex, long-term predictions, which is practical for real-world applications [Tian and Chan, 2021].

Computational Efficiency Table 4 presents the computational efficiency of various STGNN models within our framework on a Nvidia Tesla T4 GPU, with each value representing the average of 10 runs. DMGCN and MFGM show promising inference times (0.73 and 0.79 seconds respectively), suitable for near real-time applications, while ESG and DGCRN are slightly slower. Regarding training times, MFGM is most efficient at 13.53 seconds, suggesting an advantage in environments requiring rapid model updates, whereas DMGCN and ESG were slower, which might impact their adaptability in environments with rapidly changing data. This assessment indicates that our framework is capable of providing efficient inference, supporting its potential for integration within realtime transportation systems, as depicted in Section 4.4.

Table 4: Comparisons for Inference and Training Times.

| STGNNmodels   | Inference Time   | Training Time    |
|---------------|------------------|------------------|
| DMGCN         | 0.73 sec         | 16.58 secs/epoch |
| ESG           | 1.65 secs        | 15.93 secs/epoch |
| DGCRN         | 1.58 secs        | 14.56 secs/epoch |
| MFGM          | 0.79 secs        | 13.53 secs/epoch |

## 4.3 Ablation Study of Our Framework

We assessed the contributions of framework's components by comparing the framework with four ablated settings: without the Pre-trained STGNN (w/o STGNN1st ), without the Transformation step (w/o Trans.), without the Enhancement step (w/o Enhan.), and without Stage 2's STGNN (w/o STGNN2nd ). Table 5 shows the average results for prediction length 15 min to 60 min, ordered by performance impact:

Impact of w/o STGNN1st . This setting omits the pre-trained STGNN1st from Stage 1, using raw GCT flows instead of the extracted features that capture spatio-temporal dynamics. Without these extracted implicit features within the GCT flow, this configuration demonstrates the worst performance metrics across all intervals, indicating a significant decrease in accuracy. This suggests that the pre-trained STGNN to capture the underlying patterns in GCT flows is very crucial. Impact of w/o Enhan. This setting excludes the Enhancement step, thereby omitting the incorporation of correlations between each route and its upstream neighbors. This omission leads to the second-largest performance decrease. We argue that, given the spatial dependencies among routes as shown in our dataset (see Figure 5), overlooking these correlations might miss crucial insights, such as congestion propagation from upstream, thus decreasing the performance.

Table 5: Ablation Study of Our Framework.

| Ablation models   |   15min. - MAE |   15min. - RMSE | 15min. - MAPE   |   30min. - MAE |   30min. - RMSE | 30min. - MAPE   |   60min. - MAE |   60min. - RMSE | 60min. - MAPE   |
|-------------------|----------------|-----------------|-----------------|----------------|-----------------|-----------------|----------------|-----------------|-----------------|
| w/o STGNN1st      |           3.77 |            7.18 | 37.2%           |           3.91 |            7.41 | 38.2%           |           4.42 |            8.61 | 40.1%           |
| w/o Enhan.        |           3.65 |            6.53 | 36.3%           |           3.78 |            6.87 | 36.9%           |           4.13 |            7.69 | 39.4%           |
| w/o STGNN2nd      |           3.58 |            6.27 | 35.9%           |           3.67 |            6.43 | 36.4%           |           3.97 |            7.32 | 37.9%           |
| w/o Trans.        |           3.52 |            6.09 | 35.4%           |           3.62 |            6.16 | 35.6%           |           3.82 |            6.94 | 37.5%           |
| Full Framework    |           3.45 |            5.69 | 34.7%           |           3.54 |            5.89 | 34.9%           |           3.69 |            6.41 | 36.2%           |

Impact of w/o STGNN2nd . This setting omits STGNN2nd in the Prediction step, opting for MLPs to generate the predictions. Although this removal is not as severe as omitting the STGNN1st , it still consistently increases prediction errors across all intervals. This validates that capturing implicit dynamics with STGNN2nd contributes to the outcomes.

Impact of w/o Trans. This setting omits the Transformation step, directly using the extracted GCT flow feature as a representation of mobility flow, without integrating the directionality among routes. Although excluding the transformation step leads to slightly worse metrics, it still leads to increased errors across the 15 to 60 minutes, confirming that incorporating directionality can enhance mobility flow prediction.

Figure 7 presents the predictive performance as measured by MAE across time intervals. As the interval lengthens, the error for all settings increases. However, it is observed that the full framework consistently outperforms the other ablated settings at all prediction lengths, with the MAE gap widening over time. This not only demonstrates the superior performance of the full framework but also highlights its stability for complex, long-term tasks.

Figure 7: Ablation study of MAE across 15 to 60-minute intervals. As prediction lengths extend, performance declines for all settings, while the full framework (red line) not only consistently outperforms ablated versions but with a growing MAE gap against them, proving the essentiality of all components.

![Image](https://ijcai.org/proceedings/2024/fulltext/812/image_000006_ad0df7b37d92cbca88a9df535dc6e8064aa3b834deede8db11c338222f2a000a.png)

## 4.4 Applications and Impact on Transportation

As our framework achieves promising inference times from GCT flow to mobility flow predictions (as Table 4), we are collaborating with city authorities to integrate this framework into the transportation system, as illustrated in Figure 8:

- Traffic Monitoring: Predicted mobility flows offer insights for authorities to monitor potential congestion.
- Traffic Indicator: The system employs these forecasts in a threshold-based alert mechanism, serving as a new indicator of traffic conditions. When pre-set thresholds are exceeded, it triggers various strategies: sending notifications to authorities, suggesting alternative routes through Changeable Message Signs (CMS) to redirect commuters, and dynamically adjusting traffic signal plans to optimize flow.

Figure 8: Integrating our framework with the city's transportation system, by utilizing GCT flow for predictive mobility insights, activates a threshold-based alert system for optimal traffic management. This achieves practical convergence of telecom data and transportation needs through driver notifications, CMS for alternative routing, and optimized traffic signal control.

![Image](https://ijcai.org/proceedings/2024/fulltext/812/image_000007_1faf5c35d4780db04c465623031fb4f1bb0fc75ec54f3d6eec225c52e3fc4520.png)

Beyond the above, our work can contribute further impact:

- Reconstruction of Road Networks: Our framework's predictions provide city authorities with better insights into congestion points, leading to the expansion or reconstruction of road networks to better accommodate traffic demands.
- Public Transport Improvement: By understanding mobility flows, public transport routes can be optimized to match demand, potentially increasing the use of multi-passenger transport options.

## 5 Conclusion

We leverage undirected telecom data to forecast directional mobility flows along routes, enhancing the utility of telecom data in transportation and reducing the deployment and maintenance costs of detectors, thus advancing sustainable cities (SDG 11). To tackle the challenge, we propose a two-stage STGNN framework, facilitated by our TeltoMob dataset, to assess its effectiveness. Our experiments confirm the framework's compatibility with various STGNN models and its effectiveness in enhancing their performance, with up to a 17.5% improvement in long-term prediction. We also demonstrate the integration of the framework into the transportation system as a traffic indicator. This work underscores the potential of telecom data in transportation and contributes to the enhancement of sustainable urban mobility.

## Acknowledgments

This work was supported in part by National Science and Technology Council, Taiwan, under Grant NSTC 111-2634F-002-022 and by Qualcomm through a Taiwan University Research Collaboration Project.

## References

1. [Babu and Manoj, 2020] Sarath Babu and BS Manoj. To- ward a type-based analysis of road networks. ACM Trans- actions on Spatial Algorithms and Systems (TSAS), 6(4):1- 45, 2020.
2. [Brody et al., 2022] Shaked Brody, Uri Alon, and Eran Ya- hav. How attentive are graph attention networks? In Proc. of ICLR, 2022.
3. U Cisco. Cisco annual internet report (2018- 2023) white paper. 2020. Acessado em, 10(01), 2021.
4. [Cohen et al., 2009] Israel Cohen, Yiteng Huang, Jingdong Chen, Jacob Benesty, Jacob Benesty, Jingdong Chen, Yiteng Huang, and Israel Cohen. Pearson correlation co- efficient. Noise reduction in speech processing, 2009.
5. [Guo et al., 2019] Shengnan Guo, Youfang Lin, Ning Feng, Chao Song, and Huaiyu Wan. Attention based spatial- temporal graph convolutional networks for traffic flow forecasting. In Proc. of AAAI, 2019.
6. [Han et al., 2021] Liangzhe Han, Bowen Du, Leilei Sun, Yanjie Fu, Yisheng Lv, and Hui Xiong. Dynamic and multi-faceted spatio-temporal deep learning for traffic speed forecasting. In Proc. of KDD, 2021.
7. [He et al., 2020] Qing He, György Dán, and Georgios P Koudouridis. Semi-persistent scheduling for 5g down- link based on short-term traffic prediction. In GLOBE- COM 2020-2020 IEEE Global Communications Confer- ence, pages 1-6. IEEE, 2020.
8. [Jiang, 2022] Weiwei Jiang. Cellular traffic prediction with machine learning: A survey. Expert Systems with Applica- tions, page 117163, 2022.
9. [Li et al., 2018] Yaguang Li, Rose Yu, Cyrus Shahabi, and Yan Liu. Diffusion convolutional recurrent neural net- work: Data-driven traffic forecasting. In Proc. of ICLR, 2018.
10. [Li et al., 2023] Fuxian Li, Jie Feng, Huan Yan, Guangyin Jin, Fan Yang, Funing Sun, Depeng Jin, and Yong Li. Dynamic graph convolutional recurrent network for traffic prediction: Benchmark and solution. ACM Transactions on Knowledge Discovery from Data, 17(1):1-21, 2023.
11. [Lin et al., 2021a] Chung-Yi Lin, Hung-Ting Su, Shen-Lung Tung, and Winston H. Hsu. Multivariate and propaga- tion graph attention network for spatial-temporal predic- tion with outdoor cellular traffic. In Proc. of CIKM, 2021.
12. [Lin et al., 2021b] Jiansheng Lin, Youjia Chen, Haifeng Zheng, Ming Ding, Peng Cheng, and Lajos Hanzo. A data-driven base station sleeping strategy based on traf- fic prediction. IEEE Transactions on Network Science and Engineering, 2021.
13. [Lin et al., 2023a] ChungYi Lin, Shen-Lung Tung, and Win- ston H Hsu. Pay attention to multi-channel for improving graph neural networks. In Proc. of ICLR, 2023. Accepted paper, to appear.
14. [Lin et al., 2023b] ChungYi Lin, Shen-Lung Tung, Hung- Ting Su, and Winston H Hsu. Ctcam: Enhancing trans- portation evaluation through fusion of cellular traffic and camera-based vehicle flows. In Proc. of CIKM, 2023.
15. [Lin et al., 2024] ChungYi Lin, Shen-Lung Tung, Hung- Ting Su, and Winston H Hsu. Teltrans: Applying multi- type telecom data to transportation evaluation and pre- diction via multifaceted graph modeling. arXiv preprint arXiv:2401.03138, 2024. Accepted by AAAI 2024. To appear.
16. [Lv et al., 2021] Zhihan Lv, Yuxi Li, Hailin Feng, and Haibin Lv. Deep learning for security in digital twins of cooperative intelligent transportation systems. IEEE Transactions on Intelligent Transportation Systems, 2021.
17. [Peng et al., 2016] Chi-Han Peng, Yong-Liang Yang, Fan Bao, Daniel Fink, Dong-Ming Yan, Peter Wonka, and Niloy J Mitra. Computational network design from func- tional specifications. ACM Transactions on Graphics (TOG), 35(4):1-12, 2016.
18. [Saberi et al., 2020] Meead Saberi, Homayoun Hamed- moghadam, Mudabber Ashfaq, Seyed Amir Hosseini, Ziyuan Gu, Sajjad Shafiei, Divya J Nair, Vinayak Dixit, Lauren Gardner, S Travis Waller, et al. A simple conta- gion process describes spreading of traffic jams in urban networks. Nature communications, 2020.
19. [Sen et al., 2012] Rijurekha Sen, Abhinav Maurya, Bhaskaran Raman, Rupesh Mehta, Ramakrishnan Kalyanaraman, Nagamanoj Vankadhara, Swaroop Roy, and Prashima Sharma. Kyun queue: a sensor network system to monitor road traffic queues. In Proc. of SENSYS, pages 127-140, 2012.
20. [Tian and Chan, 2021] Chenyu Tian and Wai Kin Chan. Spatial-temporal attention wavenet: A deep learning framework for traffic prediction considering spatial- temporal dependencies. IET Intelligent Transport Systems, 2021.
21. [Veličković et al., 2018] Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. Graph attention networks. In Proc. of ICLR, 2018.
22. [Wang et al., 2018] Xu Wang, Zimu Zhou, Fu Xiao, Kai Xing, Zheng Yang, Yunhao Liu, and Chunyi Peng. Spatio- temporal analysis and prediction of cellular traffic in metropolis. IEEE Transactions on Mobile Computing, 2018.
23. [Wang et al., 2022] Zi Wang, Jia Hu, Geyong Min, Zhiwei Zhao, Zheng Chang, and Zhe Wang. Spatial-temporal cel- lular traffic prediction for 5 g and beyond: A graph neural networks-based approach. IEEE Transactions on Indus- trial Informatics, 2022.
24. [Wu et al., 2019] Zonghan Wu, Shirui Pan, Guodong Long, Jing Jiang, and Chengqi Zhang. Graph wavenet for deep spatial-temporal graph modeling. In Proc. of IJCAI, 2019.
25. [Xie et al., 2020] Peng Xie, Tianrui Li, Jia Liu, Shengdong Du, Xin Yang, and Junbo Zhang. Urban flow prediction from spatiotemporal data using machine learning: A sur- vey. Information Fusion, 2020.
26. [Yao et al., 2021] Yang Yao, Bo Gu, Zhou Su, and Mohsen Guizani. Mvstgn: A multi-view spatial-temporal graph network for cellular traffic prediction. IEEE Transactions on Mobile Computing, 2021.
27. [Ye et al., 2022] Junchen Ye, Zihan Liu, Bowen Du, Leilei Sun, Weimiao Li, Yanjie Fu, and Hui Xiong. Learning the evolutionary and multi-scale graph structure for mul- tivariate time series forecasting. In Proc. of KDD, pages 2296-2306, 2022.
28. [Yidan et al., 2021] Sun Yidan, He Peilan, Jiang Guiyuan, and Siew-Kei Lam. Learning congestion propagation behaviors for traffic prediction. In 2021 IEEE Inter- national Intelligent Transportation Systems Conference (ITSC), pages 2175-2180. IEEE, 2021.
29. [Zhang et al., 2018] Chuanting Zhang, Haixia Zhang, Dongfeng Yuan, and Minggao Zhang. Citywide cellular traffic prediction based on densely connected convolu- tional neural networks. IEEE Communications Letters, 2018.
30. [Zhao et al., 2020] Hang Zhao, Yujing Wang, Juanyong Duan, Congrui Huang, Defu Cao, Yunhai Tong, Bixiong Xu, Jing Bai, Jie Tong, and Qi Zhang. Multivariate time- series anomaly detection via graph attention network. In Proc. of ICDM, pages 841-850, 2020.
31. [Zhao et al., 2021] Nan Zhao, Aonan Wu, Yiyang Pei, Ying- Chang Liang, and Dusit Niyato. Spatial-temporal aggrega- tion graph convolution network for efficient mobile cellu- lar traffic prediction. IEEE Communications Letters, 2021.
