This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

TelTrans: Applying Multi-Type Telecom Data to Transportation Evaluation and Prediction via Multifaceted Graph Modeling

ChungYi Lin1,2, Shen-Lung Tung1, Hung-Ting Su2, Winston H. Hsu2,3
Abstract

To address the limitations of traffic prediction from location-bound detectors, we present Geographical Cellular Traffic (GCT) flow, a novel data source that leverages the extensive coverage of cellular traffic to capture mobility patterns. Our extensive analysis validates its potential for transportation. Focusing on vehicle-related GCT flow prediction, we propose a graph neural network that integrates multivariate, temporal, and spatial facets for improved accuracy. Experiments reveal our model’s superiority over baselines, especially in long-term predictions. We also highlight the potential for GCT flow integration into transportation systems.

Introduction

Accurate traffic prediction can alleviate congestion (Lv et al. 2021) and enhance traffic signal optimization (Xie et al. 2020) for intelligent transportation systems. However, traditional traffic prediction approaches that rely on dedicated sensors require costly devices and maintenance, limiting application coverage and leading to insufficient information.

Leveraging the extensive mobile network coverage in Taiwan, we analyzed cellular traffic generated by users’ mobile devices (Jiang 2022; Zhao et al. 2021). This geographically-inherent cellular traffic offers a unique insight into transportation dynamics. In partnership with Taiwan’s leading telecom company, we present the Geographical Cellular Traffic (GCT). Additionally, we define the GCT flow as the accumulation of GCTs over specific time intervals. To apply GCT flow to transportation, we focus on specific GCT flows collected from various road segments, predicting their trends over time in the relevant areas, as shown in Figure 1.

While GCT flow encompasses various user types like vehicles, pedestrians, and stationary users, our primary objective is to evaluate traffic conditions, necessitating a focus on vehicle-related GCT flow. Accordingly, we categorize this flow into three distinct types: Vehicle (V-GCT), Pedestrian (P-GCT), and Stationary (S-GCT) flows based on telecom company classifications. Each type displays distinct traffic patterns; for instance, commuting routes see V-GCT flow spikes during weekday rush hours, whereas shopping districts might have high P-GCT and S-GCT flows peaks during weekends. As incorporating regional functionalities can improve prediction accuracy (Shao et al. 2022), by exploring the interplays among multi-type GCT flows to uncover implicit functionalities, we can refine our predictive V-GCT.

Refer to caption
Figure 1: An overview of GCT flow. Cellular traffic, generated by mobile users on various road segments, corresponds to entries in the GCT database. The accumulated count of GCT over a given time interval is defined as GCT flow. Over time, the flow series reflects road traffic patterns.

Predicting V-GCT flow presents challenges. Firstly, exploring interactions among multi-type GCT flows adds complexity. Secondly, GCT flow fluctuates more than traffic data, suggesting intricate temporal patterns. Lastly, as mobile users move across roads, they induce spatial correlations among adjacent roads. Addressing the challenges, we propose a novel model with three facets: Multivariate, discerning the interplay among multi-type GCT flows to uncover hidden regional functionality; Temporal, separating short-term and long-term dynamics to avoid entangled dependencies (Ye et al. 2022); and Spatial, capturing bidirectional user mobility to understand the spatial dependencies. Experiments confirm the model’s efficacy and the importance of integrating multi-type GCT flows. Our key contributions:

\bullet Novelty: We present multi-type GCT flow as a novel method for transportation evaluation, developing a multifaceted graph model for accurate predictions.

\bullet Reproducibility: All datasets and codes are available at: https://github.com/cylin-cmlab/GCT-Prediction.

\bullet Predicted Impact: Our research leads in applying telecom data to traffic management, with V-GCT flow prediction showing great potential for real-world applications.

Multi-type GCT Flows Dataset

Definitions

Geographical Cellular Traffic (GCT): Cellular traffic with origin coordinates determined by triangulation (Jiang et al. 2013) from the telecom company. Each GCT entry is classified as vehicle, pedestrian, or stationary.

Road Segment: A 20m x 20m geographical unit for GCT collection, reflecting the typical road widths in Hsinchu, Taiwan, including car lanes, motorcycle lanes, and shoulders.

Multi-Type GCT Flows: Quantities of GCT types recorded at fixed intervals (e.g., 5 min) including vehicle (V-GCT), pedestrian (P-GCT), and stationary (S-GCT) flows.

Data Collection and Preprocessing

Data sourcing. We extracted full-day GCT data originating within the boundaries of selected road segments, sourced from a major telecom company’s database. This database logs over a billion records daily from more than 11 million mobile users, representing approximately 50% of Taiwan’s population. For security purposes, we retained only the crucial data fields without other connection information, as outlined in Table 1, including the International Mobile Station Equipment Identity (IMEI, a unique identifier for mobile phones), latitude and longitude coordinates, recording time, and the categorized type for each entry.

IMEI1 Latitude Longitude Time Type2
gnH…mE 24.78585 120.98825 09/25 17:59:58 vehicle
gnB…GI 24.78601 120.98838 09/25 18:00:00 pedestrian
gnK…mU 24.78608 120.98829 09/25 18:00:05 stationary

1IMEI numbers were hashed to protect privacy before processing.
2Categorized by the algorithm of the telecom company.

Table 1: Examples of GCT with essential data fields.

Road Segments Selection. In collaboration with the Hsinchu transportation authority, we selected 21 road segments for our Proof-of-Concept (POC) study, depicted in Figure 2. The segments were chosen based on insights from local authorities to ensure that the selection captures representative GCT flow patterns or is susceptible to congestion.

Data Cleaning and Processing. Duplicate GCT entries with identical timestamps and IMEI numbers were removed to ensure an accurate representation of the GCT flow. Potential issues in cellular network data, such as the ’Ping-Pong’ and oscillation effects (Zidic et al. 2023) (resulting from rapid handovers between cellular base stations) were resolved by the telecom company, enhancing GCT reliability.

Data Privacy Protection. To safeguard user privacy: (1) IMEI numbers in GCT data were hashed, and personal identifiers like user names or addresses were removed, ensuring individuals cannot be distinguished. (2) Data collection was restricted to roads, avoiding business or residential areas to prevent user tracking. (3) The collaborating telecom company adheres to the ISO27001 standard, meaning any data access undergoes a strict approval process, thus preventing unauthorized access.

Refer to caption
Figure 2: Selected road segments in Hsinchu, situated near functional regions or congested routes (e.g., the commuting route from segments 62 to 56), capture representative GCT flow patterns. Segment color indicates the average V-GCT flow from August 28 to September 28, 2022.
Types Num. Avg. STD Max Avg. Min Avg.
V-GCT 21 27.42 21.17 78.51(ID:30) 6.49(ID:63)
P-GCT 21 6.86 6.38 18.03(ID:30) 1.25(ID:57)
S-GCT 21 9.14 7.72 23.46(ID:30) 1.24(ID:57)
Table 2: Descriptive statistics of multi-type GCT flows.

Data Analysis of GCT flow

Descriptive Statistics. Multi-type GCT flow statistics are summarized in Table 2. Road segment 30, situated near the hospital and on main arterial routes, exhibited the highest average for V-(78.51), P-(18.03), and S-(23.46) GCT flows. In contrast, road segment 63, located in a residential zone and only active during rush hours, recorded the lowest average V-GCT at 6.49. Road segment 57, which is part of a commuting route, had the minimum P-(1.25) and S-(1.24) GCT flows. These statistics reveal the variability of multi-type GCT flows across different road segments, reflecting their unique regional functions.

Spatial Coverage. Our road segment selections in Hsinchu cover pivotal areas including colleges, hospitals, shopping areas, science parks, residential zones, and train stations, capturing representative GCT flows and diverse patterns. Figure 2 shows segments with higher average V-GCT flows, primarily on major arterial routes (e.g., segments 62 to 56 and 30 to 30), reflecting typical urban traffic dynamics with main routes and hubs carrying substantial traffic (Peng et al. 2016; Babu and Manoj 2020). The cellular network’s wide coverage offers scalability for future road segment selection.

Temporal Coverage. Table 2 shows that each GCT flow type consists of 8928 samples, gathered by accumulating the respective GCT entries in 5-minute intervals. This results in uniform sample sizes across all GCT flows, providing a consistent depiction of traffic conditions. All type of GCT flows span from August 28 to September 28, 2022, and covers the entire day from 00:00 to 24:00.

Time-Evolving Spatial Correlations. Inspired by (Zhang et al. 2018; Wang et al. 2021), we explored the correlation between neighboring segments using the Pearson correlation coefficient (Cohen et al. 2009) and tracked how these correlations evolved over time. We used the previous 1-hour V-GCT flow of each time slot, to calculate Pearson coefficients among segments, as shown in Figure 3. Neighboring segments typically showed high correlation coefficients due to similar patterns, especially near specific points of interest.

Figure 3(a) to (c) show evolving spatial correlations, with related segment ranges highlighted in blue boxes. At 18:00, segments near the Science Park (Box 1) had high Pearson coefficients, due to shared commuting patterns as employees left work. By 19:00, segments on commuting routes (Box 2) showed strong correlations, indicating collective movement from workplaces to residential zones. At 20:00, correlations increased near residential zones (Box 3) and the Science Park (Box 4), suggesting people returning home or dining nearby and late-working employees leaving work again, respectively. Overall, this analysis highlights the evolving traffic patterns throughout the periods and the significance of spatial correlation in V-GCT flow.

Refer to caption
Figure 3: Pearson Correlation Coefficients were calculated between pairs of road segments based on 1-hour V-GCT flow at 2022/9/25. As mobility patterns change over time, areas with high coefficients (i.e., blue boxes) shift among different segments, unveiling the evolving spatial correlations.

Interactions among GCT Flow’s Types

With analyses of the GCT flows from different perspectives, we aim to discern hidden interactions between user groups.

Exhibiting Regional Pattern. Figures 4(a) show that the commuting route has a dominant V-GCT flow relative to P-GCT and S-GCT flows. In contrast, commercial areas display significant P-GCT and S-GCT flows in Figure 4(b).

Introducing Subtracted Types. Direct exploring correlations among multivariate data might overlook latent associations (Zhao et al. 2020; Deng and Hooi 2021). To uncover implicit relationships of user group densities, we introduced subtracted flow types. By subtracting P-GCT and S-GCT from V-GCT, we obtained (V-P) and (V-S) flows, which highlight user group density differences and offer a new perspective of traffic patterns. As shown in Figure 4, in the commuting route (ID:62) of Hsinchu Science Park, where V-GCT flow dominates P-GCT and S-GCT flows, pronounced (V-P) and (V-S) disparities arise.

Using the Pearson correlation coefficient, we analyzed the relationships between V-GCT and P- or S-GCT flows, as well as between V-GCT and its subtracted types (V-P or V-S), as shown in Figure 4. Notably, the difference in Pearson’s correlation coefficient between V-GCT and its subtracted flows in different regions (such as commuter routes or residential areas) is more than nine times larger than that observed when directly exploring the differences in correlations between the above multi-type GCT flows. This suggests that examining the association between V-GCT and its subtracted flow reveals the underlying regional attributes.

Refer to caption
(a) Commuting route.
Refer to caption
(b) Residential zone.
Figure 4: Despite distinct GCT flow patterns in commuting routes and residential zones, Pearson correlation coefficients with 1-day data between V-GCT (V) and P-GCT (P) or S-GCT (S) are similar across both segments: 0.78 (P) and 0.75 (S) vs. 0.77 (P) and 0.74 (S). However, subtracted flows (V-P and V-S) yield more noticeable differences: 0.98(V-P) and 0.99(V-S) versus 0.89(V-P) and 0.86(V-S). This suggests that using subtracted flows can reveal more nuanced insights than directly exploring correlations among GCT flows.

Path Forward for Real-World Deployment

Based on the promising potential for applying GCT flow to transportation, we’re preparing to integrate its predictive capabilities into the Hsinchu Transportation system. We work with city authorities with two focuses: real-time crowd density monitoring and a threshold-based traffic optimization system, detailed in Figure 5. The former will gauge congestion at events such as parades, assisting with resource allocation. The latter, activated when flow surpasses pre-set limits, will trigger measures such as mobile alerts, alternate route suggestions via Changeable Message Signs (CMS), and traffic signal adjustments. These strategies aim to improve traffic insights and efficiently manage congestion.

Refer to caption
Figure 5: System integration of GCT flow enables real-time crowd monitoring and threshold alerts. Exceeding city-defined limits triggers traffic optimization strategies.

MultiFaceted Graph Modeling (MFGM)

V-GCT Flow Prediction Task Definition

Our objective is to use the historical TinT_{in} steps of multi-type GCT flow from NN road segments, represented by the 𝒳={Xf1,,XfTin}\mathcal{X}=\{X_{f^{{}^{\prime}}}^{1},...,X_{f^{{}^{\prime}}}^{T_{in}}\}, to forecast V-GCT: {YTin+1,,YTin+Tout}\{{Y}^{T_{in}+1},...,{Y}^{T_{in}+T_{out}}\}, for NN segments in the upcoming ToutT_{out} steps. Here, ff^{{}^{\prime}} stands for V-GCT, S-GCT, or P-GCT.

Overview of the Proposed Model

Figure 6 shows the proposed model consists of three facets:

Multivariate Facet. Capturing interactions among multi-type GCT flows reveals implicit regional functionality.

Temporal Facet. Extracts short-term and long-term patterns to discern sudden and regular patterns separately.

Spatial Facet. Captures bidirectional spatial dependencies among road segments due to user mobility.

Refer to caption
Figure 6: Our proposed model consists of three views: Multivariate, Temporal, and Spatial, each exploring correlations from different facets of GCT flow. Each of these modules is based on the Channel-specific Graph Attention Layer (CGATL) to enhance the capability of GAT. The Output Module, connected through skip connections, generates multi-step predictions.

Channel-Specific Graph Attention (CGAT). The above facet modeling utilizes a new Graph Attention-based module as its core module, termed Channel-specific Graph Attention (CGAT). CGAT offers flexibility for varying input shapes across facets while retaining efficiency.

Channel-Specific Graph Attention Layer (CGATL)

Preliminaries. For spatio-temporal input of NN nodes (e.g., road segments) with DD observations (e.g., temporal sequences), current spatio-temporal (ST) models (Wu et al. 2019, 2020; Han et al. 2021; Ye et al. 2022) employ a CNN layer with CC 1D kernels for feature extraction, producing a multi-channel representation: H={h1,h2,,hN}C×N×DH=\{h_{1},h_{2},\dots,h_{N}\}\in\mathbb{R}^{C\times N\times D}. Each channel, or feature map, captures specific spatio-temporal patterns (e.g., sudden events or periodic rush hours). However, existing Graph Attention Networks (GAT) (Veličković et al. 2018; Brody, Alon, and Yahav 2022) uniformly weight these channels (Zhang et al. 2020), risking omission of critical patterns. Thus, we propose an enhanced GAT for handling such representation effectively.

CGAT Mechanism. For channel representation (size [C×N×DC\times N\times D]), we employ CC independent GATs, to examine distinct correlations among NN nodes of each. Considering the cc-th channel, Hc={h1c,h2c,,hNc}N×DH^{c}=\{h^{c}_{1},h^{c}_{2},\dots,h^{c}_{N}\}\in\mathbb{R}^{N\times D}, the attention coefficient in GAT, e(hic,hjc),e(h^{c}_{i},h^{c}_{j}), assesses the dynamic importance of node jj to node ii. Notably, we omit the weight matrix in GAT (Veličković et al. 2018; Brody, Alon, and Yahav 2022) to avoid impacting CNN kernel weights.

Subsequently, we normalize these coefficients across all neighbors of node ii. This results in the attention score, denoted as: αijc=softmax(e(hic,hjc))\alpha^{c}_{ij}=softmax(e(h^{c}_{i},h^{c}_{j})). We then compute a weighted sum of the features for node ii and its neighbors. The outputs from CC independent attention mechanisms are then concatenated as follows:

h^i=c=1C(σ(jNiαijchjc)),\hat{h}_{i}=\|_{c=1}^{C}(\sigma(\sum_{j\in N_{i}}\alpha^{c}_{ij}{h}^{c}_{j})), (1)

where i{1,2,,Z}i\in\{1,2,\dots,Z\}, NiN_{i} is the neighbors of node ii, and σ()\sigma(\cdot) is a nonlinear function. We denote the function representing the concatenated h^i\hat{h}_{i} as:

CGAT(H,𝒢){h^1,h^2,,h^N},CGAT(H,\mathcal{G})\coloneqq\{\hat{h}_{1},\hat{h}_{2},...,\hat{h}_{N}\}, (2)

where HH with dimension [C×N×DC\times N\times D] and 𝒢\mathcal{G} is a graph structure indicating the connections among nodes in HH.

CGAT Layer (CGATL) for Efficiency Management. For computational efficiency when using CGATL on high channel-count representations, like the 32 channels in (Wu et al. 2020), we adopt 1×\times1 convolution layers for Encoder and Decoder, inspired by the sandwich structure (Yu, Yin, and Zhu 2018). The Encoder reduces the channel count from CC to CC^{{}^{\prime}} (CC^{{}^{\prime}} << CC), processes through CGAT, and then the Decoder restores the count to CC. Residual connections between the Encoder and Decoder ensure training stability. The CGATL Layer (CGATL) is given by:

CGATL(H,𝒢)\displaystyle CGATL(H,\mathcal{G}) \displaystyle\coloneqq
Decoder(\displaystyle Decoder( CGAT(Encoder(H),𝒢))+H.\displaystyle CGAT(Encoder(H),\mathcal{G}))+H. (3)

We then present how the CGATL is applied to various facets.

Multivariate Facet Modeling

Insights. Modeling directly on relationships in multivariate data may not adequately highlight correlations, as depicted in Figure 4. By modeling with subtracted type flows, we emphasize differences between V-GCT and P-GCT, revealing regional attributes. This method enhances prediction accuracy, as confirmed by our experiments.

Notations:

\bullet HvgctH_{vgct} and HfH_{f}: The multi-channel representations of V-GCT flow and either P-GCT or S-GCT flow, respectively. ff can either be P-GCT or S-GCT flow.

\bullet Δf\Delta_{f}: Represents the subtraction-type flow, which is computed as Δf=HvgctHf\Delta_{f}=H_{vgct}-H_{f}.

\bullet 𝒢M\mathcal{G}_{M}: Represents a complete graph that reveals the connections among various GCT flow types.

Implementation. For each time step tt, we concatenate HvgcttC×N×1H_{vgct}^{t}\in\mathbb{R}^{C\times N\times 1} with ΔpgcttC×N×1\Delta_{pgct}^{t}\in\mathbb{R}^{C\times N\times 1} and ΔsgcttC×N×1\Delta_{sgct}^{t}\in\mathbb{R}^{C\times N\times 1} along the third dimension. This produces a representation of size [C×N×3C\times N\times 3], which we then reshape into [C×3×NC\times 3\times N], denoted as HΔtH_{\Delta}^{t}, to align with the CGATL procedure. After CGATL, we extract only the ’enhanced’ HvgcttH_{vgct}^{t}:

H^vgctt=Extract(CGATL(HΔt,𝒢M)),\hat{H}_{vgct}^{t}=Extract(CGATL(H_{\Delta}^{t},\mathcal{G}_{M})), (4)

where ’Extract’ function retrieves the enhanced representation of HvgcttH_{vgct}^{t}, the first element of HΔtH_{\Delta}^{t} from CGATL’s output.

Then, we concatenate the output of all time step in Equation 4 along the second dimension of [C×T×NC\times T\times N] as follows:

H^M=t=1T(H^vgctt).\hat{H}_{M}=\|_{t=1}^{T}(\hat{H}_{vgct}^{t}). (5)

H^MC×T×N\hat{H}_{M}\in\mathbb{R}^{C\times T\times N} is output of Multivariate facet Modeling. We integrate the correlations among multi-type GCT flows over time steps while preserving their chronological order.

Temporal Facet Modeling

Insights. Complex time series can easily entangle temporal dependencies, making it challenging to identify valuable signals (Xu et al. 2017; Ye et al. 2022). Given the heightened fluctuations in V-GCT flow compared to traditional traffic data like speed, capturing both short-term and long-term patterns is vital. Thus, our model emphasizes understanding these temporal dynamics.

Notations:

\bullet HH: Multi-channel representation reshaped to [C×T×SC\times T\times S], regarded as TT time nodes with SS road segment states.

\bullet 𝒢T\mathcal{G}_{T}: The complete graph composed of the TT nodes.

Implementation. Following (Wu et al. 2020; Ye et al. 2022), we use two CNNs with kernel sizes (2×12\times 1) and (5×15\times 1) to extract short- and long-term temporal patterns from multi-channel representation HH, as H2H_{2} and H5H_{5}, respectively. H2H_{2} captures local dependencies, while H5H_{5} reflects longer trends.

After extracting these different scale representations H2H_{2} and H5H_{5}, we apply CGATL to process them and concatenate:

H^T=Concat([CGATL(H2,𝒢T),CGATL(H5,𝒢T)]),\hat{H}_{T}=Concat([CGATL(H_{2},\mathcal{G}_{T}),CGATL(H_{5},\mathcal{G}_{T})]), (6)

where ’Concat’ fuction merges two outputs along the second dimension of [C×T×NC\times T\times N]. Following (Wu et al. 2020), we truncate longer temporal outputs to match shorter ones. Specifically, we reshape H2H_{2} from [C×(T1)×SC\times(T-1)\times S] to [C×(T4)×SC\times(T-4)\times S] by removing its first three elements, aligning it with H5H_{5}.

To manage the ratio of information passed to the next module, we implement the Gating Mechanism (Wu et al. 2019; Ye et al. 2022) by employing dual CGATL to fuse two outputs as follows:

H^gate=σ(H^T1)μ(H^T2),\hat{H}_{gate}=\sigma(\hat{H}^{1}_{T})\odot\mu(\hat{H}^{2}_{T}), (7)

where H^T1\hat{H}^{1}_{T} and H^T2\hat{H}^{2}_{T} are generated from Equation 6 in dual CGATL, respectively. μ\mu denotes the tangent hyperbolic function, and \odot represents the Hadamard product. H^gate\hat{H}_{gate} is the fusion output from the Temporal Facet Modeling, which is then fed forward to the next spatial modeling.

Spatial Facet Modeling

Insights for Modeling. Our analysis in Figure 3 reveals spatial correlations between road segments, where the GCT flow of an upstream segment influences the downstream GCT flow. Additionally, users’ mobility may cause them to move back and forth due to their activity behaviors, such as daily commuting patterns to and from work or adjusting their routes when faced with unexpected traffic situations. Hence, considering not only the spatial correlation but also accounting for bidirectional variations among road segments can lead to a comprehensive understanding of user mobility.

Notations:

\bullet HH: Multi-channel representation reshaped to [C×S×TC\times S\times T], regarded as SS road segment with TT observations.

\bullet AA: The adjacency matrix formed by the SS segments.

\bullet 𝒢F\mathcal{G}_{F} and 𝒢B\mathcal{G}_{B}: Forward and backward graph structure, respectively, created by processing AA with the thresholded Gaussian kernel (Shuman et al. 2013). They are computed as A/rowsum(A)A/rowsum(A) and AT/rowsum(AT)A^{T}/rowsum(A^{T}), respectively, for direction-specific spatial modeling.

Implementation. To accommodate bidirectional user mobility across road segments among V-GCT flows, we utilize two distinct CGATLs, each used to explore propagation in one direction. We assign specific directional graphs, 𝒢F\mathcal{G}{F} and 𝒢B\mathcal{G}{B}, to each CGATL. By feeding the two transition matrices into their corresponding CGATs, we combine them as:

H^S=CGATL(H,𝒢F)+CGATL(H,𝒢B)\hat{H}_{S}=CGATL(H,\mathcal{G}_{F})+CGATL(H,\mathcal{G}_{B}) (8)

where H^S\hat{H}_{S} is the fusion output from the Spatial Facet Modeling, which is then fed forward to the next layer.

Overall Structure

Our model begins with a 32-channel CNN layer to encode all GCT flow types. It comprises three layers, each integrating Spatial and Temporal Facet Modeling. Post every Temporal Facet Modeling, we use 64-channel CNN layer as skip connections that lead into the Output Layer. This layer processes the merged representations to derive multi-step outputs.

15 min. 30 min. 45 min. 60 min.
Baselines MAE RMSE MAPE MAE RMSE MAPE MAE RMSE MAPE MAE RMSE MAPE
TCN0 5.55±\pm.02 8.82±\pm.04 34.5%±\pm.6 5.74±\pm.02 9.38±\pm.06 36.9%±\pm.9 6.01±\pm.02 1.05±\pm.11 38.2%±\pm.5 7.18±\pm.05 12.22±\pm.1 39.7%±\pm1.4
GWNet2 5.46±\pm.01 8.72±\pm.04 32.5%±\pm1.3 5.62±\pm.03 9.08±\pm.11 32.9%±\pm1.3 5.70±\pm.02 9.44±\pm.03 33.8%±\pm1.2 6.08±\pm.06 10.31±\pm.2 34.6%±\pm1.6
Gman1 5.37±\pm.01 8.61±\pm.05 32.6%±\pm2 5.51±\pm.04 8.99±\pm.14 32.8%±\pm1.2 5.61±\pm.02 9.20±\pm.11 33.1%±\pm.7 5.77±\pm.02 9.68±\pm.11 34.4%±\pm1.0
MTGNN2 5.29±\pm.02 8.52±\pm.03 32.2%±\pm1.4 5.45±\pm.01 8.86±\pm.01 32.7%±\pm1.6 5.60±\pm.04 9.27±\pm.03 32.9%±\pm1.7 5.74±\pm.03 9.66±\pm.13 35.3%±\pm1.9
MPNet1 5.30±\pm.01 8.46±\pm.04 32.9%±\pm2.0 5.44±\pm.03 8.84±\pm.09 34.7%±\pm1.6 5.55±\pm.01 9.16±\pm.02 33.1%±\pm1.7 5.73±\pm.03 9.68±\pm.06 34.8%±\pm2.1
DMGCN2 5.28±\pm.04 8.48±\pm.11 31.8%±\pm1.7 5.46±\pm.01 8.81±\pm.03 33.6%±\pm1.9 5.68±\pm.03 9.21±\pm.02 33.9%±\pm.9 5.82±\pm.02 9.56±\pm.08 34.6%±\pm1.1
ESG2 5.26±\pm.03 8.43±\pm.03 31.1%±\pm1.1 5.40±\pm.02 8.76±\pm.06 31.8%±\pm1.3 5.54±\pm.03 9.16±\pm.03 32.1%±\pm1.3 5.65±\pm.02 9.46±\pm.09 33.2%±\pm1.1
MFGM1 5.23±\pm.01 8.27±\pm.06 29.8%±\pm.7 5.33±\pm.02 8.54±\pm.06 30.5%±\pm.8 5.43±\pm.05 8.94±\pm.07 30.9%±\pm.6 5.51±\pm.03 9.10±\pm.07 31.3%±\pm.7

0 denotes the TCN-based methods, 1 denotes the Attention-based methods, and 2 denotes the GCN-based methods.

Table 3: Performance comparisons from short-term to long-term V-GCT predictions

Experiments

Experimental Setups. For the CGATL, channel numbers are set at C=32C=32 and C=8C^{\prime}=8. We utilize the Adam optimizer with a learning rate of 0.0005 and weight decay of 0.0001. Following (Li et al. 2018), we split all temporal sequences into 70% training, 20% validation, and 10% testing. Each 24-step sample uses the first 12 steps (TinT_{in}) as historical input, and the following 12 steps (ToutT_{out}). More details are at: https://github.com/cylin-cmlab/GCT-Prediction.

Metrics. We use Mean Absolute Error (MAE), Root Mean Squared Error (RMSE), and Mean Absolute Percentage Error (MAPE) as evaluation metrics.

Baselines. We have chosen representative spatio-temporal baselines for this new task: Temporal Convolution (TCN) (Yu and Koltun 2015): The convolution method captures dependencies at different time scales. GWNet (Wu et al. 2019): A graph-based WaveNet model equipped with a spatial diffusion mechanism. MTGNN (Wu et al. 2020): A graph-based convolutional model that dynamically learns graph structures. Gman (Zheng et al. 2020): A graph multi-attention model to capture the impact of the spatio-temporal factors. MPNet (Lin et al. 2021): A hybrid-GAT model with propagation attention. DMGCN (Han et al. 2021): A graph-based model that leverages time-specific spatial dependencies. ESG’22 (Ye et al. 2022): A graph-based model employing evolutionary and multi-scale graph structures.

V-GCT Prediction Evaluation

Table 3 presents short- to long-term predictions, categorizing baselines by implementation. Our MFGM consistently outperforms various baselines. In short-term predictions (15-30 mins), recent patterns often prevail, creating similar performances among baselines, yet MFGM still exceeds them. In long-term predictions (45-60 mins), as temporal dependencies and patterns wane (Ye et al. 2022), MFGM extracts both short- and long-term spatio-temporal dependencies. The former aids near-term predictions, the latter supports distant forecasting, and their integration boosts MFGM’s long-term prediction. Furthermore, by leveraging interactions between V-GCT and its subtracted types, our model enhances insights into regional functionality and crowd activity. As predictions extend, MFGM’s superiority is emphasized, underlining its real-world applicability.

Ablation Study of MFGM

We evaluate the contributions of MFGM’s components by comparing the full model to three ablated versions: without Multivariate Facet Modeling (w/o M), without Spatial Facet Modeling (w/o S), and without Temporal Facet Modeling (w/o T). Table 4 presents average results for prediction steps 1 (5 min.) to 12 (60 min.), ordered by impact:

Impact of w/o S. Omitting spatial modeling has the most significant detrimental effect on performance, highlighting the need to capture spatial dependencies between V-GCT flows on road segments.

Impact of w/o M. Without exploring of hidden correlations between multi-type GCT flows results in the second-worst performance, emphasizing the importance of investigating implicit relationships to reveal regional attributes.

Impact of w/o T. The less significant performance decline compared to w/o S and w/o M suggests that in predicting V-GCT flow, spatial information and regional functionality are more crucial. However, the performance drop in w/o T still indicates the importance of temporal modeling.

Overall, the full MFGM consistently surpasses its ablated versions, underlining the essence of each facet modeling.

Baselines MAE RMSE MAPE
w/o S 5.46±\pm0.06 8.82±\pm0.06 32.1%±\pm0.4
w/o M 5.44±\pm0.03 8.73±\pm0.04 31.9%±\pm0.5
w/o T 5.40±\pm0.03 8.71±\pm0.06 31.5%±\pm0.6
Full 5.34±\pm0.05 8.61±\pm0.03 30.9%±\pm0.5
Table 4: Ablation study for overall performance.

Sensitivity Analysis of Multi-Type GCT Flows

Figure 7 shows the effect of different combinations on prediction performance over various steps. In steps 1-4, the model with V-GCT and (V-P)-GCT performs better than the one with V-GCT and (V-S)-GCT. After step 4, the latter model performs better, suggesting varying importance of relative differences between vehicle and pedestrian or stationary GCT flows depending on prediction horizon. Moreover, the model with V-GCT and all subtraction-type GCT flows consistently achieves the top performance across all steps, highlighting the benefits of exploring relative differences among GCT flows.

Refer to caption
Figure 7: The pairing of V-GCT flow with all subtraction-type GCT flows consistently results in the lowest errors.

Conclusion

We presented multi-type GCT flows as a novel data source for transportation and proposed MFGM to predict V-GCT flows with improved accuracy by integrating multi-type GCT flows. MFGM outperforms baselines, excelling in long-term predictions, and the ablation study confirms the importance of spatial and regional attributes. We also revealed V-GCT integration into transportation systems, presenting new applications for telecom data in transportation.

Acknowledgments

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

References

  • Babu and Manoj (2020) Babu, S.; and Manoj, B. 2020. Toward a type-based analysis of road networks. ACM Transactions on Spatial Algorithms and Systems (TSAS), 6(4): 1–45.
  • Brody, Alon, and Yahav (2022) Brody, S.; Alon, U.; and Yahav, E. 2022. How Attentive are Graph Attention Networks? In International Conference on Learning Representations.
  • Cohen et al. (2009) Cohen, I.; Huang, Y.; Chen, J.; Benesty, J.; Benesty, J.; Chen, J.; Huang, Y.; and Cohen, I. 2009. Pearson correlation coefficient. Noise reduction in speech processing.
  • Deng and Hooi (2021) Deng, A.; and Hooi, B. 2021. Graph neural network-based anomaly detection in multivariate time series. In Proc. of AAAI, volume 35, 4027–4035.
  • Han et al. (2021) Han, L.; Du, B.; Sun, L.; Fu, Y.; Lv, Y.; and Xiong, H. 2021. Dynamic and multi-faceted spatio-temporal deep learning for traffic speed forecasting. In Proc. of KDD.
  • Jiang et al. (2013) Jiang, S.; Fiore, G. A.; Yang, Y.; Ferreira Jr, J.; Frazzoli, E.; and González, M. C. 2013. A review of urban computing for mobile phone traces: current methods, challenges and opportunities. In Proceedings of the 2nd ACM SIGKDD international workshop on Urban Computing.
  • Jiang (2022) Jiang, W. 2022. Cellular traffic prediction with machine learning: A survey. Expert Systems with Applications, 117163.
  • Li et al. (2018) Li, Y.; Yu, R.; Shahabi, C.; and Liu, Y. 2018. Diffusion Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting. In Proc. of ICLR.
  • Lin et al. (2021) Lin, C.-Y.; Su, H.-T.; Tung, S.-L.; and Hsu, W. H. 2021. Multivariate and Propagation Graph Attention Network for Spatial-Temporal Prediction with Outdoor Cellular Traffic. In Proc. of CIKM.
  • Lv et al. (2021) Lv, Z.; Li, Y.; Feng, H.; and Lv, H. 2021. Deep learning for security in digital twins of cooperative intelligent transportation systems. IEEE Transactions on Intelligent Transportation Systems.
  • Peng et al. (2016) Peng, C.-H.; Yang, Y.-L.; Bao, F.; Fink, D.; Yan, D.-M.; Wonka, P.; and Mitra, N. J. 2016. Computational network design from functional specifications. ACM Transactions on Graphics (TOG), 35(4): 1–12.
  • Shao et al. (2022) Shao, W.; Jin, Z.; Wang, S.; Kang, Y.; Xiao, X.; Menouar, H.; Zhang, Z.; Zhang, J.; and Salim, F. 2022. Long-term Spatio-Temporal Forecasting via Dynamic Multiple-Graph Attention. Proc. of IJCAI.
  • Shuman et al. (2013) Shuman, D. I.; Narang, S. K.; Frossard, P.; Ortega, A.; and Vandergheynst, P. 2013. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE signal processing magazine.
  • Veličković et al. (2018) Veličković, P.; Cucurull, G.; Casanova, A.; Romero, A.; Lio, P.; and Bengio, Y. 2018. Graph Attention Networks. In Proc. of ICLR.
  • Wang et al. (2021) Wang, C.; Zhu, Y.; Zang, T.; Liu, H.; and Yu, J. 2021. Modeling inter-station relationships with attentive temporal graph convolutional network for air quality prediction. In Proc. of WSDM, 616–634.
  • Wu et al. (2020) Wu, Z.; Pan, S.; Long, G.; Jiang, J.; Chang, X.; and Zhang, C. 2020. Connecting the dots: Multivariate time series forecasting with graph neural networks. In Proc. of KDD.
  • Wu et al. (2019) Wu, Z.; Pan, S.; Long, G.; Jiang, J.; and Zhang, C. 2019. Graph WaveNet for Deep Spatial-Temporal Graph Modeling. In Proc. of IJCAI.
  • Xie et al. (2020) Xie, P.; Li, T.; Liu, J.; Du, S.; Yang, X.; and Zhang, J. 2020. Urban flow prediction from spatiotemporal data using machine learning: A survey. Information Fusion.
  • Xu et al. (2017) Xu, J.; Rahmatizadeh, R.; Bölöni, L.; and Turgut, D. 2017. Real-time prediction of taxi demand using recurrent neural networks. IEEE Transactions on Intelligent Transportation Systems, 19(8): 2572–2581.
  • Ye et al. (2022) Ye, J.; Liu, Z.; Du, B.; Sun, L.; Li, W.; Fu, Y.; and Xiong, H. 2022. Learning the Evolutionary and Multi-scale Graph Structure for Multivariate Time Series Forecasting. In Proc. of KDD, 2296–2306.
  • Yu, Yin, and Zhu (2018) Yu, B.; Yin, H.; and Zhu, Z. 2018. Spatio-temporal graph convolutional networks: a deep learning framework for traffic forecasting. In Proceedings of the 27th International Joint Conference on Artificial Intelligence.
  • Yu and Koltun (2015) Yu, F.; and Koltun, V. 2015. Multi-scale context aggregation by dilated convolutions. arXiv preprint arXiv:1511.07122.
  • Zhang et al. (2018) Zhang, C.; Zhang, H.; Yuan, D.; and Zhang, M. 2018. Citywide cellular traffic prediction based on densely connected convolutional neural networks. IEEE Communications Letters.
  • Zhang et al. (2020) Zhang, X.; Huang, C.; Xu, Y.; and Xia, L. 2020. Spatial-temporal convolutional graph attention networks for citywide traffic flow forecasting. In Proc. of CIKM, 1853–1862.
  • Zhao et al. (2020) Zhao, H.; Wang, Y.; Duan, J.; Huang, C.; Cao, D.; Tong, Y.; Xu, B.; Bai, J.; Tong, J.; and Zhang, Q. 2020. Multivariate time-series anomaly detection via graph attention network. In Proc. of ICDM, 841–850.
  • Zhao et al. (2021) Zhao, N.; Wu, A.; Pei, Y.; Liang, Y.-C.; and Niyato, D. 2021. Spatial-Temporal Aggregation Graph Convolution Network for Efficient Mobile Cellular Traffic Prediction. IEEE Communications Letters.
  • Zheng et al. (2020) Zheng, C.; Fan, X.; Wang, C.; and Qi, J. 2020. Gman: A graph multi-attention network for traffic prediction. In Proc. of AAAI.
  • Zidic et al. (2023) Zidic, D.; Mastelic, T.; Kosovic, I. N.; Cagalj, M.; and Lorincz, J. 2023. Analyses of ping-pong handovers in real 4G telecommunication networks. Computer Networks, 227: 109699.