TF-DWGNet: Dynamic Weighted Graph Methods

• The paper on traffic forecasting demonstrates TF-DWGNet by integrating dynamic weighted graph structure with spatial self-attention and frequency-domain MLPs, achieving superior performance on real-world datasets.
• In multi-omics cancer subtype classification, TF-DWGNet employs supervised, XGBoost-derived directed weighted graphs combined with low-rank tensor fusion to capture complex inter-modality interactions.
• TF-DWGNet clarifies its domain-specific nomenclature by contrasting its usage with DWNet, highlighting distinct graph construction procedures and learning objectives across traffic and cancer applications.

TF-DWGNet is a designation that appears in the provided literature in two distinct technical senses rather than as a single standardized architecture. In traffic forecasting, it encapsulates traffic forecasting with dynamic weighted graph networks, where the dynamic weighted graph structure (DWGS) embedding is operationalized inside the model DWAFM to learn time-varying edge weights over a fixed physical sensor topology (Shi et al., 1 Mar 2026). In multi-omics cancer subtype classification, TF-DWGNet denotes “A Directed Weighted Graph Neural Network with Tensor Fusion”, a supervised, modality-aware framework that constructs directed weighted graphs per omics modality from XGBoost trees and fuses modality-specific embeddings through low-rank tensor fusion (Yang et al., 19 Sep 2025). A related communication-network paper explicitly states that TF-DWGNet does not appear there and that the relevant model is DWNet, not TF-DWGNet (Liu et al., 2023).

1. Nomenclature and domain-specific usage

In the provided corpus, the same designation is attached to substantially different objects: a traffic-forecasting paradigm centered on dynamic weighted graph embeddings, and a cancer-subtyping architecture centered on directed weighted feature graphs and tensor fusion. The overlap lies in the use of weighted graph structure as an inductive bias, but the graph semantics, learning objectives, and downstream tasks differ materially.

Context	Meaning of TF-DWGNet	Core components
Traffic forecasting	traffic forecasting with dynamic weighted graph networks	DWGS embedding, spatial self-attention, frequency-domain MLPs
Multi-omics cancer subtype classification	A Directed Weighted Graph Neural Network with Tensor Fusion	XGBoost-derived directed weighted graphs, GEDFN, low-rank tensor fusion
Communication-network modeling	term absent; the paper proposes DWNet	heterogeneous path–link GNN for latency and jitter prediction

A common source of confusion is terminological rather than methodological. The traffic paper treats TF-DWGNet as an umbrella description for a dynamic weighted graph approach instantiated by DWAFM, whereas the cancer paper uses TF-DWGNet as the formal model name. The communication-network paper removes further ambiguity by stating that the “TF-” designation is not part of DWNet (Liu et al., 2023).

2. Traffic forecasting formulation under TF-DWGNet

Within the traffic literature, TF-DWGNet is grounded in a sensor-network forecasting problem defined on an undirected graph $G = (V, E, A)$, where $V = \{v_1, v_2, \ldots, v_N\}$ are $N$ observation points, $E$ encodes connectivity based on the physical road layout, and $A \in \mathbb{R}^{N \times N}$ quantifies spatial association when a physical connection exists and $0$ otherwise. Historical traffic data are represented as $X \in \mathbb{R}^{T \times N \times D}$, and the task is to predict $Y \in \mathbb{R}^{T_f \times N \times D}$ for the next $T_f$ steps through a learned mapping $F$, written as $V = \{v_1, v_2, \ldots, v_N\}$0. In the reported experiments, both the input length $V = \{v_1, v_2, \ldots, v_N\}$1 and the output horizon $V = \{v_1, v_2, \ldots, v_N\}$2 are set to $V = \{v_1, v_2, \ldots, v_N\}$3 steps (Shi et al., 1 Mar 2026).

The node semantics are explicitly physical. Nodes correspond to sensors such as loop detectors or cameras situated on road segments or intersections, and edges reflect navigable road segments. A predefined adjacency $V = \{v_1, v_2, \ldots, v_N\}$4, derived from the physical topology, is assumed to be available and is used as a structural mask. This design fixes the graph skeleton while allowing the model to vary the strength of associations over time. The paper positions this as a response to the limitation of static graphs, which can encode fixed connectivity but cannot reflect changes such as rush-hour versus off-peak association patterns (Shi et al., 1 Mar 2026).

In this setting, TF-DWGNet is instantiated by the dynamic weighted graph structure embedding. The core claim is that the dynamic graph should be learned from observations while preserving the physical topology. This makes the graph representation time-varying without permitting arbitrary edges outside the physical road network. The paper states that DWGS is the concrete dynamic weighted graph instantiation and that DWAFM operationalizes TF-DWGNet by integrating DWGS embedding with attention and frequency-domain MLPs (Shi et al., 1 Mar 2026).

3. Dynamic weighted graph structure and the DWAFM architecture

DWGS learns a time-varying, data-driven weighted adjacency by applying self-attention to the original data at each time step. For every time $V = \{v_1, v_2, \ldots, v_N\}$5,

$V = \{v_1, v_2, \ldots, v_N\}$6

with $V = \{v_1, v_2, \ldots, v_N\}$7 and $V = \{v_1, v_2, \ldots, v_N\}$8, yielding $V = \{v_1, v_2, \ldots, v_N\}$9. The attention logits are

$N$0

Topology-aware masking is then imposed: for non-connected entries, $N$1 if $N$2, and otherwise the value is unchanged. After row-wise softmax,

$N$3

which is asymmetric and row-stochastic. Symmetrization produces the valid undirected dynamic weighted adjacency

$N$4

and the DWGS embedding is

$N$5

so that $N$6 after aggregation over time (Shi et al., 1 Mar 2026).

The embedding layer fuses four sources of information. The feature embedding is $N$7. Temporal periodicity is encoded through two learnable tables, $N$8 and $N$9, which yield $E$0 and $E$1 and are concatenated as

$E$2

A learnable spatial-temporal adaptive embedding $E$3 is introduced “to capture the hidden spatial relationships,” and is concatenated with $E$4 to form

$E$5

The final hidden representation is

$E$6

with $E$7 (Shi et al., 1 Mar 2026).

Spatial modeling is performed by compressing $E$8 to node-level features via two 1D-CNNs,

$E$9

followed by spatial self-attention:

$A \in \mathbb{R}^{N \times N}$0

$A \in \mathbb{R}^{N \times N}$1

The tuned scaling factor is $A \in \mathbb{R}^{N \times N}$2 rather than $A \in \mathbb{R}^{N \times N}$3, and the paper states that this is empirically better. Up-sampling through two further 1D-CNNs gives

$A \in \mathbb{R}^{N \times N}$4

and residual normalization yields

$A \in \mathbb{R}^{N \times N}$5

DWGS influences this attention stage indirectly by changing $A \in \mathbb{R}^{N \times N}$6 through $A \in \mathbb{R}^{N \times N}$7 and $A \in \mathbb{R}^{N \times N}$8 (Shi et al., 1 Mar 2026).

Temporal modeling is shifted to the frequency domain. The model applies FFT along the temporal dimension,

$A \in \mathbb{R}^{N \times N}$9

with real and imaginary parts $0$0 and $0$1, and then uses two parameter-independent MLPs with cross-combination:

$0$2

Each MLP follows

$0$3

Inverse FFT returns the representation to the time domain:

$0$4

The prediction head maps the final spatiotemporal output to $0$5 with a fully connected layer, and training uses the MAE objective

$0$6

Implementation uses BasicTS, Adam with initial learning rate $0$7, batch size $0$8, $0$9 epochs, and a train/val/test split of $X \in \mathbb{R}^{T \times N \times D}$0 (Shi et al., 1 Mar 2026).

4. Empirical behavior of DWAFM as a traffic TF-DWGNet

The traffic instantiation of TF-DWGNet is evaluated on five real-world datasets: three highway traffic flow datasets, PEMS03, PEMS04, and PEMS08, and two speed datasets, PEMSD7(L) and PEMSD7(M). Metrics are MAE, RMSE, and MAPE(%), and the baselines are HI, STGCN, GWNet, StemGNN, STNorm, STID, DGCRN, MegaCRN, STWave, STAEformer, and DFDGCN (Shi et al., 1 Mar 2026).

The reported quantitative results are specific. On PEMS08, DWAFM achieves MAE = 13.57, RMSE = 22.94, MAPE = 8.92, outperforming all listed baselines on all three metrics. On PEMS04, it achieves MAE = 18.14, RMSE = 29.72, MAPE = 12.37, and is best on MAE and RMSE while competitive on MAPE. On PEMS03, it achieves RMSE = 23.96, which is reported as the best, with competitive MAE and MAPE. On PEMSD7(M), it achieves MAE = 2.59, RMSE = 5.24, MAPE = 6.40, best across all metrics. On PEMSD7(L), it achieves MAE = 2.79, RMSE = 5.70, MAPE = 7.09, best or second-best depending on the metric (Shi et al., 1 Mar 2026).

The ablation studies on PEMS08 and PEMSD7(M) attribute these results to several components rather than to a single module. Removing the dynamic adjacency $X \in \mathbb{R}^{T \times N \times D}$1 or the DWGS embedding $X \in \mathbb{R}^{T \times N \times D}$2 degrades performance. Removing the spatial embedding $X \in \mathbb{R}^{T \times N \times D}$3, the temporal embedding $X \in \mathbb{R}^{T \times N \times D}$4, FFT, or the entire spatial or temporal layers further hurts performance. The paper states that DWGS and FFT are both crucial. It also reports that the proposed frequency-domain MLPs outperform CNN and Attention alternatives across MAE, RMSE, and MAPE on PEMS08 and PEMSD7(M), while matching CNN runtime and exceeding self-attention efficiency (Shi et al., 1 Mar 2026).

The visualization results connect the dynamic adjacency to observed traffic behavior. Learned $X \in \mathbb{R}^{T \times N \times D}$5 correlates with actual flow similarity over time: when two sensors’ flows diverge and later realign, their inferred correlation strength decreases and then recovers accordingly. Forecast plots show that DWAFM better tracks rising trends, abrupt speed drops, and stable intervals than strong baselines such as STAEformer, STWave, and MegaCRN. The practical insights section further identifies non-stationary traffic regimes, heterogeneous correlations, and incident-driven disruptions as cases where DWGS is especially useful, while also documenting failure modes: an overly restrictive $X \in \mathbb{R}^{T \times N \times D}$6 can suppress useful associations, MAPE is unstable for near-zero ground truth, the attention scaling factor and embedding dimension $X \in \mathbb{R}^{T \times N \times D}$7 are sensitive, and sudden sensor anomalies or noise may transiently distort dynamic weights (Shi et al., 1 Mar 2026).

5. TF-DWGNet for multi-omics cancer subtype classification

In the multi-omics literature, TF-DWGNet is a supervised, modality-aware graph neural architecture for multiclass cancer subtype classification. The inputs are $X \in \mathbb{R}^{T \times N \times D}$8 patients measured across $X \in \mathbb{R}^{T \times N \times D}$9 omics layers, with the paper considering $Y \in \mathbb{R}^{T_f \times N \times D}$0 modalities: DNA methylation, mRNA, and miRNA. For modality $Y \in \mathbb{R}^{T_f \times N \times D}$1, the feature matrix is $Y \in \mathbb{R}^{T_f \times N \times D}$2 and the labels are $Y \in \mathbb{R}^{T_f \times N \times D}$3. The motivation is that the data are high-dimensional and heterogeneous, and that the predictive structure includes both intra-modality dependencies and inter-modality interactions (Yang et al., 19 Sep 2025).

The model constructs a directed weighted graph for each modality using a supervised, tree-based scheme grounded in XGBoost. Each XGBoost tree is viewed as a directed graph in which the order of features along a root-to-leaf path induces a precedence relation: if feature $Y \in \mathbb{R}^{T_f \times N \times D}$4 is used before feature $Y \in \mathbb{R}^{T_f \times N \times D}$5 on a splitting path, an edge $Y \in \mathbb{R}^{T_f \times N \times D}$6 is created. Aggregating over the ensemble yields counts $Y \in \mathbb{R}^{T_f \times N \times D}$7 of how often feature $Y \in \mathbb{R}^{T_f \times N \times D}$8 precedes $Y \in \mathbb{R}^{T_f \times N \times D}$9, and the raw adjacency is

$T_f$0

Self-loops are added through $T_f$1, with degree matrix $T_f$2, followed by symmetric degree normalization

$T_f$3

The paper states that this balances the influence of highly connected nodes while preserving directionality in the edge weights (Yang et al., 19 Sep 2025).

The supervision signal enters graph construction through XGBoost’s regularized gain criterion. For a candidate split with left/right gradient sums $T_f$4, Hessian sums $T_f$5, and parent $T_f$6, the gain is

$T_f$7

where $T_f$8 and $T_f$9 are regularization parameters. Features that consistently yield large gains are selected earlier and more frequently, so edge direction and edge weight reflect label-informed, task-specific dependencies rather than generic correlations (Yang et al., 19 Sep 2025).

Each modality is then encoded with a Graph-Embedded Deep Feedforward Network. For modality $F$0, the first hidden layer is

$F$1

where $F$2 and $F$3. This gate forces the input-to-hidden connections to respect the directed weighted graph, and the experiments use one hidden layer per modality encoder, producing unimodal embeddings $F$4. Training minimizes categorical cross-entropy with L2 regularization over all trainable parameters from the three GEDFN branches and the downstream classifier, optimized with Adam. The paper also reports dropout, batch normalization, early stopping, and residual connections in the classifier for generalization and stability (Yang et al., 19 Sep 2025).

6. Tensor fusion, interpretability, and empirical performance in cancer subtyping

TF-DWGNet’s second defining component is tensor fusion with low-rank decomposition. For a sample $F$5, with modality embeddings $F$6, each embedding is augmented by a bias term,

$F$7

The full fusion tensor is the third-order outer product

$F$8

which enumerates unimodal, bimodal, and trimodal interactions. Rather than materializing $F$9, TF-DWGNet uses Canonical Polyadic decomposition with rank $V = \{v_1, v_2, \ldots, v_N\}$00. With projection matrices $V = \{v_1, v_2, \ldots, v_N\}$01 and nonnegative weight vector $V = \{v_1, v_2, \ldots, v_N\}$02, the fused representation is

$V = \{v_1, v_2, \ldots, v_N\}$03

$V = \{v_1, v_2, \ldots, v_N\}$04

followed by logits $V = \{v_1, v_2, \ldots, v_N\}$05 and softmax. The stated computational benefit is a reduction from cubic to linear complexity in dimensions and rank (Yang et al., 19 Sep 2025).

Interpretability is embedded in the architecture at both feature and modality levels. For feature $V = \{v_1, v_2, \ldots, v_N\}$06 in modality $V = \{v_1, v_2, \ldots, v_N\}$07, the importance score is

$V = \{v_1, v_2, \ldots, v_N\}$08

where the indicator excludes self-loops. Modality importance is the normalized sum of feature scores,

$V = \{v_1, v_2, \ldots, v_N\}$09

On BRCA, the top-ranked genes include FAM134B and FOXC1, which the paper describes as consistent with the literature (Yang et al., 19 Sep 2025).

Evaluation is performed on three TCGA cohorts with 20 stratified splits (60/20/20 train/val/test) and fixed seeds. The cohorts are BRCA with $V = \{v_1, v_2, \ldots, v_N\}$10, $V = \{v_1, v_2, \ldots, v_N\}$11; UCEC with $V = \{v_1, v_2, \ldots, v_N\}$12, $V = \{v_1, v_2, \ldots, v_N\}$13; and KIPAN with $V = \{v_1, v_2, \ldots, v_N\}$14, $V = \{v_1, v_2, \ldots, v_N\}$15. Directed weighted graphs are constructed per modality using XGBoost with 100 trees. For BRCA, selected features were 878:825:494 for methylation:mRNA:miRNA, with 4,300:3,658:4,176 edges and edge-to-node ratios 4.90:4.43:8.45. UCEC and KIPAN had ratios between approximately 2.3 and 2.9 (Yang et al., 19 Sep 2025).

The reported predictive performance is consistently stronger than the baselines RF, XGBoost, DFN, GCN, and GEDFN. On BRCA, TF-DWGNet achieves Accuracy 0.821 ± 0.023, F1-weighted 0.826 ± 0.022, and F1-macro 0.785 ± 0.033, with most Welch’s $V = \{v_1, v_2, \ldots, v_N\}$16-test comparisons satisfying $V = \{v_1, v_2, \ldots, v_N\}$17. On UCEC, it achieves Accuracy 0.869 ± 0.038, F1-weighted 0.858 ± 0.034, and F1-macro 0.598 ± 0.056, with many differences statistically significant at $V = \{v_1, v_2, \ldots, v_N\}$18. On KIPAN, it achieves Accuracy 0.964 ± 0.017, F1-weighted 0.964 ± 0.017, and F1-macro 0.956 ± 0.024; the paper notes that the task is relatively separable, so significance is limited in some comparisons. Implementation uses TensorFlow with Adam, learning rate $V = \{v_1, v_2, \ldots, v_N\}$19, batch size $V = \{v_1, v_2, \ldots, v_N\}$20, up to $V = \{v_1, v_2, \ldots, v_N\}$21 epochs, dropout $V = \{v_1, v_2, \ldots, v_N\}$22, L2 regularization $V = \{v_1, v_2, \ldots, v_N\}$23, batch normalization, early stopping with patience $V = \{v_1, v_2, \ldots, v_N\}$24 and min-delta $V = \{v_1, v_2, \ldots, v_N\}$25, and tensor fusion rank $V = \{v_1, v_2, \ldots, v_N\}$26; experiments ran on the Falcon supercomputer with 4 CPUs and 20 GB RAM per job (Yang et al., 19 Sep 2025).

The limitations are also explicit. The graph construction depends on label quality and splitting criteria; symmetric degree normalization may partially attenuate asymmetry in propagation; scaling to more modalities requires careful rank selection; the current study assumes complete multi-omics; and future work is suggested in missing-modality handling, domain shift, self-supervised pretraining, contrastive alignment, dynamic graph learning, causal inference for directionality, and uncertainty quantification (Yang et al., 19 Sep 2025).

7. Distinctions from related graph-network terminology

The provided literature supports a narrow but important clarification: TF-DWGNet should not be conflated with DWNet. The communication-network paper “Deeper and Wider Networks for Performance Metrics Prediction in Communication Networks” states that the term TF-DWGNet does not appear there, and that the proposed model is DWNet, a heterogeneous graph neural network for predicting end-to-end latency and jitter in Digital Twin Networks (Liu et al., 2023).

This distinction matters because the underlying graph objects differ fundamentally. In the traffic setting, nodes are physical sensors and the model learns time-varying edge weights over a masked road topology. In the cancer setting, nodes are selected omics features and edge direction is inferred from label-informed XGBoost splitting paths. In DWNet, by contrast, the graph is a heterogeneous path–link structure with typed nodes, sequence-aware link-to-path aggregation, neighbor-path averaging, and GRU-based closed-loop updates. The DWNet paper additionally notes that if “TF-” were intended to denote temporal fusion, transformer fusion, or transfer learning, that would be outside its scope (Liu et al., 2023).

A plausible implication is that TF-DWGNet functions in the present literature as a domain-specific label rather than a single canonical model family. What links the usages is an emphasis on learning or exploiting weighted graph structure for prediction; what separates them are the graph construction procedures, supervision pathways, and target tasks.