Pith. sign in

REVIEW 10 cited by

Deep Bidirectional and Unidirectional LSTM Recurrent Neural Network for Network-wide Traffic Speed Prediction

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1801.02143 v2 pith:S25HHLDR submitted 2018-01-07 cs.LG

Zhiyong Cui , Ruimin Ke , Ziyuan Pu , Yinhai Wang This is my paper · ORCID
classification cs.LG
keywords trafficdatadeeplstmbidirectionalmodelnetworkneural
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Short-term traffic forecasting based on deep learning methods, especially long short-term memory (LSTM) neural networks, has received much attention in recent years. However, the potential of deep learning methods in traffic forecasting has not yet fully been exploited in terms of the depth of the model architecture, the spatial scale of the prediction area, and the predictive power of spatial-temporal data. In this paper, a deep stacked bidirectional and unidirectional LSTM (SBU- LSTM) neural network architecture is proposed, which considers both forward and backward dependencies in time series data, to predict network-wide traffic speed. A bidirectional LSTM (BDLSM) layer is exploited to capture spatial features and bidirectional temporal dependencies from historical data. To the best of our knowledge, this is the first time that BDLSTMs have been applied as building blocks for a deep architecture model to measure the backward dependency of traffic data for prediction. The proposed model can handle missing values in input data by using a masking mechanism. Further, this scalable model can predict traffic speed for both freeway and complex urban traffic networks. Comparisons with other classical and state-of-the-art models indicate that the proposed SBU-LSTM neural network achieves superior prediction performance for the whole traffic network in both accuracy and robustness.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 10 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Programmable-Room: Interactive Textured 3D Room Meshes Generation Empowered by Large Language Models

    cs.CV 2025-06 conditional novelty 6.0 of 10

    A visual-programming framework uses GPT-4 to chain modules that generate, texture, furnish, and edit 3D room meshes from natural language, with a new panorama diffusion model (PRIG).

  2. Investigating Compositional Reasoning in Time Series Foundation Models

    cs.LG 2025-02 conditional novelty 6.0 of 10

    On a benchmark where models train on Fourier components and test on their sums, patch-based Transformers and residual MLP architectures show the strongest compositional generalization, while most standard transformers...

  3. Graph Coloring for Multi-Task Learning

    cs.LG 2025-09 conditional novelty 5.0 of 10

    SON-GOKU measures gradient conflicts between tasks, builds a conflict graph, greedily colors it, and updates one compatible task group per step, reporting gains over multi-task baselines.

  4. PHASE: Passive Human Activity Simulation Evaluation

    cs.CR 2025-07 conditional novelty 5.0 of 10

    PHASE uses a deep neural network on Zeek connection logs to classify network traffic as human vs. non-human, and applies the same model to evaluate and tune a synthetic user persona.

  5. MPBD-LSTM: A Predictive Model for Colorectal Liver Metastases Using Time Series Multi-phase Contrast-Enhanced CT Scans

    eess.IV 2024-12 conditional novelty 5.0 of 10

    A bi-directional LSTM with two parallel phase-processing planes predicts colorectal liver metastases from multi-phase follow-up CTs with AUC 0.79, modestly beating four published baselines.

  6. Kernel Dynamic Mode Decomposition For Sparse Reconstruction of Closable Koopman Operators

    math.DS 2025-05 reject novelty 4.0 of 10

    The paper claims the Laplacian kernel enables better kernel DMD reconstruction from sparse irregular data and proves Koopman closability, but the proofs have invalid steps and circular reasoning.

  7. Forecasting at Full Spectrum: Holistic Multi-Granular Traffic Modeling under High-Throughput Inference Regimes

    cs.LG 2025-05 conditional novelty 4.0 of 10

    MultiGran-STGCNFog fuses multi-granular spatiotemporal features in a GCN and uses a genetic-algorithm scheduler to pipeline inference across heterogeneous fog devices, reporting up to 9.86% accuracy improvement and 2....

  8. A Double-Norm Aggregated Tensor Latent Factorization Model for Temporal-Aware Traffic Speed Imputation

    cs.LG 2025-04 conditional novelty 4.0 of 10

    TATSI combines L2 and smooth-L1 losses in nonnegative tensor factorization and reports lower RMSE and MAE than three QoS baselines on three traffic speed datasets.

  9. Wind Speed Forecasting Based on Data Decomposition and Deep Learning Models: A Case Study of a Wind Farm in Saudi Arabia

    cs.LG 2024-12 reject novelty 4.0 of 10

    A hybrid WPD-SAM-BiLSTM model reports the lowest wind-speed forecast errors among 27 benchmarks on five years of hourly data from the Dumat Al-Jandal wind farm.

  10. Bi-Directional ConvLSTM U-Net with Densley Connected Convolutions

    eess.IV 2019-08 reject novelty 4.0 of 10

    BCDU-Net, a U-Net variant with bi-directional ConvLSTM skip connections and dense convolutions, is reported to improve segmentation on retinal vessels, skin lesions, and lung nodules.

Pith tools