Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Time-interdependency-aware dynamic Bayesian network for traffic prediction
Huijie GUO, Tianfeng DOU, Zhenlin ZHANG, Kaiyuan QI, Dong WU, Zhijian QU, Zhao LI, Chongguang REN
Journal of Computer Applications    2026, 46 (5): 1507-1517.   DOI: 10.11772/j.issn.1001-9081.2025050570
Abstract121)   HTML0)    PDF (1117KB)(238)       Save

Accurate traffic forecasting not only improves the efficiency and safety of the traffic system, but also promotes the sustainable social and economic development. Although a large number of studies have been devoted to modeling spatiotemporal correlation, existing methods still have significant limitations: most models tend to collectively predict the traffic flow of all regions in all time periods, ignoring spatio-temporal heterogeneity, especially the impact of the traffic status of the current region on the future traffic status of related regions. To address this problem, a Time-Interdependency-aware Dynamic Bayesian Network for traffic prediction (TIDBN) method was proposed. Using pre-trained modules, TIDBN employed a time-varying dynamic Bayesian network to capture the complex temporal relationships in time-series data arising from simultaneous and lagged effects. To further improve its ability to capture spatio-temporal correlation, a spatio-temporal attention mechanism was introduced for in-depth analysis. Subsequently, a Graph Convolutional Network (GCN) was utilized to model the spatio-temporal topological structure, generating more accurate traffic predictions. The experimental results show that TIDBN performs excellently on two real traffic prediction tasks, especially for 1-hour prediction. On the PeMS-BAY dataset, the Mean Absolute Error (MAE) of TIDBN is 4% lower than that of the second-best baseline method.

Table and Figures | Reference | Related Articles | Metrics
Density biased sampling algorithm based on variable grid division
SHENG Kaiyuan QIAN Xuezhong WU Qin
Journal of Computer Applications    2013, 33 (09): 2419-2422.   DOI: 10.11772/j.issn.1001-9081.2013.09.2419
Abstract876)      PDF (640KB)(444)       Save
As the most commonly used method of reducing large-scale datasets, simple random sampling usually causes the loss of some clusters when dealing with unevenly distributed dataset. A density biased sampling algorithm based on grid can solve these defects, but both the efficiency and effect of sampling can be affected by the granularity of grid division. To overcome the shortcoming, a density biased sampling algorithm based on variable grid division was proposed. Every dimension of original dataset was divided according to the corresponding distribution, and the structure of the constructed grid was matched with the distribution of original dataset. The experimental results show that density biased sampling based on variable grid division can achieve higher quality of sample dataset and uses less execution time of sampling compared with the density biased sampling algorithm based on fixed grid division.
Related Articles | Metrics